article

Analyzing Program Termination and Complexity Automatically with AProVE

Authors:

Cornelius Aschermann,

Marc Brockschmidt,

Martin Plücker,

Peter Schneider-Kamp,

Thomas Ströder,

Stephanie Swiderski,

René ThiemannAuthors Info & Claims

Journal of Automated Reasoning, Volume 58, Issue 1

Pages 3 - 31

https://doi.org/10.1007/s10817-016-9388-y

Published: 01 January 2017 Publication History

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.

References

[1]

Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Removing useless variables in cost analysis of Java Bytecode. In: SAC '08, pp. 368---375 (2008)

Digital Library

[2]

Alias, C., Darte, A., Feautrier, P., Gonnord, L.: Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In: SAS '10, pp. 117---133 (2010)

Digital Library

[3]

Alpuente, M., Escobar, S., Lucas, S.: Removing redundant arguments automatically. TPLP 7(1---2), 3---35 (2007)

Digital Library

[4]

AProVE. http://aprove.informatik.rwth-aachen.de/

[5]

Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: Version 2.5. Technical report, The University of Iowa. http://smt-lib.org/ (2015)

[6]

Bertot, Y., Castéran, P.: Coq'Art. Springer, Berlin (2004)

[7]

Blanqui, F., Koprowski, A.: CoLoR: A Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates. Math. Struct. Comput. Sci. 4, 827---859 (2011)

[8]

Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: CAV '05, pp. 491---504 (2005)

Digital Library

[9]

Bray, T.: The JavaScript object notation (JSON) data interchange format. (2014). RFC 7159

[10]

Brockschmidt, M., Otto, C., Giesl, J.: Modular termination proofs of recursive Java Bytecode programs by term rewriting. In: RTA '11, pp. 155---170 (2011)

[11]

Brockschmidt, M., Ströder, T., Otto, C., Giesl, J.: Automated detection of non-termination and NullPointerExceptions for Java Bytecode. In: FoVeOOS '11, pp. 123---141 (2012)

Digital Library

[12]

Brockschmidt, M., Musiol, R., Otto, C., Giesl, J.: Automated termination proofs for Java programs with cyclic data. In: CAV '12, pp. 105---122 (2012)

Digital Library

[13]

Brockschmidt, M., Cook, B., Fuhs, C.: Better termination proving through cooperation. In: CAV '13, pp. 413---429 (2013)

[14]

Brockschmidt, M., Emmes, F., Falke, S., Fuhs, C., Giesl, J.: Analyzing runtime and size complexity of integer programs. ACM TOPLAS 38(4), 13:1---13:50 (2016)

Digital Library

[15]

Christ, J., Hoenicke, J., Nutz, A.: SMTInterpol: an interpolating SMT solver. In: SPIN '12, pp. 248---254 (2012)

Digital Library

[16]

Codish, M., Fekete, Y., Fuhs, C., Giesl, J., Waldmann, J.: Exotic semiring constraints (extended abstract). In: SMT '12, pp. 87---96 (2012)

[17]

Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: SAT solving for termination proofs with recursive path orders and dependency pairs. JAR 49(1), 53---93 (2012)

Digital Library

[18]

Contejean, E., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Automated certified proofs with CiME3. In: RTA '11, pp. 21---30 (2011)

[19]

Cook, B., See, A., Zuleger, F.: Ramsey vs. lexicographic termination proving. In: TACAS '13, pp. 47---61 (2013)

Digital Library

[20]

Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL '77, pp. 238---252 (1977)

Digital Library

[21]

de Moura, L.M., BjØrner, N.: Z3: an efficient SMT solver. In: TACAS '08, pp. 337---340 (2008)

Digital Library

[22]

Dutertre, B., de Moura, L.M.: The Yices SMT solver. Tool paper at http://yices.csl.sri.com/tool-paper (2006)

[23]

Eclipse. http://www.eclipse.org/

[24]

Eén, N., Sörensson, N.: An extensible SAT-solver. In: SAT '03, pp. 502---518 (2004)

[25]

Emmes, F., Enger, T., Giesl, J.: Proving non-looping non-termination automatically. In: IJCAR '12, pp. 225---240 (2012)

Digital Library

[26]

Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. JAR 40(2---3), 195---220 (2008)

Digital Library

[27]

Falke, S., Kapur, D., Sinz, C.: Termination analysis of C programs using compiler intermediate languages. In: RTA '11, pp. 41---50 (2011)

[28]

Frohn, F., Giesl, J., Hensel, J., Aschermann, C., Ströder, T.: Inferring lower bounds for runtime complexity. In: RTA '15, pp. 334---349 (2015)

[29]

