Analyzing Program Termination and Complexity Automatically with AProVE

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 prog...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of automated reasoning Vol. 58; no. 1; pp. 3 - 31
Main Authors:	Giesl, Jürgen, Aschermann, Cornelius, Brockschmidt, Marc, Emmes, Fabian, Frohn, Florian, Fuhs, Carsten, Hensel, Jera, Otto, Carsten, Plücker, Martin, Schneider-Kamp, Peter, Ströder, Thomas, Swiderski, Stephanie, Thiemann, René
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.01.2017 Springer Nature B.V
Subjects:	Artificial Intelligence Automation Complexity Computer programs Computer Science Exports Integers Java (programming language) Logic programming Mathematical Logic and Formal Languages Mathematical Logic and Foundations Monetary unions Prolog Prolog (programming language) Software development Symbolic and Algebraic Manipulation Term rewriting Complexity analysis Termination analysis Java/C/Haskell/Prolog programs
ISSN:	0168-7433, 1573-0670
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!