Abstract
This paper considers a generic approach to enhance traditional runtime verification techniques towards first-order theories in order to reason about data. This allows especially for the verification of multi-threaded, object-oriented systems. It presents a general framework lifting the monitor synthesis for propositional temporal logics to a temporal logic over structures within some first-order theory. To evaluate such temporal properties, SMT solving and classical monitoring of propositional temporal properties is combined. The monitoring procedure was implemented for linear-time temporal logic (LTL) based on the Z3 SMT solver and evaluated regarding runtime performance. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Decker, N., Leucker, M., & Thoma, D. (2014). Monitoring modulo theories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 341–356). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
