SATMC: a SAT-based model checker for security protocols, business processes, and security APIs

We present SATMC (SAT-based Model Checker), an open and flexible platform for SAT-based bounded model checking [8] of security protocols. Under the standard assumptions of perfect cryptography and of strong typing, SATMC performs a bounded analysis of the problem by considering scenarios with a finite number of sessions whereby messages are exchanged on a channel controlled by the most general intruder based on the Dolev-Yao model [12].

[1]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[2]  Alessandro Armando,et al.  Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning , 2002, FORTE.

[3]  Gavin Lowe.  Casper: a compiler for the analysis of security protocols , 1998 .

[4]  Alessandro Armando,et al.  An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols , 2005, ARSPA@IJCAR.

[5]  Fausto Giunchiglia,et al.  NUSMV: A New Symbolic Model Verifier , 1999, CAV.

[6]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7]  Pierre Ganty,et al.  SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis , 2003, FME.

[8]  Vitaly Shmatikov,et al.  Constraint solving for bounded-process cryptographic protocol analysis , 2001, CCS '01.

[9]  Fabio Massacci,et al.  Verifying security protocols as planning in logic programming , 2001, ACM Trans. Comput. Log..

[10]  Dawn Xiaodong Song.  Athena: a new efficient automatic checker for security protocol analysis , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[11]  Sebastian Mödersheim,et al.  The AVISS Security Protocol Analysis Tool , 2002, CAV.

[12]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[13]  Stefania Gnesi,et al.  FME 2003: Formal Methods: International Symposium of Formal Methods Europe, Pisa, Italy, September 8-14, 2003. Proceedings , 2003, Lecture Notes in Computer Science.

[14]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[15]  Yuliya Lierler,et al.  Automatic Compilation of Protocol Insecurity Problems into Logic Programming , 2004, JELIA.

[16]  Alessandro Armando,et al.  Abstraction-Driven SAT-based Analysis of Security Protocols , 2003, SAT.