Implementing Spi Calculus Using Nominal Techniques
From MaRDI portal
Publication:3507444
DOI10.1007/978-3-540-69407-6_33zbMath1142.68445OpenAlexW1489787855MaRDI QIDQ3507444
Temesghen Kahsai, Marino Miculan
Publication date: 19 June 2008
Published in: Logic and Theory of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_33
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Formalising Observer Theory for Environment-Sensitive Bisimulation ⋮ Unnamed Item ⋮ Psi-calculi in Isabelle ⋮ Unique solutions of contractions, CCS, and their HOL formalisation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A calculus of mobile processes. I
- A calculus for cryptographic protocols: The spi calculus
- \(\pi\)-calculus in (Co)inductive-type theory
- Nominal logic, a first order theory of names and binding
- Automated verification of selected equivalences for security protocols
- Proof Techniques for Cryptographic Processes
- CONCUR 2004 - Concurrency Theory
- Automated Deduction – CADE-20
- On bisimulations for the spi calculus
- Computer Aided Verification
- Formalising the π-Calculus Using Nominal Logic
This page was built for publication: Implementing Spi Calculus Using Nominal Techniques
