A precise memory model for low-level bounded model checking

Authors:
Carsten Sinz;Stephan Falke;Florian Merz
Affiliations:
Institute for Theoretical Computer Science, Karlsruhe Institute of Technology, Germany;Institute for Theoretical Computer Science, Karlsruhe Institute of Technology, Germany;Institute for Theoretical Computer Science, Karlsruhe Institute of Technology, Germany
Venue:
SSV'10 Proceedings of the 5th international conference on Systems software verification
Year:
2010

Citing 18
Cited 6

Benefits of Bounded Model Checking at an Industrial Setting

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model Checking Programs

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Types, bytes, and separation logic

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Accelerating high-level bounded model checking

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations

Journal of Automated Reasoning
Efficient SAT-based bounded model checking for software verification

Theoretical Computer Science
Unifying type checking and property checking for low-level code

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bounded model checking of software using SMT solvers instead of SAT solvers

International Journal on Software Tools for Technology Transfer (STTT)
A low-level memory model and an accompanying reachability predicate

International Journal on Software Tools for Technology Transfer (STTT)
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Formal Verification of C Systems Code

Journal of Automated Reasoning
A Precise Yet Efficient Memory Model For C

Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about Memory Layouts

FM '09 Proceedings of the 2nd World Congress on Formal Methods
SMT-Based Bounded Model Checking for Embedded ANSI-C Software

ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
Structural abstraction of software verification conditions

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Improved usability and performance of SMT solvers for debugging specifications

International Journal on Software Tools for Technology Transfer (STTT) - Special Section on VSTTE 2008
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects

A dynamic logic for unstructured programs with embedded assertions

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
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
Termination analysis of imperative programs using bitvector arithmetic

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
LLBMC: a bounded model checker for LLVM's intermediate representation

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Integration of bounded model checking and deductive verification

FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
LLBMC: improved bounded model checking of c programs using LLVM

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Formalizing the semantics of programming languages like C or C++ for bounded model checking can be cumbersome if complete coverage of all language features is to be achieved. On the other hand, low-level languages that occur during translation (compilation) have a much simpler semantics since they are closer to the machine level. It thus makes sense to use these low-level languages for bounded model checking. In this paper we present a highly precise memory model suitable for bounded model checking of such low-level languages. Our method also takes memory protection (malloc/free) into account.