Frohn, F., Naaf, M., Hensel, J., Brockschmidt, M., Giesl, J.: Lower runtime bounds for integer programs. In: IJCAR '16, pp. 550---567 (2016)

Digital Library

[30]

Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R.,Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: SAT '07, pp. 340---354 (2007)

Digital Library

[31]

Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal termination. In: RTA '08, pp. 110---125 (2008)

Digital Library

[32]

Fuhs, C., Navarro-Marset, R., Otto, C., Giesl, J., Lucas, S., Schneider-Kamp, P.: Search techniques for rational polynomial orders. In: AISC '08, pp. 109---124 (2008)

Digital Library

[33]

Fuhs, C., Giesl, J., Plücker, M., Schneider-Kamp, P., Falke, S.: Proving termination of integer term rewriting. In: RTA '09, pp. 32---47 (2009)

Digital Library

[34]

Fuhs, C., Giesl, J., Parting, M., Schneider-Kamp, P., Swiderski, S.: Proving termination by dependency pairs and inductive theorem proving. JAR 47(2), 133---160 (2011)

Digital Library

[35]

Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: RTA '04, pp. 210---220 (2004)

[36]

Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: FroCoS '05, pp. 216---231 (2005)

Digital Library

[37]

Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. JAR 37(3), 155---203 (2006)

Digital Library

[38]

Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: automatic termination proofs in the dependency pair framework. In: IJCAR '06, pp. 281---286 (2006)

Digital Library

[39]

Giesl, J., Thiemann, R., Swiderski, S., Schneider-Kamp, P.: Proving termination by bounded increase. In: CADE '07, pp. 443---459 (2007)

Digital Library

[40]

Giesl, J., Raffelsieper, M., Schneider-Kamp, P., Swiderski, S., Thiemann, R.: Automated termination proofs for Haskell by term rewriting. ACM TOPLAS 33(2), 7:1---7:39 (2011)

Digital Library

[41]

Giesl, J., Ströder, T., Schneider-Kamp, P., Emmes, F., Fuhs, C.: Symbolic evaluation graphs and term rewriting--a general methodology for analyzing logic programs. In: PPDP '12, pp. 1---12 (2012)

Digital Library

[42]

Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S., Thiemann, R.: Proving termination of programs automatically with AProVE. In: IJCAR '14, pp. 184---191 (2014)

[43]

Hensel, J., Giesl, J., Frohn, F., Ströder, T.: Proving termination of programs with bitvector arithmetic by symbolic execution. In SEFM '16, pp. 234---252 (2016)

[44]

Koprowski, A., Waldmann, J.: Max/plus tree automata for termination of term rewriting. Acta Cybern. 19(2), 357---392 (2009)

Digital Library

[45]

Lankford, D.: On proving term rewriting systems are Noetherian. Technical Report Memo MTP-3, Louisiana Technical University (1979)

[46]

Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: CGO '04, pp. 75---88 (2004)

Digital Library

[47]

Le Berre, D., Parrain, A.: The SAT4J library, release 2.2. JSAT 7, 59---64 (2010)

[48]

McMillan, K.: Lazy abstraction with interpolants. In: CAV '06, pp. 123---136 (2006)

Digital Library

[49]

Nguyen, M.T., De Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: polynomial interpretations as a basis for termination analysis of logic programs. TPLP 11(1), 33---63 (2011)

Digital Library

[50]

Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL--A Proof Assistant for Higher-Order Logic. Springer, Berlin (2002)

Digital Library

[51]

Noschinski, L., Emmes, F., Giesl, J.: Analyzing innermost runtime complexity of term rewriting by dependency pairs. JAR 51(1), 27---56 (2013)

[52]

Otto, C., Brockschmidt, M., von Essen, C., Giesl, J.: Automated termination analysis of Java Bytecode by term rewriting. In RTA '10, pp. 259---276 (2010)

[53]

Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: VMCAI '04, pp. 239---251 (2004)

[54]

SMT-COMP. http://www.smt-comp.org/

[55]

Spoto, F., Lunjin, L., Mesnard, F.: Using CLP simplifications to improve Java Bytecode termination analysis. ENTCS 253(5), 129---144 (2009)

Digital Library

[56]

Spoto, F., Mesnard, F., Payet, É.: A termination analyser for Java Bytecode based on path-length. ACM TOPLAS 32(3), 8:1---8:70 (2010)

Digital Library

[57]

Ströder, T., Schneider-Kamp, P., Giesl, J.: Dependency triples for improving termination analysis of logic programs with cut. In: LOPSTR '10, pp. 184---199 (2011)

Digital Library

[58]

Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J., Schneider-Kamp, P.: Proving termination and memory safety for programs with pointer arithmetic. In: IJCAR '14, pp. 208---223 (2014)

[59]

