arrow
Return

Accelerated bounded model checking with LoAT

delete2026-08-01
delete0
delete
OA
AI
F
Frohn, Florian *
J
Jürgen Giesl
DOI:10.1016/j.scico.2026.103497delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
LoAT is a fully automated verification tool that can prove (un)satisfiability of linear Constrained Horn Clauses, as well as non-termination and lower bounds on the worst-case runtime complexity of transition systems. Recently, we introduced Accelerated Bounded Model Checking (ABMC), a novel model checking technique that combines acceleration techniques with Bounded Model Checking (BMC), and implemented it in LoAT. Acceleration techniques compute "shortcuts" that "compress" many execution steps into a single one, and thus ABMC is capable of finding deep counterexamples that are challenging for BMC, as finding them with BMC requires a large bound.
Keywords:
CHCs
Safety
Bounded model checking
Acceleration
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

S
Science of Computer Programming
IF:
1.4
Papers:
51
Citations:
1.6K

Organization

R
rwth aachen university
Scholars:
4.1K
Papers: 1.3K
Citations: 0
Cited Papers

Cited Papers

Bounded Model Checking
err2003-01-01
err0
PREAI
errArmin Biere; Alessandro Cimatti; Edmund M. Clarke; Ofer Strichman; Yunshan Zhu
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave