Proving Non-Termination by Acceleration Driven Clause Learning

04/20/2023
by   Florian Frohn, et al.
0

We recently proposed Acceleration Driven Clause Learning (ADCL), a novel calculus to analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL to transition systems and introduce ADCL-NT, a variant for disproving termination. We implemented ADCL-NT in our tool LoAT and evaluate it against the state of the art.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
03/03/2023

ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses

Constrained Horn Clauses (CHCs) are often used in automated program veri...
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
11/29/2022

Branch-Well-Structured Transition Systems and Extensions

We propose a relaxation to the definition of a well-structured transitio...
research
01/06/2020

A Calculus for Modular Loop Acceleration

Loop acceleration can be used to prove safety, reachability, runtime bou...
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/12/2023

SCL(FOL) Revisited

This paper presents an up-to-date and refined version of the SCL calculu...

Please sign up or login with your details

Forgot password? Click here to reset