Behavioral consistency of C and Verilog programs using bounded model checking

Clarke, E.; Kroening, Daniel; Yorav, K.

doi:10.1109/dac.2003.1219026

Cited by 38 publications

(41 citation statements)

References 8 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SAT-based model-checking platforms [11,28] have been widely popular thanks to significant progress in SAT solvers. The most famous BMC tools are CBMC [13,15] and F-Soft [28]. They have been designed to handle reachability properties.…”

Section: Model Checkingmentioning

confidence: 99%

See 1 more Smart Citation

CPBPV: a constraint-programming framework for bounded program verification

2010

View full text Add to dashboard Cite

International audienceThis paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification (CPBPV). The CPBPV framework uses constraint stores to represent both the specification and the program and explores execution paths of bounded length nondeterministically. The CPBPV framework detects nonconformities and provides counter examples when a path of bounded length that refutes some properties exists. The input program is partially correct under the boundness restrictions, if each constraint store so produced implies the postcondition. CPBPV does not explore spurious execution paths, as it incrementally prunes execution paths early by detecting that the constraint store is not consistent. CPBPV uses the rich language of constraint programming to express the constraint store. Finally, CPBPV is parameterized with a list of solvers which are tried in sequence, starting with the least expensive and less general. Experimental results often produce orders of magnitude improvements over earlier approaches, running times being often independent of the size of the variable domains.Moreover, CPBPV was able to detect subtle errors in some programs for which other frameworks based on bounded model checking have failed

show abstract

Section: Model Checkingmentioning

confidence: 99%

“…There are also many research avenues opened by this research, three of which are reviewed now. 15 SMT-based bounded model checking is based on the idea of representing and checking quantifierfree formulas in a more general decidable theory (e.g. [22,25,31]).…”

Section: Perspectives and Future Workmentioning

confidence: 99%

CPBPV: a constraint-programming framework for bounded program verification

2010

View full text Add to dashboard Cite

show abstract

“…Given the formula C corresponding to the program (for a given k) and a formula P in the language of C representing the property to verify, the formula C ∧ ¬P is 1. First converted into a propositional one by representing each variable as a bitvector of fixed size and the operations as bit-vector operations (see [8] for details), And then into Conjunctive Normal Form (CNF) using well known conversion methods (see, e.g., [26]). …”

Section: Bounded Model Checking For Software Verificationmentioning

confidence: 99%

Using Bounded Model Checking for Coverage Analysis of Safety-Critical Software in an Industrial Setting

et al. 2010

View full text Add to dashboard Cite

Testing and Bounded Model Checking (BMC) are two techniques used in Software Verification for bug-hunting. They are expression of two different philosophies: testing is used on the compiled code and it is more suited to find errors in common behaviors, while BMC is used on the source code to find errors in uncommon behaviors of the system. Nowadays, testing is by far the most used technique for software verification in industry: it is easy to use and even when no error is found, it can release a set of tests certifying the (partial) correctness of the compiled system. In the case of safety critical software, in order to increase the confidence of the correctness of the compiled system, it is often required that the provided set of tests covers 100% of the code. This requirement, however, substantially increases the costs associated to the testing phase, since it often involves the manual generation of tests. In this paper we show how BMC can be productively applied to the Software Verification process in industry. In particular, we show how to productively use a Bounded Model Checker for C programs (CBMC) as an automatic test generator for the Coverage Analysis of Safety Critical Software.

show abstract

“…CBMC reduces the model checking problem to determining the validity of a bit-vector equation; full details are presented elsewhere [11]. In a process analogous to that used for Bounded Model Checking of Kripke structures, the transition system is unwound by duplicating the loop bodies in the case of for and while loops, duplicating code in the case of loops build by means of backward goto statements, and function inlining in the case of recursive functions.…”

Section: Bounded Model Checking For C Programsmentioning

confidence: 99%

Making the Most of BMC Counterexamples

Groce

Kroening

2005

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

The value of model checking counterexamples for debugging programs (and specifications) is widely recognized. Unfortunately, bounded model checkers often produce counterexamples that are difficult to understand due to the values chosen by a SAT solver. This paper presents two approaches to making better use of BMC counterexamples. The first contribution is a new notion of counterexample minimization that minimizes values with respect to the type system of the language being model checked, rather than at the level of SAT variables. Greedy and optimal approaches to the minimization problem are presented and compared. The second contribution extends a BMC-based error explanation approach to automatically hypothesize causes for the error in a counterexample. These hypotheses (in terms of relationships between variables) can be automatically checked to determine if a causal dependence exists. Experimental results show that causes can be automatically determined for errors in interesting ANSI C programs.

show abstract

Behavioral consistency of C and Verilog programs using bounded model checking

Cited by 38 publications

References 8 publications

CPBPV: a constraint-programming framework for bounded program verification

CPBPV: a constraint-programming framework for bounded program verification

Using Bounded Model Checking for Coverage Analysis of Safety-Critical Software in an Industrial Setting

Making the Most of BMC Counterexamples

Contact Info

Product

Resources

About