Hi,
is there a way to run the KLEE for maximizing the branch coverage rather
than
exhaustively enumerating all the possible paths?
For example, consider the code:
if (cond1) {
// A
} else {
// B
}
if (cond2) {
// C
} else {
// D
}
there are 4 paths
1. A; C;
2. A; D;
3. B; C;
4. B; D;
but satisfying the two conditions
1. ( conv1) && ( conv2 )
2. ( !conv1 ) && ( !conv2 )
is enough to guarantee 100%-branch coverage.
Does KLEE support such an approach?
Thanks,
G.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
http://keeda.Stanford.EDU/pipermail/klee-dev/attachments/20101101/0db4b498/attachment.html
