Symbolic Model Checking with Rich ssertional Languages

The paper shows that, by an appropriate choice of a rich assertional language, it is possible to extend the utility of symbolic model checking beyond the realm of BDD-represented finite-state systems into the domain of infinite-state systems, leading to a powerful technique for uniform verification of unbounded (parameterized) process networks.

[1]  David A. Basin,et al.  Hardware Verification using Monadic Second-Order Logic , 1995, CAV.

[2]  Orna Grumberg,et al.  Network Grammars, Communication Behaviors and Automatic Verification , 1989, Automatic Verification Methods for Finite State Systems.

[3]  Kedar S. Namjoshi,et al.  Reasoning about rings , 1995, POPL '95.

[4]  Somesh Jha,et al.  Verification of the Futurebus+ cache coherence protocol , 1993, Formal Methods Syst. Des..

[5]  Edmund M. Clarke,et al.  Reasoning about networks with many identical finite-state processes , 1986, PODC '86.

[6]  Orna Grumberg,et al.  Branching Time Temporal Logic and Amorphous Tree Automata , 1993, CONCUR.

[7]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[8]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[9]  Edward Y. Chang,et al.  STeP: The Stanford Temporal Prover , 1995, TAPSOFT.

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

[11]  Somesh Jha,et al.  Veryfying Parameterized Networks using Abstraction and Regular Languages , 1995, CONCUR.

[12]  Nils Klarlund,et al.  Mona: Monadic Second-Order Logic in Practice , 1995, TACAS.

[13]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[14]  Amir Pnueli,et al.  A Platform for Combining Deductive with Algorithmic Verification , 1996, CAV.

[15]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[16]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[17]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[18]  Edmund M. Clarke,et al.  Automatic Verification of Sequential Circuits Using Temporal Logic , 1986, IEEE Transactions on Computers.

[19]  Zohar Manna,et al.  Automatic Generation of Invariants and Intermediate Assertions , 1997, Theor. Comput. Sci..

[20]  Pierre Wolper,et al.  Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.

[21]  David L. Dill,et al.  Verifying Systems with Replicated Components in Murphi , 1996, CAV.

[22]  Orna Grumberg,et al.  Branching-Time Temporal Logic and Tree Automata , 1996, Inf. Comput..

[23]  Kedar S. Namjoshi,et al.  Automatic Verification of Parameterized Synchronous Systems (Extended Abstract) , 1996, CAV.

[24]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[25]  Nicolas Halbwachs,et al.  Automatic verification of parameterized linear networks of processes , 1997, POPL '97.

[26]  Hassen Saïdi,et al.  Powerful Techniques for the Automatic Generation of Invariants , 1996, CAV.

[27]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[28]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

[29]  Friedrich Otto,et al.  String-Rewriting Systems , 1993, Text and Monographs in Computer Science.