Finding Interaction Faults Adaptively Using Distance-Based Strategies

<span>Embedded systems comprise several modules that exchange data by interacting among themselves. Exchanging wrong resource data among modules may lead to execution errors or anomalies. Interacting resources produce dependencies between two modules where any change of resources by one module affects the functionality of another module. Several investigations of the embedded system such as aerospace or automobile system show interaction faults between modules are one of the major cause of critical software failures. Therefore, interaction testing is an essential phase to reduce the interaction faults and minimize the risk. The direct and indirect interaction between modules generates interaction faults where indirect interaction is made underneath the interface in which data dependence relationship with resources may cause a different outcome. We investigate errors based on the indirect interaction between modules and introduce a new test criterion for finding errors detectable by existing approaches in unit level but not in integration level. In this paper, we propose a noble approach to generate an interaction model using indirect interaction pattern and design test criteria based on different interaction errors to generate test cases. Finally, we use fault injection and data flow coverage techniques to evaluate the feasibility and effectiveness of our approach</span>

Download Full-text

Locating and detecting arrays for interaction faults

Journal of Combinatorial Optimization ◽

10.1007/s10878-007-9082-4 ◽

2007 ◽

Vol 15 (1) ◽

pp. 17-48 ◽

Cited By ~ 60

Author(s):

Charles J. Colbourn ◽

Daniel W. McClary

Keyword(s):

Detecting Arrays ◽

Interaction Faults

Download Full-text

Locating Arrays with Mixed Alphabet Sizes

Mathematics ◽

10.3390/math8050831 ◽

2020 ◽

Vol 8 (5) ◽

pp. 831

Author(s):

Ce Shi ◽

Hao Jin ◽

Tatsuhiro Tsuchiya

Keyword(s):

Lower Bound ◽

Real Life ◽

Single Fault ◽

Interaction Faults ◽

Recursive Constructions ◽

Level 1 ◽

Locating Arrays

Locating arrays (LAs) can be used to detect and identify interaction faults among factors in a component-based system. The optimality and constructions of LAs with a single fault have been investigated extensively under the assumption that all the factors have the same values. However, in real life, different factors in a system have different numbers of possible values. Thus, it is necessary for LAs to satisfy such requirements. We herein establish a general lower bound on the size of mixed-level ( 1 ¯ , t ) -locating arrays. Some methods for constructing LAs including direct and recursive constructions are provided. In particular, constructions that produce optimal LAs satisfying the lower bound are described. Additionally, some series of optimal LAs satisfying the lower bound are presented.

Download Full-text