%0 Conference Proceedings %T A Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic %+ Max Planck Institute for Informatics [Saarbrücken] %+ Modeling and Verification of Distributed Algorithms and Systems (VERIDIS) %+ Technische Universität Dresden = Dresden University of Technology (TU Dresden) %A Bromberger, Martin %A Dragoste, Irina %A Faqeh, Rasha %A Fetzer, Christof %A Krötzsch, Markus %A Weidenbach, Christoph %Z This work was funded by DFG grant 389792660 as part of TRR 248 (CPEC), by BMBF in project ScaDS.AI, and by the Center for Advancing Electronics Dresden (cfaed). %< avec comité de lecture %B FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems %C Birmingham, United Kingdom %I Springer International Publishing %3 Lecture Notes in Computer Science %V 12941 %P 3-24 %8 2021-09-08 %D 2021 %R 10.1007/978-3-030-86205-3_1 %Z Computer Science [cs]Conference papers %X 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. %G English %L hal-03531889 %U https://inria.hal.science/hal-03531889 %~ CNRS %~ INRIA %~ INRIA_TEST %~ INRIA-LORRAINE %~ LORIA2 %~ INRIA-NANCY-GRAND-EST %~ TESTALAIN1 %~ UNIV-LORRAINE %~ INRIA2 %~ LORIA %~ LORIA-FM %~ INRIA-ALLEMAGNE