CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68665OpenAlexW2499482941MaRDI QIDQ5311472

Johannes Borgström, Sébastien Briais, Uwe Nestmann

Publication date: 23 August 2005

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

Full work available at URL: https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (16)

Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ SPEC: An Equivalence Checker for Security Protocols ⋮ Formalising Observer Theory for Environment-Sensitive Bisimulation ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Compositional equivalences based on open pNets ⋮ Implementing Spi Calculus Using Nominal Techniques ⋮ Computing strong and weak bisimulations for psi-calculi ⋮ First-order reasoning for higher-order concurrency ⋮ A Testing Theory for a Higher-Order Cryptographic Language ⋮ A formal semantics for protocol narrations ⋮ Open bisimulation, revisited ⋮ Automated verification of selected equivalences for security protocols ⋮ A complete symbolic bisimulation for full applied pi calculus ⋮ A Complete Symbolic Bisimilarity for an Extended Spi Calculus ⋮ Symbolic Bisimulation for the Applied Pi Calculus ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols

Uses Software

• MWB

This page was built for publication: CONCUR 2004 - Concurrency Theory