Cited in
(33)- A reduced semantics for deciding trace equivalence
- On Communication Models When Verifying Equivalence Properties
- Deciding equivalence-based properties using constraint solving
- Formal analysis and offline monitoring of electronic exams
- Automated verification of equivalence properties of cryptographic protocols
- SPEC: an equivalence checker for security protocols
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
- YAPA
- AVISPA
- FAST
- ProVerif
- OFMC
- scyther
- LALBLC
- Anima
- Maude-NPA
- ConfiChair
- RiTHM
- Stateful applied pi calculus: observational equivalence and labelled bisimilarity
- Apte
- SPEC
- TAMARIN
- margrave
- ACUOS2
- CPSA
- Analysing privacy-type properties in cryptographic protocols (invited talk)
- Helios
- A procedure for deciding symbolic equivalence between sets of constraint systems
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- A decidable class of security protocols for both reachability and equivalence properties
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Computing knowledge in equational extensions of subterm convergent theories
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
This page was built for software: Akiss
