Abstracting Path Conditions for Effective Symbolic Execution

TL;DR

This paper introduces an algorithm that enhances symbolic execution tools by generating necessary path conditions, effectively narrowing the search space to improve code coverage in test generation.

Contribution

The paper proposes a novel algorithm for symbolic execution that aids in covering unreachable code segments by providing necessary path conditions, with experimental validation.

Findings

Algorithm significantly improves code coverage in symbolic execution.

Integration into existing tools shows promising results.

Potential to reduce test generation time and increase effectiveness.

Abstract

We present an algorithm for tests generation tools based on symbolic execution. The algorithm is supposed to help in situations, when a tool is repeatedly failing to cover some code by tests. The algorithm then provides the tool a necessary condition strongly narrowing space of program paths, which must be checked for reaching the uncovered code. We also discuss integration of the algorithm into the tools and we provide experimental results showing a potential of the algorithm to be valuable in the tools, when properly implemented there.