Automatic bug fixing: Difference between revisions

Revision as of 01:51, 6 October 2016

Revision as of 01:53, 6 October 2016

Line 357:

Another way to generate candidate patches is to use solvers for

[[satisfiability modulo theories]] (SMT). Solver-based techniques convert a

program into SMT formulas. andThey queriesthen query SMT solvers to solve the converted SMT formulas to find candidate patches

that allow the patched program to pass all supplied test cases<ref name=semfix/><ref name=angelix/>.

The benefit of this approach is that SMT solvers can quickly find patches passing test cases