Computer Aided Verification

ion I Making Predicate Abstraction Efficient: How to Eliminate Redundant Predicates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126 Edmund Clarke, Orna Grumberg, Muralidhar Talupur, Dong Wang A Symbolic Approach to Predicate Abstraction . . . . . . . . . . . . . . . . . . . . . . 141 Shuvendu K. Lahiri, Randal E. Bryant, Byron Cook Unbounded, Fully Symbolic Model Checking of Timed Automata Using Boolean Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154 Sanjit A. Seshia, Randal E. Bryant

[1]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[2]  L. D. Moura.  Lemmas on Demand for Satisfiability Solvers , 2002 .

[3]  Natarajan Shankar,et al.  Abstract and Model Check While You Prove , 1999, CAV.

[4]  Abelardo Pardo,et al.  Incremental CTL model checking using BDD subsetting , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[5]  Yassine Lakhnech,et al.  Automatic Generation of Invariants , 1999, Formal Methods Syst. Des..

[6]  Ofer Strichman.  On Solving Presburger and Linear Arithmetic with SAT , 2002, FMCAD.

[7]  Shuvendu K. Lahiri,et al.  Experience with term level modeling and verification of the M*CORE/sup TM/ microprocessor core , 2001, Sixth IEEE International High-Level Design Validation and Test Workshop.

[8]  Giorgio Delzanno.  Automatic Verification of Parameterized Cache Coherence Protocols , 2000, CAV.

[9]  Maria Sorea.  Bounded Model Checking for Timed Automata , 2002, Electron. Notes Theor. Comput. Sci..

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

[11]  David L. Dill,et al.  Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT , 2002, CAV.

[12]  Kedar S. Namjoshi,et al.  Syntactic Program Transformations for Automatic Abstraction , 2000, CAV.

[13]  John Rushby.  Model Checking Simpson's Four-Slot Fully Asynchronous Communication Mechanism , 2002 .

[14]  Sanjit A. Seshia,et al.  Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions , 2002, CAV.

[15]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[16]  David L. Dill,et al.  Successive approximation of abstract transition relations , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[17]  Zohar Manna,et al.  A Heuristic Approach to Program Verification , 1973, IJCAI.

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

[19]  Cormac Flanagan,et al.  Predicate abstraction for software verification , 2002, POPL '02.

[20]  Ofer Strichman,et al.  Deciding Separation Formulas with SAT , 2002, CAV.

[21]  Ilan Beer,et al.  Efficient Model Checking by Automated Ordering of Transition Relation Partitions , 1994, CAV.

[22]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[23]  David L. Dill,et al.  Automatic verification of Pipelined Microprocessor Control , 1994, CAV.

[24]  H. R. Simpson.  Four-slot fully asynchronous communication mechanism , 1990 .

[25]  Abelardo Pardo,et al.  Automatic Abstraction Techniques for Propositional µ-calculus Model Checking , 1997, CAV.

[26]  David L. Dill,et al.  Experience with Predicate Abstraction , 1999, CAV.

[27]  Fausto Giunchiglia,et al.  NUSMV: A New Symbolic Model Verifier , 1999, CAV.

[28]  Amir Pnueli,et al.  Automatic Deductive Verification with Invisible Invariants , 2001, TACAS.

[29]  Steven M. German,et al.  A synthesizer of inductive assertions , 1975, IEEE Transactions on Software Engineering.

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

[31]  Sanjit A. Seshia,et al.  Modeling and Verification of Out-of-Order Microprocessors in UCLID , 2002, FMCAD.

[32]  David L. Dill,et al.  Validity Checking for Combinations of Theories with Equality , 1996, FMCAD.

[33]  Doron A. Peled,et al.  From model checking to a temporal proof , 2001, SPIN '01.

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

[35]  Randal E. Bryant,et al.  Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions , 1999, CAV.

[36]  Colin Stirling,et al.  Modal and Temporal Properties of Processes , 2001, Texts in Computer Science.

[37]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

[38]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[39]  Daniel Kroening,et al.  Efficient Computation of Recurrence Diameters , 2003, VMCAI.