Efficient Symbolic Execution of Software under Fault Attacks
We propose a symbolic execution method for analyzing the safety of software under fault attacks both accurately and efficiently. Fault attacks leverage physically injected hardware faults in an embedded system to break the safety of a software program. While there are existing methods for analyzing the impact of maliciously injected hardware faults on software, they suffer from inaccurate fault modeling and inefficient fault analysis. To overcome these limitations, we propose two novel techniques. First, we propose a fault modeling technique that leverages automated program transformation to add symbolic variables to the program, to accurately model the new program behavior induced by faults. This fault modeling approach has two advantages: the fault-induced program behavior is closely related to what attackers exploit in practice and the transformed program may be analyzed by any downstream fault analysis algorithm. Second, we propose an efficient symbolic execution algorithm designed specifically for conducting fault analysis on the transformed program. It leverages redundancy removal techniques to mitigate path explosion, which is the main performance bottleneck of symbolic execution and is exacerbated by the additional fault-induced program behavior. We have implemented the proposed method and evaluated it on a variety of benchmark programs. The experimental results show that our method significantly outperforms the state-of-the-art techniques. Specifically, our method not only drastically reduces the overall running time of symbolic execution but also retains its error detection capabilities. Compared to the current state-of-the-art, it is able to reveal many previously-missed safety violations. Furthermore, compared to the baseline algorithm, our optimized symbolic execution algorithm can be orders-of-magnitude faster.