BDDs on the run

Klaus Havelund, Doron Peled

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

Abstract

Runtime verification (RV) of first-order temporal logic must handle a potentially large amount of data, accumulated during the monitoring of an execution. The DejaVu RV system represents data elements and relations using BDDs. This achieves a compact representation, which allows monitoring long executions. However, the potentially unbounded, and frequently very large amounts of data values can, ultimately, limit the executions that can be monitored. We present an automatic method for “forgetting” data values when they no longer affect the RV verdict on an observed execution. We describe the algorithm and illustrate its operation through an example.

Original languageEnglish
Title of host publicationLeveraging Applications of Formal Methods, Verification and Validation. Industrial Practice - 8th International Symposium, ISoLA 2018, Proceedings
EditorsTiziana Margaria, Bernhard Steffen
PublisherSpringer Verlag
Pages58-69
Number of pages12
ISBN (Print)9783030034269
DOIs
StatePublished - 2018
Event8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018 - Limassol, Cyprus
Duration: 5 Nov 20189 Nov 2018

Publication series

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

Conference

Conference8th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, ISoLA 2018
Country/TerritoryCyprus
CityLimassol
Period5/11/189/11/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'BDDs on the run'. Together they form a unique fingerprint.

Cite this