Back-to-Back Fault Injection Testing in Model-Based Development
Paper in proceeding, 2015

Today, embedded systems across industrial domains (e.g., avionics, automotive) are representatives of software-intensive systems with increasing reliance on software and growing complexity. It has become critically important to verify software in a time, resource and cost effective manner. Furthermore, industrial domains are striving to comply with the requirements of relevant safety standards. This paper proposes a novel workflow along with tool support to evaluate robustness of software in model-based development environment, assuming different abstraction levels of representing software. We then show the effectiveness of our technique, on a brake-by-wire application, by performing back-to-back fault injection testing between two different abstraction levels using MODIFI for the Simulink model and GOOFI-2 for the generated code running on the target microcontroller. Our proposed method and tool support facilitates not only verifying software during early phases of the development lifecycle but also fulfilling back-to-back testing requirements of ISO 26262 when using model-based development.

Fault-injection

Soft errors

Functional safety

Embedded systems

Model-based development

Back-to-back testing

Author

Peter Folkesson

SP Sveriges Tekniska Forskningsinstitut AB

Fatemeh Ayatolahi

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Behrooz Sangchoolie

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Jonny Vinter

SP Sveriges Tekniska Forskningsinstitut AB

Mafijul Islam

Volvo Group

Johan Karlsson

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 9337 135-148
978-3-319-24254-5 (ISBN)

Subject Categories

Computer Engineering

DOI

10.1007/978-3-319-24255-2_11

ISBN

978-3-319-24254-5

More information

Latest update

11/16/2018