Techniques for Memory-Efficient Model Checking of C and C++ Code

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00081181" target="_blank" >RIV/00216224:14330/15:00081181 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-22969-0_19" target="_blank" >http://dx.doi.org/10.1007/978-3-319-22969-0_19</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-22969-0_19" target="_blank" >10.1007/978-3-319-22969-0_19</a>

Result language
angličtina
Original language name
Techniques for Memory-Efficient Model Checking of C and C++ Code
Original language description
We present an overview of techniques that, in combination, lead to a memory-efficient implementation of a model checker for LLVM bitcode, suitable for verification of realistic C and C++ programs. As a central component, we present the design of a tree compression scheme and evaluate the implementation in context of explicit-state safety, LTL and untime-LTL (for timed automata) model checking. Our design is characterised by dynamic, multi-way adaptive partitioning of state vectors for efficient storagein a tree-compressed hash table, representing the closed set in the model checking algorithm. To complement the tree compression technique, we present a special-purpose memory allocation algorithm with very compact memory layout and negligible performance penalty.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA15-08772S" target="_blank" >GA15-08772S: Correctness Analysis of C and C++ Programs with Threads</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)