Abstract
The Bernays-Schönfinkel 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.
Authors
- Martin Bromberger, Max Planck Institute for Informatics
- Irina Dragoste, Technische Universität Dresden
- Rasha Fageh, Technische Universität Dresden
- Christof Fetzer, Technische Universität Dresden
- Markus Krötzsch, Technische Universität Dresden
- Christoph Weidenbach, Max Planck Institute for Informatics
Conference
The 13th International Symposium on Frontiers of Combining Systems