See this document in CiteSeerX!

An Effective Bottom-Up Semantics for First-Order Linear Logic Programs and its Relationship with Decidability Results for Timed Petri Nets (2001)  (Make Corrections)  
Marco Bozzano, Giorgio Delzanno, Maurizio Martelli
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
disi.unige.it/pub/p...flops01ext.ps.gz
disi.unige.it/pub/perso...flops01.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  disi.unige.it/rese...LP_abstracts (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We study the connection between algorithmic techniques for symbolic model checking [ACJT96, FS98, AJ99], and declarative and operational aspects of linear logic programming [And92, AP90]. Specifically, we show that the construction used to decide verification problems for Timed Petri Nets [AJ99] can be used to define a new fixpoint semantics for the fragment of linear logic called LO [AP90]. The fixpoint semantics is based on an effective TP operator. As an alternative to traditional top-down... (Update)

Active bibliography (related documents):   More   All
0.6:   A Bottom-up Semantics for Linear Logic Programs - Bozzano, Delzanno, Martelli (2000)   (Correct)
0.4:   A Bottom-up Semantics for LO - Bozzano, Delzanno, Martelli   (Correct)
0.3:   Model Checking Linear Logic Specifications - Bozzano, Delzanno, Martelli (2004)   (Correct)

Similar documents based on text:   More   All
0.5:   An Effective Fixpoint Semantics for Linear Logic Programs - Bozzano, Delzanno, Martelli   (Correct)
0.5:   CSTs (Covering Sharing Trees): Compact Data Structures.. - Delzanno, Raskin, Van..   (Correct)
0.5:   Undecidability of LTL for Timed Petri Nets - Abdulla, Nylén   (Correct)

BibTeX entry:   (Update)

@article{ bozzano01effective,
    author = "Marco Bozzano and Giorgio Delzanno and Maurizio Martelli",
    title = "An Effective Bottom-Up Semantics for First-Order Linear Logic Programs",
    journal = "Lecture Notes in Computer Science",
    volume = "2024",
    pages = "138+",
    year = "2001",
    url = "citeseer.ist.psu.edu/bozzano01effective.html" }
Citations (may not include all citations):
1838   Foundations of Logic Programming (context) - Lloyd - 1987  ACM
982   Theoretical Computer Science (context) - Girard - 1987  ACM
268   A theory of timed automata - Alur, Dill - 1990  ACM   DBLP
257   Logic Programming in a Fragment of Intuitionistic Linear Log.. - Hodas, Miller - 1994  ACM   DBLP
223   Linear Objects: Logical Processes with Built-In Inheritance - Andreoli, Pareschi - 1990  ACM
142   Logic Programming with Focusing proofs in Linear Logic - Andreoli - 1992  DBLP
113   Constraint Logic Programming: A Survey (context) - Ja, Maher - 1994  DBLP
88   Model Checking in CLP - Delzanno, Podelski - 1999  ACM   DBLP
73   Symbolic Model Checking with Rich Assertional Languages - Kesten, Maler et al. - 1997  ACM   DBLP
68   A ModelTheoretic Reconstruction of the Operational Semantics.. (context) - Falaschi, Levi et al. - 1993
35   From Petri Nets to Linear Logic (context) - Mart, Meseguer - 1991  ACM   DBLP
32   Petri Nets and Linear Logic: a Case Study for Logic Programm.. - Cervesato - 1995
27   General Decidability Theorems for Innite-State Systems (context) - Abdulla, Cer et al. - 1996
27   Observable Semantics for Constraint Logic Programs - Gabbrielli, Dore et al. - 1995  DBLP
19   Forum: A Multiple-Conclusion Specication Logic (context) - Miller - 1996
17   Constraint logic programming applied to model checking - Fribourg - 2000  ACM   DBLP
11   Abstract Interpretation of Linear Logic Programming - Andreoli, Pareschi et al. - 1993  ACM   DBLP
9   Ensuring Completeness of Symbolic Veri cation Methods for In.. (context) - Abdulla, Jonsson - 1999
8   A Bottom-up semantics for Linear Logic Programs - Bozzano, Delzanno et al. - 2000  ACM   DBLP
7   and Vector Games (context) - Kanovich, Horn et al. - 1994
6   Making Logic Programs Reactive - Harland, Winiko - 1998
5   Better is Better than Well: On Ecient Verication of Innite-S.. (context) - Abdulla, Nylen - 2000
3   Propositional Linear Logic with Weakening is Decidable (context) - Kopylov - 1995

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC