AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs
- First Online:
- Cite this paper as:
- Hensel J., Emrich F., Frohn F., Ströder T., Giesl J. (2017) AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs. In: Legay A., Margaria T. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2017. Lecture Notes in Computer Science, vol 10206. Springer, Berlin, Heidelberg
AProVE is a system for automatic termination and complexity analysis of C, Java, Haskell, Prolog, and several forms of rewrite systems. The new contributions in this version of AProVE are its capabilities to prove non-termination of C programs and to handle recursive C programs, even if these programs use pointer arithmetic combined with direct memory accesses. Moreover, in addition to mathematical integers, AProVE can now also handle fixed-width bitvector integers.