Simple Bounded LTL Model Checking

We present a new and very simple translation of the bounded model checking problem which is linear both in the size of the formula and the length of the bound. The resulting CNF-formula has a linear number of variables and clauses.

[1]  Harri Haanp,et al.  Sets In Abelian Groups With Distinct Sums Of Pairs , 2004 .

[2]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[3]  Marko Mäkelä,et al.  Efficient computer-aided verification of parallel and distributed software systems , 2003 .

[4]  Marco Pistore,et al.  Improving the Encoding of LTL Model Checking into SAT , 2002, VMCAI.

[5]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[6]  Chao Wang,et al.  Learning from BDDs in SAT-based bounded model checking , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[7]  Harri Haanpää,et al.  Constructing certain combinatorial structures by computational methods , 2004 .

[8]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[9]  Orna Kupferman,et al.  Model Checking of Safety Properties , 1999, CAV.

[10]  Andrei Voronkov,et al.  Automated Deduction—CADE-18 , 2002, Lecture Notes in Computer Science.

[11]  Tommi A. Junttila,et al.  On the symmetry reduction method for Petri nets and similar formalisms , 2003 .

[12]  Matti Järvisalo,et al.  PROOF COMPLEXITY OF CUT – BASED TABLEAUX FOR BOOLEAN CIRCUIT SATISFIABILITY CHECKING , 2004 .

[13]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .

[14]  Tomi Janhunen,et al.  A Counter-Based Approach to Translating Normal Logic Programs into Sets of Clauses , 2003, Answer Set Programming.

[15]  Joël Ouaknine,et al.  Completeness and Complexity of Bounded Model Checking , 2004, VMCAI.

[16]  Toby Walsh,et al.  A Fixpoint Based Encoding for Bounded Model Checking , 2002, FMCAD.

[17]  Ofer Strichman,et al.  Accelerating Bounded Model Checking of Safety Properties , 2004, Formal Methods Syst. Des..

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

[19]  Heikki Tauriainen,et al.  ON TRANSLATING LINEAR TEMPORAL LOGIC INTO ALTERNATING AND NONDETERMINISTIC AUTOMATA , 2003 .

[20]  Keijo Heljanko,et al.  Testing LTL formula translation into Büchi automata , 2002, International Journal on Software Tools for Technology Transfer.

[21]  J. Wallén.  ON THE DIFFERENTIAL AND LINEAR PROPERTIES OF ADDITION , 2003 .

[22]  Daniel Sheridan,et al.  The Optimality of a Fast CNF Conversion and its Use with SAT , 2004, SAT.

[23]  Ilkka Niemelä,et al.  Bounded LTL model checking with stable models , 2003, Theory Pract. Log. Program..

[24]  Harald Ruess,et al.  Lazy Theorem Proving for Bounded Model Checking over Infinite Domains , 2002, CADE.

[25]  Marco Benedetti,et al.  Bounded Model Checking for Past LTL , 2003, TACAS.

[26]  Viktor Schuppan,et al.  Efficient reduction of finite state model checking to reachability analysis , 2004, International Journal on Software Tools for Technology Transfer.

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

[28]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[29]  T. Janhunen.  TRANSLATABILITY AND INTRANSLATABILITY RESULTS FOR CERTAIN CLASSES OF LOGIC PROGRAMS , 2003 .

[30]  Emilia Oikarinen.  TESTING THE EQUIVALENCE OF DISJUNCTIVE LOGIC PROGRAMS , 2003 .

[31]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

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

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