Detail publikace

The Tree Width of Separation Logic with Recursive Definitions

ROGALEWICZ, A. ŠIMÁČEK, J. IOSIF, R.

Originální název

The Tree Width of Separation Logic with Recursive Definitions

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

Separation logic, Tree width, MSO, Graphs

Autoři

ROGALEWICZ, A.; ŠIMÁČEK, J.; IOSIF, R.

Rok RIV

2013

Vydáno

12. 3. 2013

Nakladatel

Springer Verlag

Místo

Berlin

ISBN

978-3-642-38573-5

Kniha

Automated Deduction - CADE-24

Edice

Lecture Notes in Artificial Intelligence

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Ročník

2013

Číslo

7898

Stát

Spolková republika Německo

Strany od

21

Strany do

38

Strany počet

18

URL

http://link.springer.com/chapter/10.1007/978-3-642-38574-2_2

BibTex

@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"
}