About: Automata-Based Termination Proofs

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

About: Automata-Based Termination Proofs 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	This paper proposes a framework for detecting termination of programs<br>handling infinite and complex data domains, such as pointer structures. In<br>this framework, the user has to specify a finite number of well-founded relations<br>on the data domain manipulated by these programs. Our tool then builds an initial<br>abstraction of the program, which is checked for existence of potential infinite<br>runs, by testing emptiness of its intersection with a predefined Buchi automaton.<br>If the intersection is non-empty, a lasso-shaped counterexample is found. This<br>counterexample is checked for spuriousness by a domain-specific procedure, and<br>in case it is found to be spurious, the abstraction is refined, again by intersection<br>with the complement of the Buchi automaton representing the lasso. We have instantiated<br>the framework for programs handling tree-like data structures, which<br>allowed us to prove termination of programs such as the depth-first tree traversal,<br>the Deutsch-Schorr-Wait This paper proposes a framework for detecting termination of programs<br>handling infinite and complex data domains, such as pointer structures. In<br>this framework, the user has to specify a finite number of well-founded relations<br>on the data domain manipulated by these programs. Our tool then builds an initial<br>abstraction of the program, which is checked for existence of potential infinite<br>runs, by testing emptiness of its intersection with a predefined Buchi automaton.<br>If the intersection is non-empty, a lasso-shaped counterexample is found. This<br>counterexample is checked for spuriousness by a domain-specific procedure, and<br>in case it is found to be spurious, the abstraction is refined, again by intersection<br>with the complement of the Buchi automaton representing the lasso. We have instantiated<br>the framework for programs handling tree-like data structures, which<br>allowed us to prove termination of programs such as the depth-first tree traversal,<br>the Deutsch-Schorr-Wait (en)
Title	Automata-Based Termination Proofs Automata-Based Termination Proofs (en)
skos:prefLabel	Automata-Based Termination Proofs Automata-Based Termination Proofs (en)
skos:notation	RIV/00216305:26230/09:PU82664!RIV11-GA0-26230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA102/07/0322), P(GP201/09/P531)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	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	304444
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/09:PU82664
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Formal verification, Termination, Buchi automata, Tree automata, Programs with pointers<br> (en)
http://linked.open.../riv/klicoveSlovo	Buchi automata Tree automata Termination Formal verification Programs with pointers<br>
http://linked.open...ontrolniKodProRIV	[CA834236563D]
http://linked.open...v/mistoKonaniAkce	Sydney
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	Implementation and Application of Automata
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Developement of methods for automatic verification of programs with dynamic data structures Advanced Formal Approaches in the Design and Verification of Computer-Based Systems
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Rogalewicz, Adam Radu, Iosif
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-04-14 (xsd:date)
number of pages	13 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-02978-3
http://localhost/t...ganizacniJednotka	26230
is http://linked.open...avai/riv/vysledek of	Automata-Based Termination Proofs Automata-Based Termination Proofs Automata-Based Termination Proofs

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