A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
From MaRDI portal
Publication:3498447
DOI10.1007/978-3-540-76637-7_25zbMATH Open1137.68455OpenAlexW1568775940MaRDI QIDQ3498447FDOQ3498447
Authors: Alwen Tiu 
Publication date: 15 May 2008
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76637-7_25
Recommendations
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (14)
- Intruder deduction problem for locally stable theories with normal forms and inverses
- On bisimulations for the spi calculus
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- A Proof Theoretic Analysis of Intruder Theories
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Open bisimulation, revisited
- Implementing Spi Calculus Using Nominal Techniques
- Analysing privacy-type properties in cryptographic protocols (invited talk)
- On bisimulations for the spi calculus
- Open bisimulation, revisited
- Title not available (Why is that?)
- Formalising Observer Theory for Environment-Sensitive Bisimulation
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- SPEC: an equivalence checker for security protocols
This page was built for publication: A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498447)
