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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of automated reasoning Jg. 58; H. 1; S. 3 - 31
Hauptverfasser:	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
Sprache:	Englisch
Veröffentlicht:	Dordrecht Springer Netherlands 01.01.2017 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!