Skip to main content
Conference ProceedingsOPEN ACCESS

A framework for parameterized monitorability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 10803 LNCS 203-220
DOI: 10.1007/978-3-319-89366-2_11
23Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce a general framework for Runtime Verification, parameterized with respect to a set of conditions. These conditions are encoded in the trace generated by a monitored process, which a monitor can observe. We present this parameterized framework in its general form and prove that it corresponds to a fragment of HML with recursion, extended with these conditions. We then show how this framework can be applied to a number of instantiations of the set of conditions.

Cite

CITATION STYLE

APA

Aceto, L., Achilleos, A., Francalanza, A., & Ingólfsdóttir, A. (2018). A framework for parameterized monitorability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10803 LNCS, pp. 203–220). Springer Verlag. https://doi.org/10.1007/978-3-319-89366-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free