Efficient runtime verification of first-order temporal properties

Klaus Havelund, Doron Peled

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Runtime verification allows monitoring the execution of a system against a temporal property, raising an alarm if the property is violated. In this paper we present a theory and system for runtime verification of a first-order past time linear temporal logic. The first-order nature of the logic allows a monitor to reason about events with data elements. While runtime verification of propositional temporal logic requires only a fixed amount of memory, the first-order variant has to deal with a number of data values potentially growing unbounded in the length of the execution trace. This requires special compactness considerations in order to allow checking very long executions. In previous work we presented an efficient use of BDDs for such first-order runtime verification, implemented in the tool DejaVu. We first summarize this previous work. Subsequently, we look at the new problem of dynamically identifying when data observed in the past are no longer needed, allowing to reclaim the data elements used to represent them. We also study the problem of adding relations over data values. Finally, we present parts of the implementation, including a new concept of user defined property macros.

Original languageEnglish
Title of host publicationModel Checking Software - 25th International Symposium, SPIN 2018, Proceedings
EditorsMaría del Gallardo, Pedro Merino
PublisherSpringer Verlag
Pages26-47
Number of pages22
ISBN (Print)9783319941103
DOIs
StatePublished - 2018
Event25th International Symposium on Model Checking Software, SPIN 2018 - Málaga, Spain
Duration: 20 Jun 201822 Jun 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10869 LNCS

Conference

Conference25th International Symposium on Model Checking Software, SPIN 2018
Country/TerritorySpain
CityMálaga
Period20/06/1822/06/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Efficient runtime verification of first-order temporal properties'. Together they form a unique fingerprint.

Cite this