Accurately representing the structure and manipulation of heap-allocated data structures is a key challenge for automatic verification of nontrivial code.

Accurately representing the structure and manipulation of heap-allocated data structures is a key challenge for automatic verification of nontrivial code.

Accurately representing the structure and manipulation of heap-allocated data structures is a key challenge for automatic verification of nontrivial code.

In this talk, I will describe our techniques for automatically verifying the absence of such pointer errors, which we have been developing for the past three ...

In order to reduce the complexity of formal (manual) verification of programs, separation logic has unusual proof rules that exploit programming disciplines ...

May 17, 2024 · Verification in separation logic is modular, that is, each method is verified independently, using method specifications to reason about calls.

We present a logic for relating heap-manipulating programs to numeric ... Automated verification of shape and size properties via separation logic. In ...

The logics we develop are a frame logic (FL) and a separation logic (SL-FL) that has an alternate semantics inspired by frame logic. We show a verification ...

However, many automatic verifiers based on separation logic rely on proof search algorithms that may render inlining non-preserving. Separation logic [Reynolds ...

Abstract. Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full sup-.