About: Compositional Entailment Checking for a Fragment of Separation Logic

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

About: Compositional Entailment Checking for a Fragment of Separation Logic 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
Description	We present a (semi-)decision procedure for checking entailment between separation logic formulas with inductive predicates specifying complex data structures corresponding to finite nesting of various kinds of linked lists: acyclic or cyclic, singly or doubly linked, skip lists, etc. The decision procedure is compositional in the sense that it reduces the problem of checking entailment between two arbitrary formulas to the problem of checking entailment between a formula and an atom. Subsequently, in case the atom is a predicate, we reduce the entailment to testing membership of a tree derived from the formula in the language of a tree automaton derived from the predicate. We implemented this decision procedure and tested it successfully on verification conditions obtained from programs using singly and doubly linked nested lists as well as skip lists. We present a (semi-)decision procedure for checking entailment between separation logic formulas with inductive predicates specifying complex data structures corresponding to finite nesting of various kinds of linked lists: acyclic or cyclic, singly or doubly linked, skip lists, etc. The decision procedure is compositional in the sense that it reduces the problem of checking entailment between two arbitrary formulas to the problem of checking entailment between a formula and an atom. Subsequently, in case the atom is a predicate, we reduce the entailment to testing membership of a tree derived from the formula in the language of a tree automaton derived from the predicate. We implemented this decision procedure and tested it successfully on verification conditions obtained from programs using singly and doubly linked nested lists as well as skip lists. (en)
Title	Compositional Entailment Checking for a Fragment of Separation Logic Compositional Entailment Checking for a Fragment of Separation Logic (en)
skos:prefLabel	Compositional Entailment Checking for a Fragment of Separation Logic Compositional Entailment Checking for a Fragment of Separation Logic (en)
skos:notation	RIV/00216305:26230/14:PU112013!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	Lengál, Ondřej Vojnar, Tomáš
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	8420
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/14:PU112013
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	program verification, decision procedures, separation logic, tree automata (en)
http://linked.open.../riv/klicoveSlovo	separation logic program verification tree automata decision procedures
http://linked.open...ontrolniKodProRIV	[087442942C52]
http://linked.open...v/mistoKonaniAkce	Singapore
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Proceedings of APLAS'14
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (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áš Lengál, Ondřej Enea, Constantin Sighireanu, Mihaela
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-11-17 (xsd:date)
number of pages	19 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-319-12735-4
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