Typing Correspondence Assertions for Communication Protocols

DOI10.1016/S1571-0661(04)80959-9MaRDI QIDQ4917053zbMATH OpenFDO

Authors Andrew D. Gordon, Alan Jeffrey

Publication date 26 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80959-9

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Typing correspondence assertions for communication protocols
• Type-Based Verification of Correspondence Assertions for Communication Protocols
• Unmediated communication with partially verifiable types
• scientific article; zbMATH DE number 3878340
• MULTISTAGE COMMUNICATION WITH AND WITHOUT VERIFIABLE TYPES
• Communication equilibria with partially verifiable types
• Correspondence assertions for process synchronization in concurrent communications
• scientific article; zbMATH DE number 1962753
• Algebraic specification and verification of communication protocols

Cites work

• A calculus for cryptographic protocols: The spi calculus
• A generic type system for the -calculus
• scientific article; zbMATH DE number 954809 (Why is no real title available?)
• scientific article; zbMATH DE number 3695144 (Why is no real title available?)
• scientific article; zbMATH DE number 50149 (Why is no real title available?)
• scientific article; zbMATH DE number 1231693 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 1538026 (Why is no real title available?)
• scientific article; zbMATH DE number 1759392 (Why is no real title available?)
• Region-based memory management
• The chemical abstract machine
• Typing Correspondence Assertions for Communication Protocols

Cited in

(6)

• Typing correspondence assertions for communication protocols
• Manipulating trees with hidden labels
• Type-Based Verification of Correspondence Assertions for Communication Protocols
• scientific article; zbMATH DE number 1962753 (Why is no real title available?)
• Typing Correspondence Assertions for Communication Protocols
• Typing copyless message passing

Describes a project that uses

Uses Software

• Automath

This page was built for publication: Typing Correspondence Assertions for Communication Protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917053)