A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic
[chapter]
2017
Lecture Notes in Computer Science
We consider the satisfiability problem for a fragment of separation logic including inductive predicates with shape and arithmetic properties. We show that the fragment is decidable if the arithmetic properties can be represented as semilinear sets. Our decision procedure is based on a novel algorithm to infer a finite representation for each inductive predicate which precisely characterises its satisfiability. Our analysis shows that the proposed algorithm runs in exponential time in the worst
doi:10.1007/978-3-319-63390-9_26
fatcat:jiyzl6x5hrgohc6jooudtqf33m