Partial-order reduction based on probe sets

[1]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series) , 1992 .

[2]  Boleslaw K. Szymanski.  A simple solution to Lamport's concurrent programming problem with linear wait , 1988, ICS '88.

[3]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[4]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[6]  Jaco van de Pol,et al.  1 Motivation : A Modular , High-Performance Model Checker , 2010 .

[7]  Elwin Pater,et al.  Partial Order Reduction for PINS , 2011 .

[8]  Patrice Godefroid,et al.  Dynamic partial-order reduction for model checking software , 2005, POPL '05.

[9]  Arend Rensink,et al.  Dynamic Partial Order Reduction Using Probe Sets , 2008, CONCUR.

[10]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[11]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[12]  Chandramohan A. Thekkath,et al.  Frangipani: a scalable distributed file system , 1997, SOSP.

[13]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

[14]  Leslie Lamport,et al.  A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.

[15]  Christel Baier,et al.  Principles of model checking , 2008 .

[16]  Sami Evangelista,et al.  High Level Petri Nets Analysis with Helena , 2005, ICATPN.