A carregar...
Revisiting Underapproximate Reachability for Multipushdown Systems
Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in analyzing a restricted class which still captures useful behaviors. In this paper, we propose a new class of bounded undera...
Na minha lista:
| Publicado no: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2020
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7439744/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45190-5_21 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|