Theoretical Computer Science
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Linear objects: logical processes with built-in inheritance
Logic programming
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Abstract interpretation of linear logic programming
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
A bottom-up semantics for linear logic programs
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
Petri Nets, Horn Programs, Linear Logic, and Vector Games
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Constraint Logic Programming Applied to Model Checking
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Symbolic Model Checking with Rich ssertional Languages
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Better is Better than Well: On Efficient Verification of Infinite-State Systems
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Decidability of Safety Properties of Timed Multiset Rewriting
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
| Hi-index | 0.00 |
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 approaches [And92,AP90,APC93], the effective fixpoint operator can be used to define a bottom-up evaluation procedure for first-order linear logic programs