Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract)

Partial-order verification methods exploit “independency” between transitions of a concurrent program to avoid parts of the state space explosion due to the modeling of concurrency by interleaving. In this paper, we study the influence of refining dependencies between transitions of the program on the effectiveness of these methods. We show that carefully tracking dependencies can yield substantial improvements for their performances. For instance, we were able to decrease the memory requirements needed for the verification of a real-size protocol with such a method from a factor of 5 to a factor of 25 by only refining dependencies.

[1]  Doron A. Peled,et al.  Defining Conditional Independence Using Collapses , 1992, Theor. Comput. Sci..

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

[3]  Edward Ochmanski,et al.  Semi-Commutation and Deterministic Petri Nets , 1990, MFCS.

[4]  Gerard J. Holzmann,et al.  Coverage Preserving Reduction Strategies for Reachability Analysis , 1992, PSTV.

[5]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[6]  Patrice Godefroid.  Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

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

[8]  Gerard J. Holzmann,et al.  An improved protocol reachability analysis technique , 1988, Softw. Pract. Exp..

[9]  Hon Fung Li,et al.  Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems , 1990, CAV.

[10]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[11]  Stephen D. Crocker,et al.  Verification of Concurrent Systems: Function and Timing , 1982, PSTV.

[12]  Gerard J. Holzmann,et al.  State-space caching revisited , 1992, Formal Methods Syst. Des..

[13]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

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

[15]  Antoni W. Mazurkiewicz,et al.  Trace Theory , 1986, Advances in Petri Nets.

[16]  Thierry Jéron,et al.  On-Line Model Checking for Finite Linear Temporal Logic Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[17]  Pierre Wolper,et al.  A Partial Approach to Model Checking , 1994, Inf. Comput..