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

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

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n20http://localhost/temp/predkladatel/
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F13%3APU106304%21RIV14-GA0-26230___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F13%3APU106304%21RIV14-GA0-26230___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded number of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification. We extend this approach by allowing specifications to be given by a class of infinite-state automata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verification, we develop a shape analysis, which tracks correlations bet We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded number of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification. We extend this approach by allowing specifications to be given by a class of infinite-state automata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verification, we develop a shape analysis, which tracks correlations bet
dcterms:title
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
skos:prefLabel
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
skos:notation
RIV/00216305:26230/13:PU106304!RIV14-GA0-26230___
n15:predkladatel
n16:orjk%3A26230
n3:aktivita
n18:P
n3:aktivity
P(GAP103/10/0306)
n3:dodaniDat
n17:2014
n3:domaciTvurceVysledku
n9:1258486
n3:druhVysledku
n22:D
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
60384
n3:idVysledku
RIV/00216305:26230/13:PU106304
n3:jazykVysledku
n5:eng
n3:klicovaSlova
verification, specification, concurrency, parallelism, lock-free data structures, automata, data independence, thread modular, precision
n3:klicoveSlovo
n4:thread%20modular n4:specification n4:concurrency n4:data%20independence n4:parallelism n4:lock-free%20data%20structures n4:precision n4:automata n4:verification
n3:kontrolniKodProRIV
[435CAF486D4B]
n3:mistoKonaniAkce
Řím
n3:mistoVydani
Berlin Heidelberg
n3:nazevZdroje
19th International Conference, TACAS 2013
n3:obor
n6:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
5
n3:projekt
n8:GAP103%2F10%2F0306
n3:rokUplatneniVysledku
n17:2013
n3:tvurceVysledku
Holík, Lukáš Abdulla, Parosh Jonsson, Bengt Haziza, Frédéric Rezine, Ahmed
n3:typAkce
n10:WRD
n3:zahajeniAkce
2013-03-18+01:00
s:numberOfPages
15
n21:hasPublisher
Springer-Verlag
n19:isbn
978-3-642-36742-7
n20:organizacniJednotka
26230