CBMC - C Bounded Model Checker - (Competition Contribution)
Lists
Only you see this
Abstract
CBMC implements bit-precise bounded model checking for C programs and has been developed and maintained for more than ten years. CBMC verifies the absence of violated assertions under a given loop unwinding bound. Other properties, such as SV-COMP’s ERROR labels or memory safety properties are reduced to assertions via automated instrumentation. Only recently support for efficiently checking concurrent programs, including support for weak memory models, has been added. Thus, CBMC is now capable of finding counterexamples in all of SV-COMP’s categories. As back end, the competition submission of CBMC uses MiniSat 2.2.0.
BibTeX
@inproceedings{kroening2014cbmc,
author = {Daniel Kroening and Michael Tautschnig},
title = {{CBMC - C Bounded Model Checker - (Competition Contribution)}},
booktitle = {TACAS},
year = {2014},
doi = {10.1007/978-3-642-54862-8\_26},
}Loading related content...