There are many techniques and tools to prove termination of C programs, but up to now
these tools were not very powerful for fully automated termination proofs of programs whose …

To (dis) prove termination of C programs, AProVE uses symbolic execution to transform the
program's LLVM code into an integer transition system, which is then analyzed by several …

We present a technique to infer lower bounds on the worst-case runtime complexity of
integer programs, where in contrast to earlier work, our approach is not restricted to tail …

Termination analysis of C programs is a challenging task. On the one hand, the analysis
needs to be precise enough to draw meaningful conclusions. On the other hand, relevant …

In modern software development, vulnerability detection is crucial due to the inevitability of
bugs and vulnerabilities in complex software systems. Effective detection and elimination of …

Being able to detect program runtime complexity can help identify security vulnerabilities
such as DoS attacks and side-channel information leakage. In prior work, we use dynamic …

There are many techniques and tools for termination of C programs, but up to now they were
not very powerful for termination proofs of programs whose termination depends on …

As for term rewrite systems, the dependency pair (DP, for short) framework with several
kinds of DP processors is useful for proving termination of logically constrained term rewrite …

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

The termination behavior of a program is a crucial property when reasoning about its
correctness and safety. Non-termination and also undesired termination can lead to serious …