Properties of substitutions and unifications
Journal of Symbolic Computation
Theoretical Computer Science
Foundations of deductive databases and logic programming
Linear objects: logical processes with built-in inheritance
Logic programming
Algebraic properties of idempotent substitutions
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
Type-theoretic foundations for concurrent object-oriented programing
OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
First-order linear logic without modalities is NEXPTIME-hard
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Deciding provability of linear logic formulas
Proceedings of the workshop on Advances in linear logic
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Static analysis of linear logic programming
New Generation Computing
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
A linear logic view of object petri nets
Fundamenta Informaticae - Special issue on Petri nets
Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation
Formal Methods in System Design
Well-structured transition systems everywhere!
Theoretical Computer Science
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
Proofs as computations in linear logic
Theoretical Computer Science
Automated protocol verification in linear logic
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Petri Nets as Models of Linear Logic
CAAP '90 Proceedings of the 15th Colloquium on Trees in Algebra and Programming
Information and Computation
Decidability of Linear Affine Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
An effective fixpoint semantics for linear logic programs
Theory and Practice of Logic Programming
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
Focusing the inverse method for linear logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Logical approximation for program analysis
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi, 1990) enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems (Andreoli, 1992; Cervesato, 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al., 2002). Following this line of research, we define here a general framework for the bottom-up. evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings Abdulla et al., 1996; Finkel and Schnoebelen, 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.