Switched up formulas in Search-Based Fuzzing

[ivancerosi]

Subchapter Branch Distances contains a table of relational operators and formulas for computing distances
for true and false branch conditions respectively.

Greater than and less than relations have switched up formulas. For example the table states that
for the case a<b the distance formula is D=b-a+1. This implies that to reduce the distance we have to lower b or increase a, while actually it is the other way around. Correct distance formula should be a-b+1.