A Testing Theory for a Higher-Order Cryptographic Language

DOI10.1007/978-3-642-19718-5_19zbMath1326.68200OpenAlexW2158293316MaRDI QIDQ3000588

Vasileios Koutavas, Matthew C. B. Hennessy

Publication date: 19 May 2011

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19718-5_19

Mathematics Subject Classification ID

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

Related Items (1)

First-order reasoning for higher-order concurrency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• First-order reasoning for higher-order concurrency
• Bisimulation for higher-order process calculi
• A calculus for cryptographic protocols: The spi calculus
• Testing equivalences for processes
• The security pi-calculus and non-interference
• Proof Techniques for Cryptographic Processes
• Logical Bisimulations and Functional Languages
• On the bisimulation proof method
• Mobile values, new names, and secure communication
• Contextual equivalence for higher-order pi-calculus revisited
• CONCUR 2004 - Concurrency Theory
• Game Semantics for Higher-Order Concurrency
• On bisimulations for the spi calculus

This page was built for publication: A Testing Theory for a Higher-Order Cryptographic Language