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

[img]
Preview
Text - Accepted Version
Download (565kB) | Preview

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.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Informatics > Department of Computing
Related URLs:
URI: http://openaccess.city.ac.uk/id/eprint/6538

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics