Pointer arithmetic is widely used in low-level programs, e.g. memory allocators.

Heap list is a data structure used in many memory allocators, to describe the physical layout of the memory.

%

%The verification of such programs usually requires simultaneous reasoning about pointer arithmetic and unbounded heap regions.

The specification of such programs usually requires using pointer arithmetic inside inductive definitions to define the common data structures, e.g. heap lists. % in memory allocators.

The specification of the programs in memory allocators usually requires using pointer arithmetic inside inductive definitions to define heap lists. % in memory allocators.

%

In this work, we investigate decision problems for SLAH, a separation logic fragment

that allows some form of pointer arithmetic inside inductive definitions,

thus enabling specification of properties for programs manipulating heap lists,

a data structure used in memory allocators.

thus enabling specification of properties for programs manipulating heap lists.

%

Pointer arithmetic inside inductive definitions is challenging for automated reasoning.

%

We tackle this challenge and achieve decision procedures for both satisfiability and entailment of SLAH formulas specifying heap lists data structures.

We tackle this challenge and achieve decision procedures for both satisfiability and entailment of SLAH formulas.

% specifying heap lists data structures.

%

The crux of our decision procedure for satisfiability is to compute summaries of inductive definitions capturing heap lists. We show that although the summary is naturally expressed as an existentially quantified non-linear arithmetic formula, it can actually be transformed into an equivalent linear arithmetic formula.