An improvement in partial-order model-checking with ample sets

In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL model-checking.

[1]  Hasan Ural,et al.  Protocol validation by simultaneous reachability analysis , 1997, Comput. Commun..

[2]  Masaki Itoh,et al.  Protocol Verification Algorithm Using Reduced Reachability Analysis , 1983 .

[3]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

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

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

[6]  Hasan Ural,et al.  Verifying the safety properties of concurrent systems via simultaneous reachability , 1995 .

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

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

[9]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

[10]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Hasan Ural,et al.  Deadlock Detection in CFSM Models via Simultaneously Executable Sets , 1994 .

[12]  Raymond E. Miller,et al.  Deadlock detection by fair reachability analysis: from cyclic to multi-cyclic protocols (and beyond?) , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[13]  A. V. der,et al.  On improving simultaneous reachability analysis for the efficient verification of deadlock-freedom , 1995 .

[14]  Colin H. West,et al.  An Improved Protocol Validation Technique , 1982, Comput. Networks.

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

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

[17]  Raymond E. Miller,et al.  Generalized fair reachability analysis for cyclic protocols , 1996, TNET.

[18]  Gerard J. Holzmann,et al.  An improvement in formal verification , 1994, FORTE.

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

[20]  Pierre Wolper,et al.  A partial approach to model checking , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[21]  Antti Valmari,et al.  On-the-Fly Verification with Stubborn Sets , 1993, CAV.

[22]  Doron A. Peled.  Combining Partial Order Reductions with On-the-fly Model-Checking , 1994, CAV.

[23]  Mohamed G. Gouda,et al.  Protocol Validation by Fair Progress State Exploration , 1985, Comput. Networks.

[24]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.