A BSP Algorithm for On-the-Fly Checking CTL* Formulas on Security Protocols

This paper presents a distributed algorithm to compute on-the-fly whether a structured model of a security protocol satisfies or not a CTL* formula. The design of this simple and still efficient algorithm is possible by using the structured nature of security protocols. A prototype implementation has been developed, allowing to run benchmarks.

[1]  Véronique Cortier,et al.  How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones , 2011, STACS.

[2]  Sebastian Mödersheim,et al.  The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications , 2005, CAV.

[3]  Muhammad Torabi Dashti,et al.  Distributed Partial Order Reduction for Security Protocols , 2008, PDMC@CAV.

[4]  Jean Fortin,et al.  BSP-WHY: an intermediate language for deductive verification of BSP programs , 2010, HLPP '10.

[5]  Ami Marowka,et al.  Parallel Scientific Computation: A Structured Approach using BSP and MPI , 2006, Scalable Comput. Pract. Exp..

[6]  Konrad Hinsen,et al.  Parallel Scripting with Python , 2007, Computing in Science & Engineering.

[7]  Devesh C. Jinwala,et al.  A Comparative Analysis of Tools for Verification of Security Protocols , 2010, Int. J. Commun. Netw. Syst. Sci..

[8]  Howard Barringer,et al.  CTL* model checking on a shared-memory architecture , 2006, Formal Methods Syst. Des..

[9]  Gil Utard,et al.  Evaluating a peer-to-peer storage system in presence of malicious peers , 2011, 2011 International Conference on High Performance Computing & Simulation.

[10]  Lubos Brim,et al.  DiVinE: Parallel Distributed Model Checker , 2010, 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology.

[11]  Luboš Brim,et al.  Property Driven Distribution of Nested DFS , 2002 .

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

[13]  Jiří Barnat,et al.  Distributed Memory Ltl Model Checking , 2004 .

[14]  Michaël Guedj,et al.  BSP Algorithms for LTL & CTL* Model Checking of Security Protocols. (Algorithmes BSP pour la vérification de modèles LTL et CTL* pour les protocoles de sécurité) , 2012 .

[15]  Frédéric Gava,et al.  A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols , 2012, ISPDC.

[16]  Franck Pommereau,et al.  Optimising the compilation of Petri net models , 2011 .

[17]  Javier Esparza,et al.  A Note on On-the-Fly Verification Algorithms , 2005, TACAS.

[18]  Flemming Nielson,et al.  Analysis of Security Protocols by Annotations , 2008 .

[19]  Girish Bhat,et al.  Efficient on-the-fly model checking for CTL , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[20]  Radu Mateescu,et al.  Parallel state space construction for model-checking , 2001, SPIN '01.

[21]  Paul Gastin,et al.  LTL with Past and Two-Way Very-Weak Alternating Automata , 2003, MFCS.

[22]  Jaco van de Pol,et al.  Distributed Algorithms for SCC Decomposition , 2011, J. Log. Comput..

[23]  Franck Pommereau,et al.  Algebras of Coloured/ Petri Nets , 2010 .

[24]  Lars Michael Kristensen,et al.  A Sweep-Line Method for State Space Exploration , 2001, TACAS.

[25]  Petr Ročkai,et al.  DiVinE: Parallel Distributed Model Checker (Tool paper) , 2010 .

[26]  Michaël Rusinowitch,et al.  Protocol insecurity with finite number of sessions is NP-complete , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[27]  Alessandro Armando,et al.  LTL Model Checking for Security Protocols , 2007, 20th IEEE Computer Security Foundations Symposium (CSF'07).

[28]  Cjf Cas Cremers.  Scyther : semantics and verification of security protocols , 2006 .

[29]  Dana Petcu,et al.  Parallel explicit state reachability analysis and state space construction , 2003, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings..

[30]  Ricardo Corin,et al.  Analysis Models for Security Protocols , 2006 .

[31]  Christophe Pajault,et al.  Model checking parallèle et réparti de réseaux de Petri colorés de haut-niveau : application à la vérification automatique de programmes Ada concurrents. (Parallel and distributed high-level colored Petri net model checking) , 2008 .

[32]  David L. Dill,et al.  Parallelizing the Murϕ Verifier , 2001, Formal Methods Syst. Des..

[33]  John H. Reif,et al.  Depth-First Search is Inherently Sequential , 1985, Inf. Process. Lett..

[34]  Franck Pommereau,et al.  Modelling, verification, and formal analysis of security properties in a P2P system , 2010, 2010 International Symposium on Collaborative Technologies and Systems.

[35]  Franck Pommereau,et al.  A BSP Algorithm for the State Space Construction of Security Protocols , 2010, 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology.

[36]  Franck Pommereau,et al.  Quickly prototyping petri nets tools with SNAKES , 2008, SimuTools.

[37]  Rob H. Bisseling,et al.  Parallel Scientific Computation , 2004 .