On bisimulations for the spi calculus

DOI10.1007/3-540-45719-4_20MaRDI QIDQ2996142zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• On bisimulations for the spi calculus
• A complete symbolic bisimilarity for an extended spi calculus
• scientific article; zbMATH DE number 1507234
• CONCUR 2004 - Concurrency Theory
• A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract

Cited in

(15)

• Implementing Spi Calculus Using Nominal Techniques
• Automated verification of selected equivalences for security protocols
• Deciding framed bisimilarity
• Normal Bisimulations in Calculi with Passivation
• Formalising Observer Theory for Environment-Sensitive Bisimulation
• scientific article; zbMATH DE number 1507234 (Why is no real title available?)
• Open bisimulation, revisited
• Pattern-matching spi-calculus
• On bisimulations for the spi calculus
• Computing strong and weak bisimulations for psi-calculi
• Reasoning about cryptographic protocols in the spi calculus
• A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
• CONCUR 2004 - Concurrency Theory
• EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS
• A bisimulation for dynamic sealing

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)