Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
From MaRDI portal
Publication:2268100
DOI10.1016/J.TCS.2009.10.022zbMATH Open1187.68204OpenAlexW2086814760MaRDI QIDQ2268100FDOQ2268100
Authors: Yannick Chevalier, Michaël Rusinowitch
Publication date: 10 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.022
Recommendations
Cites Work
- Computer Aided Verification
- The NRL Protocol Analyzer: An Overview
- Mobile values, new names, and secure communication
- Unification in the union of disjoint equational theories: Combining decision procedures
- Title not available (Why is that?)
- Unification in a combination of arbitrary disjoint equational theories
- On the symbolic reduction of processes with cryptographic functions.
- On the security of public key protocols
- Easy intruder deductions
- Programming Languages and Systems
- Foundations of Software Science and Computation Structures
- Mathematical Foundations of Computer Science 2003
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming Languages and Systems
- Complexity of nilpotent unification and matching problems.
- Title not available (Why is that?)
- STACS 2004
- On the freedom of decryption
Cited In (5)
Uses Software
This page was built for publication: Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268100)