Proving Termination of Programs Automatically with AProVE

  • Jürgen Giesl
  • Marc Brockschmidt
  • Fabian Emmes
  • Florian Frohn
  • Carsten Fuhs
  • Carsten Otto
  • Martin Plücker
  • Peter Schneider-Kamp
  • Thomas Ströder
  • Stephanie Swiderski
  • René Thiemann
Conference paper

DOI: 10.1007/978-3-319-08587-6_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8562)
Cite this paper as:
Giesl J. et al. (2014) Proving Termination of Programs Automatically with AProVE. In: Demri S., Kapur D., Weidenbach C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science, vol 8562. Springer, Cham

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Jürgen Giesl
    • 1
  • Marc Brockschmidt
    • 2
  • Fabian Emmes
    • 1
  • Florian Frohn
    • 1
  • Carsten Fuhs
    • 3
  • Carsten Otto
    • 6
  • Martin Plücker
    • 1
  • Peter Schneider-Kamp
    • 4
  • Thomas Ströder
    • 1
  • Stephanie Swiderski
    • 7
  • René Thiemann
    • 5
  1. 1.RWTH Aachen UniversityGermany
  2. 2.Microsoft Research CambridgeUK
  3. 3.University College LondonUK
  4. 4.University of Southern DenmarkDenmark
  5. 5.University of InnsbruckAustria
  6. 6.andrena objects AGGermany
  7. 7.Interactive Pioneers GmbHGermany

Personalised recommendations