| Autor: |
Alexander Heussner, Jérôme Leroux, Anca Muscholl, Grégoire Sutre |
| Jazyk: |
angličtina |
| Rok vydání: |
2012 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012) |
| Druh dokumentu: |
article |
| ISSN: |
1860-5974 |
| DOI: |
10.2168/LMCS-8(3:23)2012 |
| Popis: |
The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability problem restricted to eager runs (i.e., runs where messages are either received immediately after being sent, or never received). The problem is EXPTIME-complete in the decidable case. The second result is a doubly exponential time algorithm for bounded context analysis in this setting, together with a matching lower bound. Both results extend and improve previous work from La Torre et al. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
