Reachability Analysis of Communicating Pushdown Systems
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...
| Κύριοι συγγραφείς: | , , , |
|---|---|
| Μορφή: | Άρθρο |
| Γλώσσα: | English |
| Έκδοση: |
Logical Methods in Computer Science e.V.
2012-09-01
|
| Σειρά: | Logical Methods in Computer Science |
| Θέματα: | |
| Διαθέσιμο Online: | https://lmcs.episciences.org/921/pdf |