Formalising the Π-calculus Using Nominal Logic

@inproceedings{Bengtson2007FormalisingT,
  title={Formalising the Π-calculus Using Nominal Logic},
  author={Jesper Bengtson and Joachim Parrow},
  year={2007}
}
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standard theorems of bisimulation equivalence and congruence, both late and early, and both strong and weak… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 49 references

The pi-calculus in FM

  • M. J. Gabbay
  • Fairouz Kamareddine, editor, Thirty-five years of…
  • 2003
Highly Influential
3 Excerpts

Gordon , and Sergio Maffeis . Refinenment Types for Secure Implementations

  • Jesper Bengtson, Joachim Parrow
  • 2008

Similar Papers

Loading similar papers…