Dynamic symbolic execution (DSE) has been proposed to effectively generate test inputs for
real-world programs. Unfortunately, DSE techniques do not scale well for large realistic …

We present a new modular shape analysis that can synthesize heap memory specification
on a per method basis. We rely on a second-order biabduction mechanism that can give …

An important, challenging problem in the verification of imperative programs with shared,
mutable state is the frame problem in the presence of data abstraction. That is, one must be …

First order logic with transitive closure, and separation logic enable elegant interactive
verification of heap-manipulating programs. However, undecidabilty results and high …

Being able to analyze programs function by function, or module by module is a key
ingredient to scalable static analyses. The main difficulty for modular static analysis is to be …

We describe a framework for reasoning about programs with lists carrying integer numerical
data. We use abstract domains to describe and manipulate complex constraints on …

Shape analyses aim at inferring semantic invariants related to the data-structures that
programs manipulate. To achieve that, they typically abstract the set of reachable states. By …

The aim of static analysis is to infer invariants about programs that are precise enough to
establish semantic properties, such as the absence of run-time errors. Broadly speaking …

We address the problem of automatic synthesis of assertions on sequential programs with
singly-linked lists containing data over infinite domains such as integers or reals. Our …

Shape Analysis | SpringerLink Skip to main content Advertisement SpringerLink Account Menu
Find a journal Publish with us Track your research Search Cart Book cover Handbook of Image …