AProVE: Termination and Memory Safety of C Programs

(Competition Contribution)
  • Thomas Ströder
  • Cornelius Aschermann
  • Florian Frohn
  • Jera Hensel
  • Jürgen Giesl
Conference paper

DOI: 10.1007/978-3-662-46681-0_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9035)
Cite this paper as:
Ströder T., Aschermann C., Frohn F., Hensel J., Giesl J. (2015) AProVE: Termination and Memory Safety of C Programs. In: Baier C., Tinelli C. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2015. Lecture Notes in Computer Science, vol 9035. Springer, Berlin, Heidelberg

Abstract

AProVE is a system for automatic termination and complexity proofs of C, Java, Haskell, Prolog, and term rewrite systems. The particular strength of AProVE when analyzing C is its capability to reason about pointer arithmetic combined with direct memory accesses (as, e.g., in standard implementations of string algorithms). As a prerequisite for termination, AProVE also proves memory safety of C programs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Thomas Ströder
    • 1
  • Cornelius Aschermann
    • 1
  • Florian Frohn
    • 1
  • Jera Hensel
    • 1
  • Jürgen Giesl
    • 1
  1. 1.RWTH Aachen UniversityAachenGermany

Personalised recommendations