Type Inference for Correspondence Types

DOI10.1016/j.entcs.2009.07.079zbMath1294.68110OpenAlexW2160263906MaRDI QIDQ5170185

René Rydhof Hansen, Hans Hüttel, Andrew D. Gordon

Publication date: 22 July 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.079

zbMATH Keywords

\(\pi\)-calculustype inferencecorrespondence assertions

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Automated type-based analysis of injective agreement in the presence of compromised principals

Uses Software

• Succinct

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus for cryptographic protocols: The spi calculus
• Cryptographic Analysis in Cubic Time
• Polarized name passing
• Type-Based Verification of Correspondence Assertions for Communication Protocols
• Tools and Algorithms for the Construction and Analysis of Systems
• Programming Languages and Systems
• CONCUR 2005 – Concurrency Theory