A decidable fragment in separation logic with inductive predicates and arithmetic

• Main Authors: LE, Quang Loc, TATSUTA, Makoto, SUN, Jun, CHIN, Wei-Ngan
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2017
• Subjects: Decidability; Inductive predicates; Satisfiability solving; Separation logic; Software Engineering; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/4702; https://ink.library.smu.edu.sg/context/sis_research/article/5705/viewcontent/Decidable_fragment_cav2017_av.pdf
• Institution: Singapore Management University

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 case. We have implemented our decision procedure and integrated it into an existing verification system. Our experiment on benchmarks shows that our procedure helps to verify the benchmarks effectively.