| Attributes | Values |
|---|
| rdf:type
| |
| 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. (en)
- Představujeme Asynchronni dynamické zásobníkové sítě (ADPN) jako nový model pro vícevláknové programy, ve kterém zásobníkové systémy komunikují přes sdílenou paměť. ADPN zobecňuje CPS (souběžné zásobníkové systémy) [QR05] a DPN (dynamické zásobníkové sítě) [BMOT05]. Ukážeme, že ADPN mají několik výhod. Jelikož problém dosažitelnosti pro ADPN je nerozhodnutelný i pro případ bez dynamického vytváření procesů, zabýváme se problémem omezené dosažitelnosti [QR05], který uvažuje jenom ty výpočetní běhy, kde počet změn (indexu) procesu mometálně přistupujícímu ke sdílené paměti omezen daným číslem. Poskytujeme efektivní algoritmy pro analýzu dopředné i zpětné dosažitelnosti. Tyto algoritmy využívají známé techniky pracující s automaty, které reprezentují množiny konfigurací. (cs)
|
| Title
| - Reachability Analysis of Multithreaded Software with Asynchronous Communication
- Analýza dosažitelnosti pro vícevláknové programy s asynchronní komunikací (cs)
- Reachability Analysis of Multithreaded Software with Asynchronous Communication (en)
|
| skos:prefLabel
| - Reachability Analysis of Multithreaded Software with Asynchronous Communication
- Analýza dosažitelnosti pro vícevláknové programy s asynchronní komunikací (cs)
- Reachability Analysis of Multithreaded Software with Asynchronous Communication (en)
|
| skos:notation
| - RIV/00216224:14330/05:00012714!RIV08-MSM-14330___
|
| http://linked.open.../vavai/riv/strany
| |
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| - P(1M0545), P(GA201/03/1161), Z(MSM0021622419)
|
| http://linked.open...iv/cisloPeriodika
| |
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/00216224:14330/05:00012714
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - bounded reachability; symbolic reachability; asynchronous dynamic pushdown network (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...odStatuVydavatele
| - DE - Spolková republika Německo
|
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...i/riv/nazevZdroje
| - Lecture Notes in Computer Science
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...vavai/riv/projekt
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...v/svazekPeriodika
| |
| http://linked.open...iv/tvurceVysledku
| - Bouajjani, Ahmed
- Strejček, Jan
- Esparza, Javier
- Schwoon, Stefan
|
| http://linked.open...n/vavai/riv/zamer
| |
| issn
| |
| number of pages
| |
| http://localhost/t...ganizacniJednotka
| |
| is http://linked.open...avai/riv/vysledek
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)