Linköping University: Students Alumni Trade and Industry/Society Internal Search

Time-Constraint-Aware Optimization of Assertions in Embedded Software

Viacheslav Izosimov
G. Di Guglielmo
M. Lora
G. Pravadelli
F. Fummi
Zebo Peng Author homepage
M. Fujita

Journal of Electronic Testing; Theory and Applications (JETTA), Vol. 28, No. 4, Aug. 2012.

Technology shrinking and sensitization have led to more andmore transient faults in embedded systems. Transient faults are intermittent and non-predictable faults caused by external events, such as energetic particles striking the circuits. These faults do not cause permanent damages, but may affect the running applications. One way to ensure the correct execution of these embedded applications is to keep debugging and testing even after shipping of the systems, complemented with recovery/restart options. In this context, the executable assertions that have been widely used in the development process for design validation can be deployed again in the final product. In this way, the application will use the assertion to monitor itself under the actual execution and will not allow erroneous out-of-the-specification behavior to manifest themselves. This kind of software-level fault tolerance may represent a viable solution to the problem of developing commercial off-the-shelf embedded systems with dependability requirements. But software-level fault tolerance comes at a computational cost, which may affect time-constrained applications. Thus, the executable assertions shall be introduced at the best possible points in the application code, in order to satisfy timing constraints, and to maximize the error detection efficiency. We present an approach for optimization of executable assertion placement in time-constrained embedded applications for the detection of transient faults. In this work, assertions have different characteristics such as tightness, i.e., error coverage, and performance degradation. Taking into account these properties, we have developed an optimization methodology, which identifies candidate locations for assertions and selects a set of optimal assertions with the highest tightness at the lowest performance degradation. The set of selected assertions is guaranteed to respect the real-time deadlines of the embedded application. Experimental results have shown the effectiveness of the proposed approach, which provides the designer with a flexible infrastructure for the analysis of time-constrained embedded applications and transient-fault-oriented executable assertions.

Related files:
viaiz_JETTA12.pdfAdobe Acrobat portable document

[IDLP12] Viacheslav Izosimov, G. Di Guglielmo, M. Lora, G. Pravadelli, F. Fummi, Zebo Peng, M. Fujita, "Time-Constraint-Aware Optimization of Assertions in Embedded Software", Journal of Electronic Testing; Theory and Applications (JETTA), Vol. 28, No. 4, Aug. 2012.
( ! ) perl script by Giovanni Squillero with modifications from Gert Jervan   (v3.1, p5.2, September-2002-)