Giesl, J. and Aschermann, C. and Brockschmidt, M. and Emmes, F. and Frohn, F. and Fuhs, Carsten and Hensel, J. and Otto, C. and Plücker, M. and Schneider-Kamp, P. and Ströder, T. and Swiderski, S. and Thiemann, R. (2016) Analyzing program termination and complexity automatically with AProVE. Journal of Automated Reasoning 58 (1), pp. 3-31. ISSN 0168-7433.
|
Text
JAR-AProVE.pdf - Author's Accepted Manuscript Download (674kB) | Preview |
Abstract
In this system description, we present the tool AProVE for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and rewrite systems. In addition to classical term rewrite systems (TRSs), AProVE also supports rewrite systems containing built-in integers (int-TRSs). To analyze programs in high-level languages, AProVE automatically converts them to (int-)TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting rewrite systems. The generated proofs can be exported to check their correctness using automatic certifiers. To use AProVE in software construction, we present a corresponding plug-in for the popular Eclipse software development environment.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | The final publication is available at Springer via the link above. |
| Keyword(s) / Subject(s): | Termination analysis, Complexity analysis, Java/C/Haskell/Prolog programs, Term rewriting |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 01 Nov 2016 11:12 |
| Last Modified: | 09 Aug 2023 12:39 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/16551 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
