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...
share
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/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
∙
11/27/2021
A Calculus for Modular Loop Acceleration and Non-Termination Proofs
Loop acceleration can be used to prove safety, reachability, runtime bou...
research
∙
01/06/2020
A Calculus for Modular Loop Acceleration
Loop acceleration can be used to prove safety, reachability, runtime bou...
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/21/2019