Ströder, T., Aschermann, C., Frohn, F., Hensel, J., Giesl, J.: AProVE: termination and memory safety of C programs (competition contribution). In: TACAS '15, pp. 417---419 (2015)

Digital Library

[60]

SV-COMP. http://sv-comp.sosy-lab.org/

[61]

Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254---272 (2009)

Digital Library

[62]

Termination Comp. http://termination-portal.org/wiki/Termination_Competition

[63]

Thiemann, R., Sternagel, C.: Certification of termination proofs using CeTA. In: TPHOLs '09, pp. 452---468 (2009)

Digital Library

[64]

Zankl, H., Hirokawa, N., Middeldorp, A.: KBO orientability. JAR 43(2), 173---201 (2009)

Digital Library

Cited By

Payet É(2024)Non-termination in Term Rewriting and Logic ProgrammingJournal of Automated Reasoning10.1007/s10817-023-09693-z68:1Online publication date: 2-Feb-2024
https://dl.acm.org/doi/10.1007/s10817-023-09693-z
Lefaucheux EOuaknine JPurser DWorrell J(2024)Porous invariants for linear systemsFormal Methods in System Design10.1007/s10703-024-00444-363:1-3(235-271)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s10703-024-00444-3
Kassing JDollase SGiesl J(2024)A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term RewritingFunctional and Logic Programming10.1007/978-981-97-2300-3_4(62-80)Online publication date: 15-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2300-3_4
Show More Cited By

Analyzing Program Termination and Complexity Automatically with AProVE
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
  2. Semantics and reasoning
    1. Program reasoning

Recommendations

Automated termination proofs for haskell by term rewriting

There are many powerful techniques for automated termination analysis of term rewriting. However, up to now they have hardly been used for real programming languages. We present a new approach which permits the application of existing techniques from ...
Automated termination proofs for logic programs by term rewriting

There are two kinds of approaches for termination analysis of logic programs: “transformational” and “direct” ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program ...
Uncurrying for Termination and Complexity

First-order applicative rewrite systems provide a natural framework for modeling higher-order aspects. In this article we present a transformation from untyped applicative term rewrite systems to functional term rewrite systems that preserves and ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Automated Reasoning

Journal of Automated Reasoning Volume 58, Issue 1

January 2017

201 pages

ISSN:0168-7433

Issue’s Table of Contents

Copyright © Copyright © 2017 Springer Science+Business Media Dordrecht.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 2017

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Payet É(2024)Non-termination in Term Rewriting and Logic ProgrammingJournal of Automated Reasoning10.1007/s10817-023-09693-z68:1Online publication date: 2-Feb-2024
https://dl.acm.org/doi/10.1007/s10817-023-09693-z
Lefaucheux EOuaknine JPurser DWorrell J(2024)Porous invariants for linear systemsFormal Methods in System Design10.1007/s10703-024-00444-363:1-3(235-271)Online publication date: 1-Oct-2024
https://dl.acm.org/doi/10.1007/s10703-024-00444-3
Kassing JDollase SGiesl J(2024)A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term RewritingFunctional and Logic Programming10.1007/978-981-97-2300-3_4(62-80)Online publication date: 15-May-2024
https://dl.acm.org/doi/10.1007/978-981-97-2300-3_4
Promies VÁbrahám E(2024)A Divide-and-Conquer Approach to Variable Elimination in Linear Real ArithmeticFormal Methods10.1007/978-3-031-71162-6_7(131-148)Online publication date: 9-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71162-6_7
Guo LKop C(2024)Higher-Order LCTRSs and Their TerminationProgramming Languages and Systems10.1007/978-3-031-57267-8_13(331-357)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57267-8_13
Feng NHu ABayless SIqbal STrentin PWhalen MPike LBackes J(2024)DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic TheoriesTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57246-3_1(3-23)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57246-3_1
Kassing JFrohn FGiesl J(2024)From Innermost to Full Almost-Sure Termination of Probabilistic Term RewritingFoundations of Software Science and Computation Structures10.1007/978-3-031-57231-9_10(206-228)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57231-9_10
Jia FHan RHuang PLiu MMa FZhang JJust RFraser G(2023)Improving Bit-Blasting for Nonlinear Integer ConstraintsProceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3597926.3598034(14-25)Online publication date: 12-Jul-2023
https://dl.acm.org/doi/10.1145/3597926.3598034
Unno HTerauchi TGu YKoskinen E(2023)Modular Primal-Dual Fixpoint Logic Solving for Temporal VerificationProceedings of the ACM on Programming Languages10.1145/35712657:POPL(2111-2140)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571265
Gu YTsukada TUnno H(2023)Optimal CHC Solving via Termination ProofsProceedings of the ACM on Programming Languages10.1145/35712147:POPL(604-631)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571214
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents