Model checking invariant properties of designs, represented as transition systems, with non-linear real arithmetic (NRA), is an important though very hard problem. On the one hand NRA is a hard-to-solve theory; on the other hand most of the powerful model checking techniques lack support for NRA. In this paper, we present a counterexample-guided abstraction refinement (CEGAR) approach that leverages linearization techniques from differential calculus to enable the use of mature and efficient model checking algorithms for transition systems on linear real arithmetic (LRA) with uninterpreted functions (EUF). The results of an empirical evaluation confirm the validity and potential of this approach.
CITATION STYLE
Cimatti, A., Griggio, A., Irfan, A., Roveri, M., & Sebastiani, R. (2017). Invariant checking of NRA transition systems via incremental reduction to LRA with EUF. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10205 LNCS, pp. 58–75). Springer Verlag. https://doi.org/10.1007/978-3-662-54577-5_4
Mendeley helps you to discover research relevant for your work.