research
∙
09/01/2023
Improving Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
Recently, we adapted the well-known dependency pair (DP) framework to a ...
share
research
∙
07/20/2023
Automated Termination Proofs for C Programs with Lists (Short WST Version)
There are many techniques and tools for termination of C programs, but u...
research
∙
07/19/2023
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
There exist several results on deciding termination and computing runtim...
research
∙
07/19/2023
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
Dependency pairs are one of the most powerful techniques to analyze term...
research
∙
07/19/2023
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version)
We recently proposed Acceleration Driven Clause Learning (ADCL), a novel...
research
∙
07/13/2023
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
We present a new procedure to infer size bounds for integer programs aut...
research
∙
05/20/2023
Proving Termination of C Programs with Lists
There are many techniques and tools to prove termination of C programs, ...
research
∙
05/19/2023
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Dependency pairs are one of the most powerful techniques to analyze term...
research
∙
04/20/2023
Proving Non-Termination by Acceleration Driven Clause Learning
We recently proposed Acceleration Driven Clause Learning (ADCL), a novel...
research
∙
03/03/2023
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
Constrained Horn Clauses (CHCs) are often used in automated program veri...
research
∙
02/05/2023
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
Termination analysis of C programs is a challenging task. On the one han...
research
∙
05/18/2022
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
There exist several results on deciding termination and computing runtim...
research
∙
02/09/2022
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
We present the new version of the Loop Acceleration Tool (LoAT), a power...
research
∙
02/03/2022
Improving Automatic Complexity Analysis of Integer Programs
In earlier work, we developed an approach for automatic complexity analy...
research
∙
10/13/2020
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
We present a novel modular approach to infer upper bounds on the expecte...
research
∙
11/04/2019
Inferring Lower Runtime Bounds for Integer Programs
We present a technique to infer lower bounds on the worst-case runtime c...
research
∙
10/25/2019
On the Decidability of Termination for Polynomial Loops
We consider the termination problem for triangular weakly non-linear loo...
research
∙
05/27/2019
Proving Non-Termination via Loop Acceleration
We present the first approach to prove non-termination of integer progra...
research
∙
05/23/2019
Computing Expected Runtimes for Constant Probability Programs
We introduce the class of constant probability (CP) programs and show th...
research
∙
05/21/2019
Termination of Triangular Integer Loops is Decidable
We consider the problem whether termination of affine integer loops is d...
research
∙
04/01/2019
