A procedure for deciding symbolic equivalence between sets of constraint systems
From MaRDI portal
Publication:2013557
DOI10.1016/j.ic.2017.05.004zbMath1371.68189OpenAlexW2609153124MaRDI QIDQ2013557
Stéphanie Delaune, Hubert Comon-Lundh, Vincent Cheval
Publication date: 8 August 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/46882/1/CDD-IC-submitted.pdf
Cryptography (94A60) 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 (2)
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
Uses Software
Cites Work
- Unnamed Item
- Deciding equivalence-based properties using constraint solving
- Decidability of equivalence of symbolic derivations
- A survey of symbolic methods in computational analysis of cryptographic systems
- Equational problems and disunification
- Private authentication
- Automated verification of selected equivalences for security protocols
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- Deciding security properties for cryptographic protocols. application to key cycles
- Mobile values, new names, and secure communication
- Proving More Observational Equivalences with ProVerif
- Term Rewriting and Applications
- Computer Aided Verification
- Automating Security Analysis: Symbolic Equivalence of Constraint Systems
This page was built for publication: A procedure for deciding symbolic equivalence between sets of constraint systems
