Runtime Verification Through Forward Chaining
Perotti, A., Boella, G. & Garcez, A. (2014). Runtime Verification Through Forward Chaining. Electronic Proceedings in Theoretical Computer Science, 169, pp. 68-81. doi: 10.4204/eptcs.169.8
Abstract
In this paper we present a novel rule-based approach for Runtime Verification of FLTL properties over finite but expanding traces. Our system exploits Horn clauses in implication form and relies on a forward chaining-based monitoring algorithm. This approach avoids the branching structure and exponential complexity typical of tableaux-based formulations, creating monitors with a single state and a fixed number of rules. This allows for a fast and scalable tool for Runtime Verification: we present the technical details together with a working implementation.
| Publication Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Departments: | School of Science & Technology > Computer Science |
| Related URLs: | |
| SWORD Depositor: |
Download (565kB) | Preview
Export
Downloads
Downloads per month over past year
Metadata
MetadataActions (login required)
Admin Login