NobleBlocks
Public

Efficient parametric runtime verification with deterministic string rewriting

Published • Nov 1, 2013
NobleIDNI4P90W77R33S72
Authors:
Patrick Meredith
,
Grigore Roşu

Abstract

Early efforts in runtime verification show that parametric regular and temporal logic specifications can be monitored efficiently. These approaches, however, have limited expressiveness: their specifications always reduce to monitors with finite state. More recent developments showed that parametric...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!