Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version)

07/19/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 disprove termination of transition systems, and we evaluate its implementation in our tool LoAT against the state of the art.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2023

Proving Non-Termination by Acceleration Driven Clause Learning

We recently proposed Acceleration Driven Clause Learning (ADCL), a novel...
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
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/29/2022

Branch-Well-Structured Transition Systems and Extensions

We propose a relaxation to the definition of a well-structured transitio...
research
02/12/2023

SCL(FOL) Revisited

This paper presents an up-to-date and refined version of the SCL calculu...
research
07/26/2023

On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic

As for term rewrite systems, the dependency pair (DP, for short) framewo...

Please sign up or login with your details

Forgot password? Click here to reset