This paper presents a model checking tool, SATABS, that implements a predicate abstraction refinement loop. Existing software verification tools such as SLAM, BLAST, or MAGIC use decision procedures for abstraction and simulation that are limited to integers. SATABS overcomes these limitations by using a SAT-solver. This allows the model checker to handle the semantics of the ANSI-C standard accurately. This includes a sound treatment of bit-vector overflow, and of the ANSI-C pointer arithmetic constructs. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Clarke, E., Kroening, D., Sharygina, N., & Yorav, K. (2005). SATABS: SAT-based predicate abstraction for ANSI-C. In Lecture Notes in Computer Science (Vol. 3440, pp. 570–574). Springer Verlag. https://doi.org/10.1007/978-3-540-31980-1_40
Mendeley helps you to discover research relevant for your work.