Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
From MaRDI portal
Publication:2119978
DOI10.1007/978-3-030-85315-0_14OpenAlexW3193892419MaRDI QIDQ2119978
Ross Horne, Sjouke Mauw, Semen Yurkov
Publication date: 31 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85315-0_14
Related Items (2)
When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing strong and weak bisimulations for psi-calculi
- Deducibility constraints and blind signatures
- Intruder deduction problem for locally stable theories with normal forms and inverses
- Deciding knowledge in security protocols under equational theories
- A calculus of mobile processes. I
- A complete symbolic bisimulation for full applied pi calculus
- Private authentication
- A theory of bisimulation for the \(\pi\)-calculus
- A procedure for deciding symbolic equivalence between sets of constraint systems
- Open bisimulation, revisited
- Automated verification of selected equivalences for security protocols
- Proof Techniques for Cryptographic Processes
- A General Theory of Barbs, Contexts, and Labels
- Psi-calculi: a framework for mobile processes with nominal data and logic
- The Applied Pi Calculus
- SPEC: An Equivalence Checker for Security Protocols
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- On the proof method for bisimulation
- Divergence and unique solution of equations
- Quasi-Open Bisimilarity with Mismatch is Intuitionistic
- A Complete Symbolic Bisimilarity for an Extended Spi Calculus
- Mobile values, new names, and secure communication
- Barbed bisimulation
- CONCUR 2004 - Concurrency Theory
- Programming Languages and Systems
- Proving More Observational Equivalences with ProVerif
- Symbolic Bisimulation for the Applied Pi Calculus
- On bisimulations for the spi calculus
- Refinement of actions and equivalence notions for concurrent systems
This page was built for publication: Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
