go-v.orgdoi

From Parametric Trace Slicing to Rule Systems

Giles Reger, David E. Rydeheard · Lecture notes in computer science · 2018

  • DOI 10.29007/pplf
  • Publisher Springer Science+Business Media
  • Type conference-paper
  • Issued 2018

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Lecture notes in computer science · Springer Science+Business Media · conference-paper · 2018

Abstract

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.

Open the resolved locator · 10.29007/pplf

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 00:34 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://easychair.org/publications/preprint/1NMs
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.