Zobrazeno 1 - 10
of 240
pro vyhledávání: '"Context-bounded analysis"'
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 4 (November 23, 2011) lmcs:708
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number o
Externí odkaz:
http://arxiv.org/abs/1111.1011
Context-bounded analysis of concurrent programs is a technique to compute a sequence of under-approximations of all behaviors of the program. For a fixed bound k, a context bounded analysis considers only those runs in which a single process is inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11a227c4aaad7b5b133803852e5b9819
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 4 (2011)
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number o
Externí odkaz:
https://doaj.org/article/bb6b9a9607b342009ef178aa505a5935
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662545799
TACAS (2)
TACAS (2)
We propose an under-approximate reachability analysis algorithm for programs running under the POWER memory model, in the spirit of the work on context-bounded analysis intitiated by Qadeer et al. in 2005 for detecting bugs in concurrent programs sup
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::348aa7e547fb55c6cf0bf3862e694022
https://doi.org/10.1007/978-3-662-54580-5_4
https://doi.org/10.1007/978-3-662-54580-5_4
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783642007675
TACAS
TACAS
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis explores all behaviors of a concurrent program up to some fixed number o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cb393d3e3ecf9f001acc80529fbf6ab
https://doi.org/10.1007/978-3-642-00768-2_11
https://doi.org/10.1007/978-3-642-00768-2_11
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
From Programs to Systems. The Systems perspective in Computing ISBN: 9783642548475
FPS@ETAPS
FPS@ETAPS
We address the state reachability problem in concurrent programs running over the TSO weak memory model. This problem has been shown to be decidable with non-primitive recursive complexity in the case of finite-state threads. For recursive threads th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::199aecec52be0b38dcfdecc43860a0aa
https://doi.org/10.1007/978-3-642-54848-2_2
https://doi.org/10.1007/978-3-642-54848-2_2
Publikováno v:
Model Checking Software ISBN: 9783540851134
SPIN
SPIN
The reachability problem is undecidable for programs with both recursive procedures and multiple threads with shared memory. Approaches to this problem have been the focus of much recent research. One of these is to use context-bounded reachability,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fef3088c4a721c38fa49729e8843e17f
https://doi.org/10.1007/978-3-540-85114-1_19
https://doi.org/10.1007/978-3-540-85114-1_19
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783540787990
TACAS
TACAS
We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::377f11bd0dda3ef5fa746ccff6edb6ec
https://eprints.soton.ac.uk/272462/
https://eprints.soton.ac.uk/272462/