Detail výsledku
The Tree Width of Separation Logic with Recursive Definitions
Separation Logic is a widely used formalism for describing dynamically
allocated linked data structures, such as lists, trees, etc. The decidability
status of various fragments of the logic constitutes a long standing open problem. Current results report on techniques to decide satisfiability and validity of entailments for Separation Logic(s) over lists (possibly with data). In this paper we establish a more general decidability result. We prove that any Separation Logic formula using rather general recursively defined predicates is decidable for satisfiability, and moreover, entailments between such formulae are decidable for validity. These predicates are general enough to define (doubly-) linked lists, trees, and structures more general than trees, such as trees whose leaves are chained in a list. The decidability proofs are by reduction to decidability ofMonadic Second Order Logic on graphs with bounded tree width.
Separation logic, Tree width, MSO, Graphs
@inproceedings{BUT103458,
author="Adam {Rogalewicz} and Jiří {Šimáček} and Iosif {Radu}",
title="The Tree Width of Separation Logic with Recursive Definitions",
booktitle="Automated Deduction - CADE-24",
year="2013",
series="Lecture Notes in Artificial Intelligence",
journal="Lecture Notes in Computer Science",
volume="2013",
number="7898",
pages="21--38",
publisher="Springer Verlag",
address="Berlin",
doi="10.1007/978-3-642-38574-2\{_}2",
isbn="978-3-642-38573-5",
issn="0302-9743",
url="http://link.springer.com/chapter/10.1007/978-3-642-38574-2_2"
}