A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic
Abstract
The Bernays-Sch\"onfinkel first-order logic fragment over simple linear real arithmetic constraints BS(SLR) is known to be decidable. We prove that BS(SLR) clause sets with both universally and existentially quantified verification conditions (conjectures) can be translated into BS(SLR) clause sets over a finite set of first-order constants. For the Horn case, we provide a Datalog hammer preserving validity and satisfiability. A toolchain from the BS(LRA) prover SPASS-SPL to the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. This is exemplified by the verification of supervisor code for a lane change assistant in a car and of an electronic control unit for a supercharged combustion engine.
Cite
@article{arxiv.2107.03189,
title = {A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic},
author = {Martin Bromberger and Irina Dragoste and Rasha Faqeh and Christof Fetzer and Markus Krötzsch and Christoph Weidenbach},
journal= {arXiv preprint arXiv:2107.03189},
year = {2021}
}
Comments
26 pages