This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n7http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F10%3APU89495%21RIV11-GA0-26230___/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F10%3APU89495%21RIV11-GA0-26230___
rdf:type
skos:Concept n6:Vysledek
dcterms:description
This paper, which is an extended version of a paper originally published at TACAS'06, describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is undecidable, we appeal to a classical semi-algorithmic approach in which the user has to provide manually the loop invariants in order to check the validity of Hoare triples of the form {P}C{Q}, where P, Q are the sets of states corresponding to the pre- and post-conditions, and C is the program to be verified. We specify the sets of states (representing tree-like memory configurations) using&nbsp; a special class of tree automata named Tree Automata with Size Constraints (TASC). The main advantage of using TASC in program specifications is that they recognize non-regular sets of tree languages such as the <i>AVL trees</i>, the&nbsp; <i>red-black trees</i>, and in general, specifications involving arithmetic reasoning about the lengths (depths) of various This paper, which is an extended version of a paper originally published at TACAS'06, describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is undecidable, we appeal to a classical semi-algorithmic approach in which the user has to provide manually the loop invariants in order to check the validity of Hoare triples of the form {P}C{Q}, where P, Q are the sets of states corresponding to the pre- and post-conditions, and C is the program to be verified. We specify the sets of states (representing tree-like memory configurations) using&nbsp; a special class of tree automata named Tree Automata with Size Constraints (TASC). The main advantage of using TASC in program specifications is that they recognize non-regular sets of tree languages such as the <i>AVL trees</i>, the&nbsp; <i>red-black trees</i>, and in general, specifications involving arithmetic reasoning about the lengths (depths) of various
dcterms:title
Automata-based Verification of Programs with Tree Updates Automata-based Verification of Programs with Tree Updates
skos:prefLabel
Automata-based Verification of Programs with Tree Updates Automata-based Verification of Programs with Tree Updates
skos:notation
RIV/00216305:26230/10:PU89495!RIV11-GA0-26230___
n4:aktivita
n8:Z n8:P
n4:aktivity
P(GA102/07/0322), Z(MSM0021630528)
n4:cisloPeriodika
1
n4:dodaniDat
n9:2011
n4:domaciTvurceVysledku
n18:9761985
n4:druhVysledku
n15:J
n4:duvernostUdaju
n13:S
n4:entitaPredkladatele
n19:predkladatel
n4:idSjednocenehoVysledku
248156
n4:idVysledku
RIV/00216305:26230/10:PU89495
n4:jazykVysledku
n17:eng
n4:klicovaSlova
Formal verification, symbolic verification, programs handling balanced trees, theory of automata.
n4:klicoveSlovo
n11:Formal%20verification n11:programs%20handling%20balanced%20trees n11:symbolic%20verification n11:theory%20of%20automata.
n4:kodStatuVydavatele
DE - Spolková republika Německo
n4:kontrolniKodProRIV
[4FF06F26DE1D]
n4:nazevZdroje
Acta Informatica
n4:obor
n16:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
3
n4:projekt
n14:GA102%2F07%2F0322
n4:rokUplatneniVysledku
n9:2010
n4:svazekPeriodika
47
n4:tvurceVysledku
Vojnar, Tomáš Habermehl, Peter Radu, Iosif
n4:zamer
n10:MSM0021630528
s:issn
0001-5903
s:numberOfPages
31
n7:organizacniJednotka
26230