A Complete Symbolic Bisimilarity for an Extended Spi Calculus

DOI10.1016/j.entcs.2009.07.078zbMath1294.68109OpenAlexW2103263694MaRDI QIDQ5170184

Johannes Borgström

Publication date: 22 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.078

zbMATH Keywords

formal verificationbisimulationcryptographic protocolssymbolic techniques

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)

Related Items (4)

Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ A complete symbolic bisimulation for full applied pi calculus

Cites Work

• Unnamed Item
• Symbolic bisimulations
• Deciding knowledge in security protocols under equational theories
• A calculus of mobile processes. II
• A calculus for cryptographic protocols: The spi calculus
• Mobile values, new names, and secure communication
• CONCUR 2004 - Concurrency Theory
• Symbolic Bisimulation for the Applied Pi Calculus
• On bisimulations for the spi calculus
• Automata, Languages and Programming

This page was built for publication: A Complete Symbolic Bisimilarity for an Extended Spi Calculus