Name
Abstract | ||
|---|---|---|
When software fault injection is used, faults are typically inserted at the binary or source level. The former is fast but provides poor fault accuracy while the latter cannot scale to large code bases because the program must be rebuilt for each experiment. Alternatives that avoid rebuilding incur large run-time overheads by applying fault injection decisions at run-time. HSFI, our new design, injects faults with all context information from the source level and applies fault injection decisions efficiently on the binary. It places markers in the original code that can be recognized after code generation. We implemented a tool according to the new design and evaluated the time taken per fault injection experiment when using operating systems as targets. We can perform experiments more quickly than other source-based approaches, achieving performance that come close to that of binary-level fault injection while retaining the benefits of source-level fault injection. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/DSN.2016.22 | 2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) |
Keywords | Field | DocType |
fault injection,software mutation,reliability,llvm | Stuck-at fault,General protection fault,Segmentation fault,Fault coverage,Computer science,Software fault tolerance,Code generation,Real-time computing,Fault injection,Fault model | Conference |
ISBN | Citations | PageRank |
978-1-4673-8892-4 | 3 | 0.37 |
References | Authors | |
42 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik van der Kouwe | 1 | 58 | 9.55 |
| Andrew S. Tanenbaum | 2 | 3803 | 745.87 |