swMATH23438MaRDI QIDQ35211FDOQ35211
Author name not available (Why is that?)
Official website: https://dl.acm.org/citation.cfm?id=2526920
Cited In (52)
- Symbolic computation in Maude: some tapas
- Relating Process Languages for Security and Communication Correctness (Extended Abstract)
- Alice and Bob meet equational theories
- Belenios
- Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
- MoSS: modular security specifications framework
- On Communication Models When Verifying Equivalence Properties
- Terminating non-disjoint combined unification
- Protocol analysis with time and space
- A procedure for deciding symbolic equivalence between sets of constraint systems
- Title not available (Why is that?)
- KEM-DEM
- FAST
- ProVerif
- OFMC
- scyther
- ASPIER
- MFE
- ITP
- MTT
- LALBLC
- Anima
- Maude-NPA
- NRL
- GNUC
- Cryptyc
- RiTHM
- A reduced semantics for deciding trace equivalence
- Akiss
- Apte
- Programming and symbolic computation in Maude
- SPEC
- scyther-proof
- CoSP
- margrave
- Z3str2
- ABETS
- ACUOS2
- CPSA
- Helios
- A decidable class of security protocols for both reachability and equivalence properties
- GLINTS
- Automated type-based analysis of injective agreement in the presence of compromised principals
- Formal analysis and offline monitoring of electronic exams
- Combining proverif and automated theorem provers for security protocol verification
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- MoSS
- Designing reliable distributed systems. A formal methods approach based on executable modeling in Maude
- Built-in variant generation and unification, and their applications in Maude 2.7
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description)
- Gaining trust by tracing security protocols
This page was built for software: TAMARIN
