2022
DOI: 10.1007/978-3-031-10769-6_41
|View full text |Cite
|
Sign up to set email alerts
|

Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)

Abstract: We present the Loop Acceleration Tool (), a powerful tool for proving non-termination and worst-case lower bounds for programs operating on integers. It is based on the novel calculus from [10, 11] for loop acceleration, i.e., transforming loops into non-deterministic straight-line code, and for finding non-terminating configurations. To implement it efficiently, uses a new approach based on unsat cores. We evaluate ’s power and performance by extensive experiments.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…For LIA-nonlin track we used only spacer engine; the other engines cannot handle nonlinear system yet.$ golem --engine spacer For LIA-lin track, we used a trivial portfolio of lawi, spacer and tpa (in split-tpa mode) running independently. The Loop Acceleration Tool (LoAT)[18] is based on Acceleration Driven Clause Learning (ADCL)[19], a novel calculus for analyzing satisfiability of CHCs. LoAT's implementation of ADCL is based on a calculus for modular loop acceleration[17].…”
mentioning
confidence: 99%
“…For LIA-nonlin track we used only spacer engine; the other engines cannot handle nonlinear system yet.$ golem --engine spacer For LIA-lin track, we used a trivial portfolio of lawi, spacer and tpa (in split-tpa mode) running independently. The Loop Acceleration Tool (LoAT)[18] is based on Acceleration Driven Clause Learning (ADCL)[19], a novel calculus for analyzing satisfiability of CHCs. LoAT's implementation of ADCL is based on a calculus for modular loop acceleration[17].…”
mentioning
confidence: 99%