Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2564
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBouajjani, Ahmedde
dc.contributor.authorEsparza, Javierde
dc.contributor.authorSchwoon, Stefande
dc.contributor.authorStrejcek, Jande
dc.date.accessioned2005-12-01de
dc.date.accessioned2016-03-31T07:58:33Z-
dc.date.available2005-12-01de
dc.date.available2016-03-31T07:58:33Z-
dc.date.issued2005de
dc.identifier.other252545761de
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-24645de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/2581-
dc.identifier.urihttp://dx.doi.org/10.18419/opus-2564-
dc.description.abstractWe 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) and DPN (dynamic pushdown networks). 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, 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
dc.language.isoende
dc.relation.ispartofseriesTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2005,6de
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.classificationModel checking , Kellerautomat , Heuristikde
dc.subject.ddc004de
dc.subject.otherADPN , asynchronous dynamic pushdown networksen
dc.titleReachability analysis of multithreaded software with asynchronous communicationen
dc.typeworkingPaperde
dc.date.updated2013-07-08de
ubs.fakultaetFakultät Informatik, Elektrotechnik und Informationstechnikde
ubs.institutInstitut für Formale Methoden der Informatikde
ubs.opusid2464de
ubs.publikation.typArbeitspapierde
ubs.schriftenreihe.nameTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnikde
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
TR_2005_06.pdf183,15 kBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.