TAMARIN
From MaRDI portal
Software:35211
swMATH23438MaRDI QIDQ35211FDOQ35211
Author name not available (Why is that?)
Cited In (22)
- Symbolic computation in Maude: some tapas
- Relating Process Languages for Security and Communication Correctness (Extended Abstract)
- Built-in Variant Generation and Unification, and Their Applications in Maude 2.7
- Title not available (Why is that?)
- MoSS: modular security specifications framework
- On Communication Models When Verifying Equivalence Properties
- Terminating non-disjoint combined unification
- Alice and Bob Meet Equational Theories
- Protocol analysis with time and space
- A procedure for deciding symbolic equivalence between sets of constraint systems
- Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later
- Title not available (Why is that?)
- Programming and symbolic computation in Maude
- A decidable class of security protocols for both reachability and equivalence properties
- Designing reliable distributed systems. A formal methods approach based on executable modeling in Maude
- 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
- 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
