Hardware/software covalidation

Harris, Ian G.

doi:10.1049/ip-cdt:20045095

Cited by 3 publications

(1 citation statement)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many of the covalidation fault models currently applied to hardware/software designs have their origins in either the hardware or the software domains [Harris 2005]. Techniques for the formal validation of such systems are being developed [Cortés et al 2003;Edwards et al 1997;Sgroi et al 2000].…”

Section: Introductionmentioning

confidence: 99%

Coverage-directed observability-based validation for embedded software

Costa

Monteiro

2013

ACM Trans. Des. Autom. Electron. Syst.

View full text Add to dashboard Cite

Motivated by the need for validation methodologies for embedded systems we propose a method for embedded software testing that can be integrated with existing hardware methods. Existing coverage-directed validation methods guarantee the execution of a certain percentage of the program code under test. Yet they do not generally verify whether the statements executed have any influence on the program's output. In the proposed method, a program statement is considered covered not simply for belonging to the executed path, but only if its execution has influence in some observable output. The paths are generated by searching the longest path in terms of the number of statements in the path. Given that not all paths are valid, we check their feasibility using a method based on Mixed Integer Linear Programming (MILP). Variable aliasing is accounted for by representing variables by their memory addresses when building this MILP problem. In this manner, for feasible paths, we obtain immediately the input values that allow the execution of the path. Using these inputs, we determine the statements actually observed. We repeat this process until a user-specified level of coverage has been achieved. In the generation of each new path, the statement coverage obtained so far and the feasibility of previous paths is taken into account. We present results that demonstrate the effectiveness of this methodology.

show abstract