A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
A finitary version of the calculus of partial inductive definitions
ELP'91 Conference Proceedings on Extensions of logic programming
Unification under a mixed prefix
Journal of Symbolic Computation
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
Model checking mobile processes
Information and Computation
A calculus for cryptographic protocols
Information and Computation
Cut-elimination for a logic with definitions and induction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Foundational aspects of syntax
ACM Computing Surveys (CSUR)
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Encoding transition systems in sequent calculus
Theoretical Computer Science - Linear logic
A Proof Theory for Generic Judgments: An extended abstract
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution
International Journal on Software Tools for Technology Transfer (STTT)
A logical framework for reasoning about logical specifications
A logical framework for reasoning about logical specifications
Tabled higher-order logic programming
Tabled higher-order logic programming
Mechanized metatheory model-checking
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Theoretical Computer Science
The Bedwyr System for Model Checking over Syntactic Expressions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On the Expressivity of Minimal Generic Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
On the Proof Theory of Regular Fixed Points
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Reasoning about computations using two-levels of logic
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Least and Greatest Fixed Points in Linear Logic
ACM Transactions on Computational Logic (TOCL)
Verification of computation orchestration via timed automata
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Hi-index | 0.00 |
Model checking for transition systems specified in π-calculus has been a difficult problem due to the infinite-branching nature of input prefix, name-restriction and scope extrusion. We propose here an approach to model checking for π-calculus by encoding it into a logic which supports reasoning about bindings and fixed points. This logic, called MediaObjects/InlineFigure1.png, is a conservative extension of Church's Simple Theory of Types with a "generic" quantifier. By encoding judgments about transitions in pi-calculus into this logic, various conditions on the scoping of names and restrictions on name instantiations are captured naturally by the quantification theory of the logic. Moreover, standard implementation techniques for (higher-order) logic programming are applicable for implementing proof search for this logic, as illustrated in a prototype implementation discussed in this paper. The use of logic variables and eigenvariables in the implementation allows for exploring the state space of processes in a symbolic way. Compositionality of properties of the transitions is a simple consequence of the meta theory of the logic (i.e., cut elimination). We illustrate the benefits of specifying systems in this logic by studying several specifications of modal logics for pi-calculus. These specifications are also executable directly in the prototype implementation of MediaObjects/InlineFigure2.png.