Finite Models in FOL-Based Crypto-Protocol Verification

DOI10.1007/978-3-642-03459-6_11zbMath1252.94078OpenAlexW1490967459MaRDI QIDQ3184717

Tjark Weber, Jan Jürjens

Publication date: 22 October 2009

Published in: Foundations and Applications of Security Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03459-6_11

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Model theory of finite structures (03C13) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

Proving semantic properties as first-order satisfiability ⋮ Finite reasons for safety

Uses Software

• TPTP

This page was built for publication: Finite Models in FOL-Based Crypto-Protocol Verification