2000 character limit reached
Proving Non-Termination by Acceleration Driven Clause Learning (Short WST Version)
Published 19 Jul 2023 in cs.LO | (2307.09839v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
