Security protocols: from linear to classical logic by abstract interpretation

DOI10.1016/j.ipl.2005.05.011zbMath1185.68310OpenAlexW2006805613MaRDI QIDQ1041815

Bruno Blanchet

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.011

zbMATH Keywords

linear logicformal methodscryptographic protocolsclassical logicabstract interpretation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Grammars and rewriting systems (68Q42)

Related Items

Unnamed Item, Automated verification of selected equivalences for security protocols, On the relationships between models in protocol verification, Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif, Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus

Cites Work

• Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
• Unnamed Item
• Unnamed Item
• Unnamed Item