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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of automated reasoning Ročník 58; číslo 1; s. 3 - 31
Hlavní autoři:	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é
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Dordrecht Springer Netherlands 01.01.2017 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!