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

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

Namespace Prefixes

PrefixIRI
n13http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n14http://purl.org/net/nknouf/ns/bibtex#
n11http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n21http://linked.opendata.cz/ontology/domain/vavai/
n18https://schema.org/
n8http://linked.opendata.cz/resource/domain/vavai/zamer/
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/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n16http://reference.data.gov.uk/id/gregorian-year/
n7http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F05%3A00012714%21RIV10-GA0-14330___/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F05%3A00012714%21RIV10-GA0-14330___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
We introduce Asynchronous Dynamic Pushdown Networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CPS (concurrent pushdown systems) [QR05] and DPN (dynamic pushdown networks) [BMOT05]. We show that ADPN exhibit several advantages as a program model. Since the reachability problem for ADPN is undecidable even in the case without dynamic creation of processes, we address the bounded reachability problem [QR05], which considers only those computation sequences where the (index of the) thread accessing the shared memory is changed at most a fixed given number of times. We provide efficient algorithms for both forward and backward reachability analysis. The algorithms are based on automata techniques for symbolic representation of sets of configurations. We introduce Asynchronous Dynamic Pushdown Networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CPS (concurrent pushdown systems) [QR05] and DPN (dynamic pushdown networks) [BMOT05]. We show that ADPN exhibit several advantages as a program model. Since the reachability problem for ADPN is undecidable even in the case without dynamic creation of processes, we address the bounded reachability problem [QR05], which considers only those computation sequences where the (index of the) thread accessing the shared memory is changed at most a fixed given number of times. We provide efficient algorithms for both forward and backward reachability analysis. The algorithms are based on automata techniques for symbolic representation of sets of configurations.
dcterms:title
Reachability Analysis of Multithreaded Software with Asynchronous Communication Reachability Analysis of Multithreaded Software with Asynchronous Communication
skos:prefLabel
Reachability Analysis of Multithreaded Software with Asynchronous Communication Reachability Analysis of Multithreaded Software with Asynchronous Communication
skos:notation
RIV/00216224:14330/05:00012714!RIV10-GA0-14330___
n3:aktivita
n6:Z n6:P
n3:aktivity
P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
n3:dodaniDat
n16:2010
n3:domaciTvurceVysledku
n19:3978915
n3:druhVysledku
n20:D
n3:duvernostUdaju
n22:S
n3:entitaPredkladatele
n7:predkladatel
n3:idSjednocenehoVysledku
540074
n3:idVysledku
RIV/00216224:14330/05:00012714
n3:jazykVysledku
n15:eng
n3:klicovaSlova
bounded reachability; symbolic reachability; asynchronous dynamic pushdown network
n3:klicoveSlovo
n4:asynchronous%20dynamic%20pushdown%20network n4:bounded%20reachability n4:symbolic%20reachability
n3:kontrolniKodProRIV
[1518AC3A55E4]
n3:mistoKonaniAkce
Hyderabad, India
n3:mistoVydani
Berlin, Heidelberg
n3:nazevZdroje
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference
n3:obor
n17:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
4
n3:projekt
n12:GA201%2F03%2F1161 n12:1M0545
n3:rokUplatneniVysledku
n16:2005
n3:tvurceVysledku
Schwoon, Stefan Esparza, Javier Bouajjani, Ahmed Strejček, Jan
n3:typAkce
n13:WRD
n3:wos
000234885800028
n3:zahajeniAkce
2005-01-01+01:00
n3:zamer
n8:MSM0021622419
s:numberOfPages
12
n14:hasPublisher
Springer-Verlag
n18:isbn
3-540-30495-9
n11:organizacniJednotka
14330