About: Deciding Entailments in Inductive Separation Logic with Tree Automata

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Deciding Entailments in Inductive Separation Logic with Tree Automata Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://rd.springer.com/chapter/10.1007%2F978-3-319-11936-6_15
Description	Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. For practical purposes, we leverage from recent advances in automata theory, such as inclusion checking for non-deterministic TA avoiding explicit determinization. We implemented our method and present promising preliminary experimental results. Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. For practical purposes, we leverage from recent advances in automata theory, such as inclusion checking for non-deterministic TA avoiding explicit determinization. We implemented our method and present promising preliminary experimental results. (en)
Title	Deciding Entailments in Inductive Separation Logic with Tree Automata Deciding Entailments in Inductive Separation Logic with Tree Automata (en)
skos:prefLabel	Deciding Entailments in Inductive Separation Logic with Tree Automata Deciding Entailments in Inductive Separation Logic with Tree Automata (en)
skos:notation	RIV/00216305:26230/14:PU112038!RIV15-MSM-26230___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(ED1.1.00/02.0070), P(GA14-11384S), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Vojnar, Tomáš Rogalewicz, Adam
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	9934
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/14:PU112038
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Separation logic, entailment, decision procedure, tree automata, EXPTIME-complete (en)
http://linked.open.../riv/klicoveSlovo	entailment Separation logic tree automata EXPTIME-complete decision procedure
http://linked.open...ontrolniKodProRIV	[3CC4F3DCF2E3]
http://linked.open...v/mistoKonaniAkce	Sydney
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Proceedings of ATVA'14
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	IT4Innovations Centre of Excellence Automatic Formal Analysis and Verification of Programs with Complex Unbounded Data and Control Structures
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Vojnar, Tomáš Rogalewicz, Adam Radu, Iosif
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-11-03 (xsd:date)
number of pages	18 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-319-11935-9
http://localhost/t...ganizacniJednotka	26230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software