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 …

Satisfiability modulo theories (SMT) solvers are efficient tools to decide the satisfiability of
ground formulas, including a number of built-in theories such as congruence, linear …

Device drivers often keep data in multiple data structures simultaneously while embedding
list or tree related records into the records containing the actual data; this results in …

Reachability from a program variable v to a program variable w states that from v, it is
possible to follow a path of memory locations that leads to the object bound to w. We present …

Analyzing real-world software is challenging due to complexity of the software frameworks or
APIs they depend on. In this paper, we present a tool, PROMPT, that facilitates the analysis …

A variable v reaches a variable w if there is a path from the memory location bound to v to
the one bound to w. This information is important for improving the precision of other static …

This paper introduces the theory TH for reasoning about the correctness of memory access
operations in the context of a C-style heap memory. The proposed approach makes a clear …

Cooperation between verification methods is crucial to tackle the challenging problem of
software verification. The paper focuses on the verification of C programs using pointers and …

SMT solvers are efficient tools to decide the satisfiability of ground formulas, including a
number of built-in theories such as congruence, linear arithmetic, arrays, and bit-vectors …

The present thesis introduces a generic parameterized framework for static analysis of Java
bytecode programs, based on constraint generation and solving. This framework is able to …