Extending Attack-Fault Trees with Runtime Verification

Rafael C. Cardoso
(University of Aberdeen)
Angelo Ferrando
(University of Genova)
Michael Fisher
(The University of Manchester)

Autonomous systems are often complex and prone to software failures and cyber-attacks. We introduce RVAFTs, an extension of Attack-Fault Trees (AFTs) with runtime events that can be used to construct runtime monitors. These monitors are able to detect when failures, that can be caused either by an attack or by a fault, occur. The safety and security properties monitored are, in turn, derived from the hierarchical decomposition of RVAFTs. Our approach not only provides further use of AFTs, but also improves the process of instrumentation often required in runtime verification. We explain the principles and provide a simple case study demonstrating how RVAFTs can be used in practice. Through this we are also able to evaluate the detection of faults and attacks as well as assessing the computational overhead of the monitors.

In Matt Luckcuck and Marie Farrell: Proceedings Fourth International Workshop on Formal Methods for Autonomous Systems (FMAS) and Fourth International Workshop on Automated and verifiable Software sYstem DEvelopment (ASYDE) (FMAS2022 ASYDE2022), Berlin, Germany, 26th and 27th of September 2022, Electronic Proceedings in Theoretical Computer Science 371, pp. 193–207.
Published: 27th September 2022.

ArXived at: https://dx.doi.org/10.4204/EPTCS.371.14 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org