We present a technique to automatically generate search heuristics for concolic testing. A
key challenge in concolic testing is how to effectively explore the program's execution paths …

We present template-guided concolic testing, a new technique for effectively reducing the
search space in concolic testing. Addressing the path-explosion problem has been a …

We present Chameleon, a new approach for adaptively changing search heuristics during
concolic testing. Search heuristics play a central role in concolic testing as they mitigate the …

Concolic testing has been very successful in automatically generating test inputs for
programs. However one of its major limitations is path-explosion that limits the generation of …

One of the biggest challenges in concolic testing, an automatic test generation technique, is
its huge search space. Concolic testing generates next inputs by selecting branches from …

We present hybrid concolic testing, an algorithm that interleaves random testing with
concolic execution to obtain both a deep and a wide exploration of program state space. Our …

Concolic testing integrates concrete execution (eg, random testing) and symbolic execution
for test case generation. It is shown to be more cost-effective than random testing or …

For software testing, concolic testing reasons about data symbolically but enumerates
program paths. The existing concolic technique enumerates paths sequentially, leading to …

Concolic testing is an effective but expensive program analysis technology widely used for
detecting software vulnerabilities. In this approach, search heuristics play a key role in …

Current industrial testing practices often generate test cases in a manual manner, which
degrades both the effectiveness and efficiency of testing. To alleviate this problem, concolic …