Deciding equivalence-based properties using constraint solving
From MaRDI portal
Recommendations
- A procedure for deciding symbolic equivalence between sets of constraint systems
- Automating security analysis: symbolic equivalence of constraint systems
- A reduced semantics for deciding trace equivalence
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- From security protocols to pushdown automata
Cites work
- scientific article; zbMATH DE number 1956510 (Why is no real title available?)
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 1927582 (Why is no real title available?)
- A calculus of communicating systems
- A complete symbolic bisimulation for full applied pi-calculus
- Automated verification of equivalence properties of cryptographic protocols
- Automated verification of selected equivalences for security protocols
- Communicating sequential processes
- Computer Aided Verification
- Decidability of equivalence of symbolic derivations
- Deciding knowledge in security protocols under equational theories
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Hierarchical combination of intruder theories
- Mobile values, new names, and secure communication
- On the symbolic reduction of processes with cryptographic functions.
- Private authentication
- Proof system for applied pi calculus
- Proof techniques for cryptographic processes
- Proving more observational equivalences with ProVerif
- Symbolic Bisimulation for the Applied Pi Calculus
- Testing equivalences for processes
Cited in
(20)- Trace equivalence and epistemic logic to express security properties
- Typing messages for free in security protocols: the case of equivalence properties
- From security protocols to pushdown automata
- From security protocols to pushdown automata
- Combining Decision Procedures by (Model-)Equality Propagation
- Proving more observational equivalences with ProVerif
- On Communication Models When Verifying Equivalence Properties
- Efficiently deciding equivalence for standard primitives and phases
- Safe equivalences for security properties
- A procedure for deciding symbolic equivalence between sets of constraint systems
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus
- A reduced semantics for deciding trace equivalence
- Automating security analysis: symbolic equivalence of constraint systems
- Checking trace equivalence: how to get rid of nonces?
- POR for security protocol equivalences. Beyond action-determinism
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity
- Deciding equivalence of separated non-nested attribute systems in polynomial time
- scientific article; zbMATH DE number 2102726 (Why is no real title available?)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- scientific article; zbMATH DE number 1948177 (Why is no real title available?)
This page was built for publication: Deciding equivalence-based properties using constraint solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391121)
