Skip to Main content Skip to Navigation
Journal articles

Proof Search Specifications of the pi-calculus

Tiu Alwen 1 Dale Miller 2, 3 
1 Logic and Computation group
College of Engineering and Computer Science
2 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : We specify the operational semantics and bisimulation relations for the finite pi-calculus within a logic that contains the nabla quantifier for encoding generic judgments and definitions for encoding fixed points. Since we restrict to the finite case, the ability of the logic to unfold fixed points allows this logic to be complete for both the inductive nature of operational semantics and the coinductive nature of bisimulation. The nabla quantifier helps with the delicate issues surrounding the scope of variables within pi-calculus expressions and their executions (proofs). We illustrate several merits of the logical specifications permitted by this logic: they are natural and declarative; they contain no side-conditions concerning names of variables while maintaining a completely formal treatment of such variables; differences between late and open bisimulation relations arise from familar logic distinctions; the interplay between the three quantifiers (forall, exists, and nabla) and their scopes can explain the differences between early and late bisimulation and between various modal operators based on bound input and output actions; and proof search involving the application of inference rules, unification, and backtracking can provide complete proof systems for one-step transitions, bisimulation, and satisfaction in modal logic. We also illustrate how one can encode the pi-calculus with replications, in an extended logic with induction and co-induction.
Document type :
Journal articles
Complete list of metadata

Cited literature [60 references]  Display  Hide  Download
Contributor : Dale Miller Connect in order to contact the contributor
Submitted on : Thursday, January 10, 2013 - 5:28:31 PM
Last modification on : Thursday, January 20, 2022 - 5:30:48 PM
Long-term archiving on: : Thursday, April 11, 2013 - 4:07:58 AM


Files produced by the author(s)


  • HAL Id : hal-00772571, version 1



Tiu Alwen, Dale Miller. Proof Search Specifications of the pi-calculus. ACM Transactions on Computational Logic, Association for Computing Machinery, 2010, 11 (2). ⟨hal-00772571⟩



Record views


Files downloads