On bisimulations for the spi calculus
DOI10.1007/3-540-45719-4_20zbMATH Open1275.68101OpenAlexW3022519507MaRDI QIDQ2996142FDOQ2996142
Authors: Johannes Borgström, Uwe Nestmann 
Publication date: 6 May 2011
Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/52540/files/IC_TECH_REPORT_200334.pdf
Recommendations
Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (15)
- On bisimulations for the spi calculus
- Pattern-matching spi-calculus
- Implementing Spi Calculus Using Nominal Techniques
- CONCUR 2004 - Concurrency Theory
- Computing strong and weak bisimulations for psi-calculi
- Deciding framed bisimilarity
- Automated verification of selected equivalences for security protocols
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- A bisimulation for dynamic sealing
- Reasoning about cryptographic protocols in the spi calculus
- EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS
- Open bisimulation, revisited
- Normal Bisimulations in Calculi with Passivation
- Formalising Observer Theory for Environment-Sensitive Bisimulation
- Title not available (Why is that?)
This page was built for publication: On bisimulations for the spi calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996142)
