Download PDFOpen PDF in browser

From Parametric Trace Slicing to Rule Systems

EasyChair Preprint no. 521

20 pagesDate: September 23, 2018


Parametric runtime verification is the process of verifying properties of execution traces of (data-carrying) events produced by a running system. This paper continues our work exploring the relationship between specification techniques for parametric runtime verification. Here we consider the correspondence between trace-slicing automata-based approaches and rule-systems. The main contribution is a translation from quantified automata to rule-systems, which has been implemented in SCALA. This then allows us to highlight the key differences in how the two formalisms handle data, an important step in our wider effort to understand the correspondence between different specification languages for parametric runtime verification.

Keyphrases: quantified event automata, rule systems, runtime monitoring, runtime verification

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Giles Reger and David Rydeheard},
  title = {From Parametric Trace Slicing to Rule Systems},
  howpublished = {EasyChair Preprint no. 521},
  doi = {10.29007/pplf},
  year = {EasyChair, 2018}}
Download PDFOpen PDF in browser