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 …

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 …

While automated verification of imperative programs has been studied intensively, proving
termination of programs with explicit pointer arithmetic fully automatically was still an open …

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 …

In earlier work, we developed an approach for automated termination analysis of C
programs with explicit pointer arithmetic, which is based on symbolic execution. However …

We describe a novel method to automatically generate and verify memory management test
cases for unit tests, which are based on assertions extracted from safety properties typically …

In this paper we study termination of term graph rewriting, where we restrict our attention to
acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the notion …

We describe a thread-modular technique for proving termination of massively parallel GPU
kernels. The technique reduces the termination problem for these kernels to a sequential …

AProVE is a powerful termination prover for various programming languages, including a
termination analysis method for imperative programs specified in the LLVM intermediate …

Complexity theory helps us predict and control resources, usually time and space,
consumed by programs. Static analysis on specific syntactic criterion allows us to categorize …