Typing Correspondence Assertions for Communication Protocols
From MaRDI portal
Publication:4917053
DOI10.1016/S1571-0661(04)80959-9zbMath1260.94063MaRDI QIDQ4917053
Alan Jeffrey, Andrew D. Gordon
Publication date: 26 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Authentication, digital signatures and secret sharing (94A62)
Related Items (2)
Typing Correspondence Assertions for Communication Protocols ⋮ Manipulating Trees with Hidden Labels
Uses Software
Cites Work
- Region-based memory management
- The chemical abstract machine
- A calculus for cryptographic protocols: The spi calculus
- Typing Correspondence Assertions for Communication Protocols
- A generic type system for the Pi-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Typing Correspondence Assertions for Communication Protocols