LLBMC: a bounded model checker for LLVM's intermediate representation

Authors:
Carsten Sinz;Florian Merz;Stephan Falke
Affiliations:
Institute for Theoretical Computer Science, Karlsruhe Institute of Technology (KIT), Germany;Institute for Theoretical Computer Science, Karlsruhe Institute of Technology (KIT), Germany;Institute for Theoretical Computer Science, Karlsruhe Institute of Technology (KIT), Germany
Venue:
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2012

Citing 5
Cited 3

LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Efficient SAT-based bounded model checking for software verification

Theoretical Computer Science
A decision procedure for bit-vectors and arrays

CAV'07 Proceedings of the 19th international conference on Computer aided verification
A precise memory model for low-level bounded model checking

SSV'10 Proceedings of the 5th international conference on Systems software verification
LLBMC: bounded model checking of C and C++ programs using a compiler IR

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments

Competition on software verification

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Linux driver verification

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Combined WCET analysis of bitcode and machine code using control-flow relation graphs

Proceedings of the 14th ACM SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present LLBMC, a bounded model checker for C programs. LLBMC uses the LLVM compiler framework in order to translate C programs into LLVM's intermediate representation (IR). The resulting code is then converted into a logical representation and simplified using rewrite rules. The simplified formula is finally passed to an SMT solver. In contrast to many other tools, LLBMC uses a flat, bit-precise memory model. It can thus precisely model, e.g., memory-based re-interpret casts.