RevTerm
Chatterjee K, Goharshady AK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
Download (ext.)
DOI
Research Data Reference
Department
Abstract
RevTerm is a static analysis tool for proving non-termination of integer C programs (possibly with non-determinism). RevTerm is an implementation of our method for non-termination proving presented in the paper “Proving Non-termination by Program Reversal”.
Publishing Year
Date Published
2021-06-01
IST-REx-ID
Cite this
Chatterjee K, Goharshady AK, Novotný P, Zikelic D. RevTerm. 2021. doi:10.1145/3410304
Chatterjee, K., Goharshady, A. K., Novotný, P., & Zikelic, D. (2021). RevTerm. Association for Computing Machinery. https://doi.org/10.1145/3410304
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “RevTerm.” Association for Computing Machinery, 2021. https://doi.org/10.1145/3410304.
K. Chatterjee, A. K. Goharshady, P. Novotný, and D. Zikelic, “RevTerm.” Association for Computing Machinery, 2021.
Chatterjee K, Goharshady AK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
Chatterjee, Krishnendu, et al. RevTerm. Association for Computing Machinery, 2021, doi:10.1145/3410304.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Google Scholar