The Tree Width of Separation Logic with Recursive Definitions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F13%3APU106318" target="_blank" >RIV/00216305:26230/13:PU106318 - isvavai.cz</a>

Výsledek na webu

<a href="http://link.springer.com/chapter/10.1007/978-3-642-38574-2_2" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-38574-2_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-38574-2_2" target="_blank" >10.1007/978-3-642-38574-2_2</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The Tree Width of Separation Logic with Recursive Definitions

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

The Tree Width of Separation Logic with Recursive Definitions

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GAP103%2F10%2F0306" target="_blank" >GAP103/10/0306: Statická a dynamická verifikace programů s pokročilými rysy paralelismu a neomezenosti</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Automated Deduction - CADE-24

ISBN

978-3-642-38573-5

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

18

Strana od-do

21-38

Název nakladatele

Springer Verlag

Místo vydání

Berlin

Místo konání akce

The Crowne Plaza Resort in Lake Placid, New York

Datum konání akce

9. 6. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—