scientific article; zbMATH DE number 5051652

MaRDI QIDQ5486061zbMATH OpenFDO

Authors M. Kacprzak, Alessio Lomuscio, Artur Niewiadomski, Wojciech Penczek, Franco Raimondi, MacIej Szreter

Publication date 6 September 2006

zbMATH Keywords

binary decision diagramsbounded model checkingdining cryptographers protocolSAT-solververification

Mathematics Subject Classification ID

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

Recommendations

• An optimized intruder model for SAT-based model-checking of security protocols
• Comparative analysis of formal model checking tools for security protocol verification
• Finite Models in FOL-Based Crypto-Protocol Verification
• scientific article; zbMATH DE number 2084774
• Efficient SAT-based bounded model checking for software verification

Cited in

(8)

• Security invariants in discrete transition systems
• Algorithmic probabilistic game semantics. Playing games with automata
• Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic
• Symbolic model checking the knowledge in Herbivore protocol
• Specification and Verification of Multi-Agent Systems
• Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
• Program semantics and verification technique for AI-centred programs
• An SMT-based approach to the verification of knowledge-based programs

Describes a project that uses

Uses Software

• VerICS

This page was built for publication:

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