On the Expressiveness of some Runtime Validation Techniques

12 pages•Published: February 12, 2014

Yliès Falcone, Jean-Claude Fernandez and Mounier Laurent

Abstract

Runtime validation techniques have been proposed as artifacts to detect and/or correct unforeseen behaviours of computer systems.
Their common features is to give only partial validation results, based on a restricted set of system executions produced in the real execution environment. A key issue is thus to better understand which kind of properties can (or cannot) be validated using such techniques.

We focus on three techniques known as runtime verification, property-oriented testing, and runtime enforcement. We present these approaches at an abstract level and in a unified framework, and we discuss their respective ability to deal with properties on infinite execution sequences, that are commonly encountered in many application domains.

In: Andrei Voronkov and Margarita Korovina (editors). HOWARD-60. A Festschrift on the Occasion of Howard Barringer's 60th Birthday, vol 42, pages 112-123.

Links:	https://easychair.org/publications/paper/mCk
	https://doi.org/10.29007/j7qv

BibTeX entry

@inproceedings{HOWARD-60:Expressiveness_some_Runtime_Validation,
  author    = {Yliès Falcone and Jean-Claude Fernandez and Mounier Laurent},
  title     = {On the Expressiveness of some Runtime Validation Techniques},
  booktitle = {HOWARD-60. A Festschrift on the Occasion of Howard Barringer's 60th Birthday},
  editor    = {Andrei Voronkov and Margarita Korovina},
  series    = {EPiC Series in Computing},
  volume    = {42},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/mCk},
  doi       = {10.29007/j7qv},
  pages     = {112-123},
  year      = {2014}}

Download PDF Open PDF in browser