Efficient Analysis of VASS Termination Complexity
Domaines
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |
![]()
Cite 10.1145/3373718.3394751 Autre Kučera, A., Leroux, J., & Velan, D. (2020). Efficient Analysis of VASS Termination Complexity. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 676–688). LICS ’20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science. ACM. https://doi.org/10.1145/3373718.3394751