Runtime Verification Through Forward Chaining
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 expone...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2014-12-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1412.1156v1 |
| _version_ | 1818839696611999744 |
|---|---|
| author | Alan Perotti Guido Boella Artur d'Avila Garcez |
| author_facet | Alan Perotti Guido Boella Artur d'Avila Garcez |
| author_sort | Alan Perotti |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-19T03:58:24Z |
| format | Article |
| id | doaj.art-053aecfb386c42358339330038c91ed9 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-19T03:58:24Z |
| publishDate | 2014-12-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-053aecfb386c42358339330038c91ed92022-12-21T20:36:45ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802014-12-01169Proc. HCVS 2014688110.4204/EPTCS.169.8:3Runtime Verification Through Forward ChainingAlan Perotti0Guido Boella1Artur d'Avila Garcez2 University of Turin, Italy University of Turin, Italy City University London, UK 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.http://arxiv.org/pdf/1412.1156v1 |
| spellingShingle | Alan Perotti Guido Boella Artur d'Avila Garcez Runtime Verification Through Forward Chaining Electronic Proceedings in Theoretical Computer Science |
| title | Runtime Verification Through Forward Chaining |
| title_full | Runtime Verification Through Forward Chaining |
| title_fullStr | Runtime Verification Through Forward Chaining |
| title_full_unstemmed | Runtime Verification Through Forward Chaining |
| title_short | Runtime Verification Through Forward Chaining |
| title_sort | runtime verification through forward chaining |
| url | http://arxiv.org/pdf/1412.1156v1 |
| work_keys_str_mv | AT alanperotti runtimeverificationthroughforwardchaining AT guidoboella runtimeverificationthroughforwardchaining AT arturdavilagarcez runtimeverificationthroughforwardchaining |