From Security Protocols to Pushdown Automata
From MaRDI portal
Publication:5277904
DOI10.1145/2811262zbMath1367.68186OpenAlexW2102565724MaRDI QIDQ5277904
Stéphanie Delaune, Véronique Cortier, Rémy Chrétien
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2811262
Formal languages and automata (68Q45) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Unnamed Item ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Decidability of equivalence of symbolic derivations
- The inclusion problem for simple languages
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Automated verification of selected equivalences for security protocols
- The equivalence problem for deterministic pushdown automata is decidable
- Proving More Observational Equivalences with ProVerif
- LALBLC A Program Testing the Equivalence of dpda’s