Sciweavers

2 search results - page 1 / 1
» Formalising in Nominal Isabelle Crary's Completeness Proof f...
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
13 years 4 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban
ENTCS
2007
98views more  ENTCS 2007»
13 years 4 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow