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 …

Program properties that are automatically inferred by static analysis tools are generally not
considered to be completely trustworthy, unless the tool implementation or the results are …

In programming languages with dynamic use of memory, such as Java, knowing that a
reference variable x points to an acyclic data structure is valuable for the analysis of …

In heap-based languages, knowing that a variable x points to an acyclic data structure is
useful for analyzing termination. This information guarantees that the depth of the data …

In static analysis of programming languages with dynamic memory, sharing analysis tries to
infer if two variables point to data structures which are not disjoint. Ie, two variables share at …

In this tutorial paper, we overview the techniques that underlie the automatic inference of
resource consumption bounds. We first explain the basic techniques on a Java-like …

Termination analysis has received considerable attention, traditionally in the context of
declarative programming and, recently, also for imperative and Object Oriented (OO) …

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 …

In general, if acyclicity cannot be proved, then no termination can be guaranteed in such
situations. However, sometimes it may be possible, even without proving acyclicity, to …

Resource Analysis (aka Cost Analysis) tries to approximate the cost of executing programs
by means of cost functions on their input data sizes without actually having to execute the …