Linear Completeness Thresholds for Bounded Model Checking.

Linear Completeness Thresholds for Bounded Model Checking.

Bounded model checking is a symbolic bug-finding method that examines paths of bounded length for violations of a given LTL formula. Its rapid adoption in industry owes much to advances in SAT technology over the past 10-15 years. More recently, there have been increasing efforts to apply SAT-based...

Descripció completa

Dades bibliogràfiques
Autors principals:	Kroening, D, Ouaknine, J, Strichman, O, Wahl, T, Worrell, J
Altres autors:	Gopalakrishnan, G
Format:	Journal article
Idioma:	English
Publicat:	Springer 2011

Ítems similars

Completeness and Complexity of Bounded Model Checking
per: Clarke, E, et al.
Publicat: (2004)

On the Magnitude of Completeness Thresholds in Bounded Model Checking
per: Bundala, D, et al.
Publicat: (2012)

Computational challenges in bounded model checking.
per: Clarke, E, et al.
Publicat: (2005)

Computational challenges in bounded model checking
per: Clarke, E, et al.
Publicat: (2005)

Computational Challenges in Bounded Model Checking
per: Clarke, E, et al.
Publicat: (2015)

Algebraic model checking for discrete linear dynamical systems
per: Luca, F, et al.
Publicat: (2022)

On LTL model-checking for low-dimensional discrete linear dynamical systems
per: Karimov, T, et al.
Publicat: (2020)

A Complete Bounded Model Checking Algorithm for Pushdown Systems
per: Basler, G, et al.
Publicat: (2007)

Computing Over−Approximations with Bounded Model Checking
per: Kroening, D
Publicat: (2006)

Computing over-approximations with bounded model checking
per: Kroening, D
Publicat: (2006)

Abstraction−based Satisfiability Solving of Presburger Arithmetic
per: Kroening, D, et al.
Publicat: (2004)

Partial orders for efficient bounded model checking of concurrent software
per: Alglave, J, et al.
Publicat: (2013)

Model Checking Succinct and Parametric One-Counter Automata.
per: Göller, S, et al.
Publicat: (2010)

Model Checking Succinct and Parametric One−Counter Automata
per: Göller, S, et al.
Publicat: (2010)

Proving safety with trace automata and bounded model checking
per: Kroening, D, et al.
Publicat: (2015)

On expressiveness and complexity in real-time model checking
per: Bouyer, P, et al.
Publicat: (2008)

Property-Driven Fence Insertion using Reorder Bounded Model Checking
per: Joshi, S, et al.
Publicat: (2015)

Property-driven fence insertion using reorder bounded model checking
per: Joshi, S, et al.
Publicat: (2015)

Incremental bounded model checking for embedded software
per: Schrammel, P, et al.
Publicat: (2017)

Branching-time model checking of parametric one-counter automata
per: Göller, S, et al.
Publicat: (2012)

Branching−Time Model Checking of Parametric One−Counter Automata
per: Göller, S, et al.
Publicat: (2012)

Towards automated bounded model checking of API implementations
per: Neville, D, et al.
Publicat: (2016)

Towards a Theory of Time-Bounded Verification.
per: Ouaknine, J, et al.
Publicat: (2010)

Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking
per: Kroening, D, et al.
Publicat: (2003)

Linear Encodings of Bounded LTL Model Checking
per: Armin Biere, et al.
Publicat: (2006-11-01)

Time-Bounded Verification
per: Ouaknine, J, et al.
Publicat: (2009)

Bounding the escape time of a linear dynamical system over a compact semialgebraic set
per: D'Costa, J, et al.
Publicat: (2022)

Model checking flat freeze LTL on one-counter automata
per: Lechner, A, et al.
Publicat: (2016)

JBMC: a bounded model checking tool for verifying Java bytecode
per: Cordeiro, L, et al.
Publicat: (2018)

Deciding Bit−Vector Arithmetic with Abstraction
per: Bryant, R, et al.
Publicat: (2007)

Decision Problems for Linear Recurrence Sequences.
per: Ouaknine, J, et al.
Publicat: (2012)

Two Variable vs. Linear Temporal Logic in Model Checking and Games
per: Benedikt, M, et al.
Publicat: (2011)

TWO VARIABLE VS. LINEAR TEMPORAL LOGIC IN MODEL CHECKING AND GAMES
per: Benedikt, M, et al.
Publicat: (2013)

Parallel assignments in software model checking
per: Ouaknine, J
Publicat: (2006)

Model Checking Flat Freeze LTL on One-Counter Automata
per: Antonia Lechner, et al.
Publicat: (2018-12-01)

Alternating Timed Automata over Bounded Time
per: Jenkins, M, et al.
Publicat: (2010)

A framework for Satisfiability Modulo Theories.
per: Kroening, D, et al.
Publicat: (2009)

Efficient Computation of Recurrence Diameters
per: Kroening, D, et al.
Publicat: (2003)

Decision Procedures – an Algorithmic Point of View
per: Kroening, D, et al.
Publicat: (2008)

Two Variable vs. Linear Temporal Logic in Model Checking and Games
per: Michael Benedikt, et al.
Publicat: (2013-05-01)