Corpus ID: 126119259

Bounded model checking and induction: From refutation to verification

  title={Bounded model checking and induction: From refutation to verification},
  author={Leonardo Mendonça de Moura and Harald Ruess and Maria Sorea},
  journal={Lecture Notes in Computer Science},
We explore the combination of bounded model checking and induction for proving safety properties of infinite-state systems. In particular, we define a general k-induction scheme and prove completeness thereof. A main characteristic of our methodology is that strengthened invariants are generated from failed k-induction proofs. This strengthening step requires quantifier-elimination, and we propose a lazy quantifier-elimination procedure, which delays expensive computations of disjunctive normal… Expand
Proving More Properties with Bounded Model Checking
This paper proposes a termination criterion for all of LTL, based on converting the LTL formula to a Buchi automaton so as to reduce model checking to the verification of a fairness constraint. Expand
Proving ∀ μ-Calculus Properties with SAT-Based Model Checking
In this paper, we present a complete bounded model checking algorithm for the universal fragment of μ-calculus. The new algorithm checks the completeness of bounded proof of each property on the flyExpand
SAT-Based Model Checking without Unrolling
Experimental studies show that induction is a powerful tool for generalizing the unreachability of given error states: it can refine away many states at once, and it is effective at focusing the proof search on aspects of the transition system relevant to the property. Expand
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like timed automata orExpand
Strengthened State Transitions for Invariant Verification in Practical Depth-Induction ∗
Bounded Model Checking (BMC) is often able to handle thousands of system variables by encoding the system and its properties via symbolic formulas and using satisfiability (SAT) solvers forExpand
Checking Safety by Inductive Generalization of Counterexamples to Induction
  • A. Bradley, Z. Manna
  • Computer Science
  • Formal Methods in Computer Aided Design (FMCAD'07)
  • 2007
A safety analysis of finite-state systems is described that generalizes from counterexamples to the inductiveness of the safety specification to inductive invariants and abstracts the system's state space relative to the asserted property. Expand
Three-valued logic in bounded model checking
  • T. Schüle, K. Schneider
  • Computer Science
  • Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05.
  • 2005
This paper presents a new approach to BMC based on three-valued logic that allows for in many cases to falsify liveness properties and to verify safety properties and both global and local model checking. Expand
Optimizing Bounded Model Checking for Linear Hybrid Systems
Improvements are tailored to lazy satisfiability solving and follow two complementary directions: first, the formula representation of the finite unfoldings of the transition relations of linear hybrid systems are optimized, and second, the Satisfiability checks are accelerated by accumulating and generalizing data that is generated during earlier satisfiability checks. Expand
Bounded Model Checking of Concurrent Systems with Unbounded Integer Variables
This paper focuses on the verification of concurrent systems with unbounded integer variables and shows how the new encoding for concurrent systems from the standard one helps improve the performance of model checking. Expand
Incremental and Complete Bounded Model Checking for Full PLTL
This work presents an incremental and complete bounded model checking method for the full linear temporal logic with past (PLTL), which both improves and extends current results in many ways. Expand