Tree automata with one memory set constraints and cryptographic protocols

DOI10.1016/j.tcs.2004.09.036zbMath1070.68066OpenAlexW1967744155MaRDI QIDQ1770429

Véronique Cortier, Hubert Comon

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.036

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25)

Related Items (14)

Automata-based verification of programs with tree updates ⋮ An undecidability result for AGh ⋮ Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ Tree Automata with Global Constraints ⋮ Challenges in the Automated Verification of Security Protocols ⋮ Bounding messages for free in security protocols -- extension to various security properties ⋮ TREE AUTOMATA WITH GLOBAL CONSTRAINTS ⋮ Rigid tree automata and applications ⋮ Tree automata with one memory set constraints and cryptographic protocols ⋮ Rigid Tree Automata ⋮ Bounding Messages for Free in Security Protocols ⋮ Nested Sibling Tree Automata ⋮ TAGED Approximations for Temporal Properties Model-Checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus for cryptographic protocols: The spi calculus
• Haskell overloading is DEXPTIME-complete
• Tree automata with one memory set constraints and cryptographic protocols
• Introduction to set constraint-based program analysis
• Set constraints with intersection
• On the security of ping-pong protocols

This page was built for publication: Tree automata with one memory set constraints and cryptographic protocols