A Testing Theory for a Higher-Order Cryptographic Language
From MaRDI portal
Publication:3000588
DOI10.1007/978-3-642-19718-5_19zbMATH Open1326.68200OpenAlexW2158293316MaRDI QIDQ3000588FDOQ3000588
Vasileios Koutavas, Matthew 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
Recommendations
- Higher-order program verification and language-based security (extended abstract)
- Trustworthy Global Computing
- scientific article
- The coinductive approach to verifying cryptographic protocols.
- scientific article; zbMATH DE number 1962854
- On generalized locally testable languages
- scientific article; zbMATH DE number 1024091
- Integrating Verification, Testing, and Learning for Cryptographic Protocols
Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Bisimulation for higher-order process calculi
- A calculus for cryptographic protocols: The spi calculus
- Mobile values, new names, and secure communication
- Testing equivalences for processes
- On the bisimulation proof method
- The \(\pi\)-calculus: A theory of mobile processes
- Game Semantics for Higher-Order Concurrency
- Proof techniques for cryptographic processes
- Contextual equivalence for higher-order pi-calculus revisited
- CONCUR 2004 - Concurrency Theory
- First-order reasoning for higher-order concurrency
- Logical Bisimulations and Functional Languages
- Title not available (Why is that?)
- On bisimulations for the spi calculus
- The security pi-calculus and non-interference
Cited In (1)
This page was built for publication: A Testing Theory for a Higher-Order Cryptographic Language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000588)
