BIROn - Birkbeck Institutional Research Online

    Proving termination of programs automatically with AProVE

    Giesl, J. and Brockschmidt, M. and Emmes, F. and Frohn, F. and Fuhs, Carsten and Otto, C. and Plücker, M. and Schneider-Kamp, P. and Ströder, T. and Swiderski, S. and Thiemann, R. (2014) Proving termination of programs automatically with AProVE. In: Demri, S. and Kapur, D. and Weidenbach, C. (eds.) Automated Reasoning. Lecture Notes In Computer Science 8562. Berlin, Germany: Springer, pp. 184-191. ISBN 9783319085869.

    IJCAR14-aprove-tool.pdf - Author's Accepted Manuscript

    Download (441kB) | Preview


    AProVE is a system for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages, AProVE automatically converts them to TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting TRSs. The generated proofs can be exported to check their correctness using automatic certifiers. For use in software construction, we present an AProVE plug-in for the popular Eclipse software development environment.


    Item Type: Book Section
    Additional Information: 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. The final publication is available at Springer via
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Carsten Fuhs
    Date Deposited: 12 Nov 2015 13:01
    Last Modified: 09 Aug 2023 12:37


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item