2-Valued and 3-Valued Abstraction-Refinement in Model Checking

ion-Refinement in Model

[1]  Rajeev Alur,et al.  Symbolic Compositional Verification by Learning Assumptions , 2005, CAV.

[2]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[3]  E BryantRandal,et al.  Formal verification by symbolic evaluation of partially-ordered trajectories , 1995 .

[4]  Orna Grumberg,et al.  Efficient Automatic STE Refinement Using Responsibility , 2008, TACAS.

[5]  Stephan Merz,et al.  Model Checking , 2000 .

[6]  Orna Grumberg,et al.  Monotonic Abstraction-Refinement for CTL , 2004, TACAS.

[7]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.

[8]  Daniel Kroening,et al.  Word level predicate abstraction and refinement for verifying RTL Verilog , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[9]  Helmut Veith,et al.  Tree-like counterexamples in model checking , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[10]  Orna Grumberg,et al.  Compositional verification and 3-valued abstractions join forces , 2010, Inf. Comput..

[11]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[12]  Howard Barringer,et al.  Proof Rules for Automated Compositional Verification through Learning , 2003 .

[13]  Radha Jagadeesan,et al.  Automatic Abstraction Using Generalized Model Checking , 2002, CAV.

[14]  Orna Grumberg,et al.  3-Valued Abstraction: More Precision at Less Cost , 2006, LICS.

[15]  Orna Grumberg,et al.  When not losing is better than winning: Abstraction and refinement for the full mu-calculus , 2007, Inf. Comput..

[16]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[17]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[18]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[19]  Orna Grumberg,et al.  Model checking and modular verification , 1994, TOPL.

[20]  Corina S. Pasareanu,et al.  Learning Assumptions for Compositional Verification , 2003, TACAS.

[21]  Radha Jagadeesan,et al.  Model checking partial state spaces with 3-valued temporal logics , 2001 .

[22]  Orna Grumberg,et al.  Automatic Refinement and Vacuity Detection for Symbolic Trajectory Evaluation , 2006, CAV.

[23]  Yih-Kuen Tsay,et al.  Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages , 2008, TACAS.

[24]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[25]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[26]  Marsha Chechik,et al.  Why Waste a Perfectly Good Abstraction? , 2006, TACAS.

[27]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[28]  Cliff B. Jones,et al.  Specification and Design of (Parallel) Programs , 1983, IFIP Congress.

[29]  Orna Grumberg,et al.  A game-based framework for CTL counterexamples and 3-valued abstraction-refinement , 2007, TOCL.

[30]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[31]  Orna Grumberg,et al.  Don't Know in the µ-Calculus , 2005, VMCAI.

[32]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[33]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[34]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[35]  Helmut Veith,et al.  Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis , 2002, FMCAD.

[36]  Orna Grumberg,et al.  Abstraction and Refinement in Model Checking , 2005, FMCO.

[37]  Randal E. Bryant,et al.  Formal verification by symbolic evaluation of partially-ordered trajectories , 1995, Formal Methods Syst. Des..

[38]  Ofer Strichman,et al.  SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques , 2002, CAV.

[39]  Sagar Chaki,et al.  Automated Assume-Guarantee Reasoning for Simulation Conformance , 2005, CAV.