Runtime verification is used for monitoring the execution of systems, e.g. checking sequences of reported events against formal specifications. Typically the specification refers to the individual monitored events. In this work we perceive the events as defining intervals, each defined by a begin and a subsequent end event. Allen’s logic allows assertions about the relationship between such named intervals. We suggest a formalism that extends Allen’s logic into a first-order logic that allows quantification over intervals; in addition, intervals can carry data. We provide a monitoring algorithm and describe an implementation and experiments performed with it. We furthermore describe an alternative method for monitoring properties in this logic, by translating them into first-order past-time temporal logic, monitored with the tool DejaVu.
|Title of host publication||Software Engineering and Formal Methods - 19th International Conference, SEFM 2021, Proceedings|
|Editors||Radu Calinescu, Corina S. Pasareanu|
|Publisher||Springer Science and Business Media Deutschland GmbH|
|Number of pages||18|
|State||Published - 2021|
|Event||19th International Conference on Software Engineering and Formal Methods, SEFM 2021 - Virtual Online|
Duration: 6 Dec 2021 → 10 Dec 2021
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||19th International Conference on Software Engineering and Formal Methods, SEFM 2021|
|Period||6/12/21 → 10/12/21|
Bibliographical noteFunding Information:
The research performed by the first author was carried out at Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration. The research performed by the second and third authors was partially funded by Israeli Science Foundation grant 1464/18: “Efficient Runtime Verification for Systems with Lots of Data and its Applications”.
© 2021, Springer Nature Switzerland AG.