Using partial orders for the efficient verification of deadlock freedom and safety properties

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

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

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

[4]  Patrice Godefroid,et al.  An Efficient Reactive Planner for Synthesizing Reactive Plans , 1991, AAAI.

[5]  Thierry Jéron,et al.  Bounded-memory Algorithms for Verification On-the-fly , 1991, CAV.

[6]  Laurent Mounier,et al.  "On the Fly" Verification of Behavioural Equivalences and Preorders , 1991, CAV.

[7]  Joseph Sifakis,et al.  Safety for Branching Time Semantics , 1991, ICALP.

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

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

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

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

[12]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[13]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

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

[15]  Nicolas Halbwachs,et al.  Specifying, Programming and Verifying Real-Time Systems Using a Synchronous Declarative Language , 1989, Automatic Verification Methods for Finite State Systems.

[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]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[18]  Haim Gaifman,et al.  Modeling concurrency by partial orders and nonlinear transition systems , 1988, REX Workshop.

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

[20]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

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

[22]  A. P. Sistla,et al.  Automatic verification of finite-state concurrent systems using temporal logic specifications , 1986, TOPL.

[23]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[24]  Wolfgang Reisig.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

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

[26]  Zohar Manna,et al.  Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs , 1984, Sci. Comput. Program..

[27]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[28]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[29]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[30]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .