Implementing Spi Calculus Using Nominal Techniques
From MaRDI portal
Recommendations
- Applying spi-calculus for PayWord
- Pattern-matching spi-calculus
- Symbolic bisimulation in the spi calculus
- On bisimulations for the spi calculus
- On bisimulations for the spi calculus
- Reasoning about cryptographic protocols in the spi calculus
- A calculus for cryptographic protocols: The spi calculus
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- scientific article; zbMATH DE number 992670
Cites work
- -calculus in (Co)inductive-type theory
- A calculus for cryptographic protocols: The spi calculus
- A calculus of mobile processes. I
- Automated Deduction – CADE-20
- Automated verification of selected equivalences for security protocols
- Certifying model checkers
- Deciding framed bisimilarity
- Formalising the π-Calculus Using Nominal Logic
- From secrecy to authenticity in security protocols
- scientific article; zbMATH DE number 1251177 (Why is no real title available?)
- Nominal logic, a first order theory of names and binding
- On bisimulations for the spi calculus
- Proof techniques for cryptographic processes
- Symbolic bisimulation in the spi calculus
- The AVISPA tool for the automated validation of internet security protocols and applications
Cited in
(8)- Unique solutions of contractions, CCS, and their HOL formalisation
- Formalising Observer Theory for Environment-Sensitive Bisimulation
- Unique solutions of contractions, CCS, and their HOL formalisation
- Formalising the pi-calculus using nominal logic
- scientific article; zbMATH DE number 748447 (Why is no real title available?)
- On bisimulations for the spi calculus
- Formalising the π-Calculus Using Nominal Logic
- Psi-calculi in Isabelle
This page was built for publication: Implementing Spi Calculus Using Nominal Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507444)