JPL Technical Report Server

A Scala DSL for rete-based Runtime Verification

Show simple item record

dc.contributor.author Havelund, Klaus
dc.date.accessioned 2014-03-05T00:22:43Z
dc.date.available 2014-03-05T00:22:43Z
dc.date.issued 2013-09-24
dc.identifier.citation Fourth International Conference on Runtime Verification, Rennes, France, September 24-27, 2013 en_US
dc.identifier.clearanceno CL#13-2960
dc.identifier.uri http://hdl.handle.net/2014/44388
dc.description.abstract Runtime verification (RV) consists in part of checking execution traces against formalized specifications. Several systems have emerged, most of which support specification notations based on state machines, regular expressions, temporal logic, or grammars. The field of Artificial Intelligence (AI) has for an even longer period of time studied rule-based production systems, which at a closer look appear to be relevant for RV, although seemingly focused on slightly different application domains, such as for example business processes and expert systems. The core algorithm in many of these systems is the Rete algorithm. We have implemented a Rete-based runtime verification system, named LogFire (originally intended for offline log analysis but also applicable to online analysis), as an internal DSL in the Scala programming language, using Scala's support for defining DSLs. This combination appears attractive from a practical point of view. Our contribution is in part conceptual in arguing that such rule-based frameworks originating from AI may be suited for RV. en_US
dc.description.sponsorship NASA/JPL en_US
dc.language.iso en_US en_US
dc.publisher Pasadena, CA : Jet Propulsion Laboratory, National Aeronautics and Space Administration, 2013 en_US
dc.subject algorithmic en_US
dc.subject matching problem en_US
dc.title A Scala DSL for rete-based Runtime Verification en_US
dc.type Preprint en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account