We propose a new approach to shape analysis of programs with linked lists that use low-
level memory operations. Such operations include pointer arithmetic, safe usage of invalid …

The Rust programming language continues to rise in popularity, and as such, warrants the
close attention of the programming languages community. In this work, we present a new …

We tackle the problem of checking non-proof-carrying code, ie automatically proving type-
safety (implying in our type system spatial memory safety) of low-level C code or of machine …

Predator Shape Analysis Tool Suite | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

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 propose a shape analysis suitable for analysis engines that perform automatic invariant
inference using an SMT solver. The proposed solution includes an abstract template domain …

Real-world data structures are often enhanced with additional pointers capturing alternative
paths through a basic inductive skeleton (eg, back pointers, head pointers). From the static …

To understand and detect possible errors in programs manipulating memory, static analyses
of various levels of precision have been introduced, yet it remains hard to capture both …

Interprocedural program analysis is often performed by computing procedure summaries.
While possible, computing adequate summaries is difficult, particularly in the presence of …

We consider the verification of lock-free data structures that manually manage their memory
with the help of a safe memory reclamation (SMR) algorithm. Our first contribution is a type …