ERE Monitoring Algorithm

From FSL
Revision as of 18:24, 28 October 2008 by Fengchen (Talk | contribs)

Jump to: navigation, search

Under construction!

Regular expressions can be easily understood by ordinary software engineers and programmers, as shown by the immense interest in and the success of scripting languages like Perl, based essentially on regular expression pattern matching. We believe that regular expressions provide an elegant and powerful specification language also for monitoring requirements, because an execution trace of a program is in fact a string of states. Extended regular expressions (EREs) add complementation to regular expressions, which brings additional benefits by allowing one to specify patterns that must not occur during an execution. Complementation gives one the power to express patterns on strings non-elementarily more compactly. Generating optimal ERE monitors is highly non-trivial and the interested reader should refer to the below papers. One important observation about the use of ERE in the context of runtime verification is that ERE patterns are often used to describe buggy patterns instead of desired properties.

Publications

More information can be found in the following paper:

An Effective Algorithm for the Membership Problem for Extended Regular Expressions 
Grigore Rosu
FOSSACS'07, LNCS 4423, pp 332-345, 2007
PDF, FOSSACS'07, BIB


An Effective Algorithm for the Membership Problem for Extended Regular Expressions 
Grigore Rosu
Technical Report UIUCDCS-R-2005-2694, August 2005
PDF, Technical Report @ UIUC, BIB

Personal tools
Namespaces

Variants
Actions
Navigation