Psi-calculi

MaRDI QIDQ40287swMATHFDO

Authors Jesper Bengtson

Publication date 29 May 2012

Official website https://www.isa-afp.org/entries/Psi_Calculi.html

Cites work

• A completeness proof for bisimulation in the pi-calculus using Isabelle
• Formalising the pi-calculus using nominal logic
• Unnamed Publication
• Psi-calculi in Isabelle
• Theorem proving in higher order logics. 22nd international conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings

Described by source

• Psi-calculi in Isabelle

Cited in

(19)

• HYBRID
• A formalized general theory of syntax with bindings: extended version
• Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
• Gmeta
• LNgen
• A canonical locally named representation of binding
• Nominal Isabelle
• CC-Pi
• Mechanizing a process algebra for network protocols
• Psi-calculi: a framework for mobile processes with nominal data and logic
• MiniAgda
• Unbound
• AWN
• Computing strong and weak bisimulations for psi-calculi
• POPLMark reloaded: mechanizing proofs by logical relations
• A case study in programming coinductive proofs: Howe's method
• General bindings and alpha-equivalence in Nominal Isabelle
• General bindings and alpha-equivalence in Nominal Isabelle
• Psi-calculi in Isabelle

This page was built for software: Psi-calculi