CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMATH Open1134.94368OpenAlexW1737342522MaRDI QIDQ5897485FDOQ5897485

Authors: Tomasz Truderung 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Recommendations

• Deciding Combinations of Theories
• A note on theories with selectors
• Sufficiency conditions for theories with recursive models
• scientific article; zbMATH DE number 3875113
• Publication:4942633
• scientific article; zbMATH DE number 1222556
• An Algorithmic Theory of the Choice of Techniques
• scientific article; zbMATH DE number 1492864
• scientific article; zbMATH DE number 3857082
• A formal model of theory choice in science

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (8)

• Maximizing theory accuracy through selective reinterpretation
• Deciding security for protocols with recursive tests
• Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later
• Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol
• Transducer-based analysis of cryptographic protocols
• Tree automata with equality constraints modulo equational theories
• Proving Group Protocols Secure Against Eavesdroppers
• STACS 2004

This page was built for publication: CONCUR 2005 – Concurrency Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897485)