A procedure for deciding symbolic equivalence between sets of constraint systems
DOI10.1016/J.IC.2017.05.004zbMATH Open1371.68189OpenAlexW2609153124MaRDI QIDQ2013557FDOQ2013557
Authors: Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune 
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
Recommendations
- Automating security analysis: symbolic equivalence of constraint systems
- Deciding equivalence-based properties using constraint solving
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- A reduced semantics for deciding trace equivalence
- Typing messages for free in security protocols: the case of equivalence properties
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)
Cites Work
- Computer Aided Verification
- Automated verification of equivalence properties of cryptographic protocols
- Mobile values, new names, and secure communication
- Title not available (Why is that?)
- Private authentication
- Automated verification of selected equivalences for security protocols
- Deciding equivalence-based properties using constraint solving
- Decidability of equivalence of symbolic derivations
- Proving more observational equivalences with ProVerif
- Automating security analysis: symbolic equivalence of constraint systems
- Equational problems and disunification
- Deciding security properties for cryptographic protocols. application to key cycles
- A survey of symbolic methods in computational analysis of cryptographic systems
- Term Rewriting and Applications
Cited In (12)
- Deciding equivalence-based properties using constraint solving
- Reduction of equational theories for verification of trace equivalence: re-encryption, associativity and commutativity
- Typing messages for free in security protocols: the case of equivalence properties
- 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
- A symbolic-interval inference approach for constraint satisfaction: implementation on kinematics applications
- Efficiently deciding equivalence for standard primitives and phases
- Automating security analysis: symbolic equivalence of constraint systems
- A reduced semantics for deciding trace equivalence
- Automated verification of equivalence properties of cryptographic protocols
- Rewriting Privacy
- A decision procedure for semantical equivalence of thin FM specifications
Uses Software
This page was built for publication: A procedure for deciding symbolic equivalence between sets of constraint systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013557)
