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...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Logical Methods in Computer Science e.V.
2012-09-01
|
| Colección: | Logical Methods in Computer Science |
| Materias: | |
| Acceso en línea: | https://lmcs.episciences.org/921/pdf |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|