Formula-Based Software Debugging.
The article discusses the use of satisfiability modulo theory solvers in formula-based software debugging as form of computer-assisted debugging. Topics include the use of symbolic techniques to extract candidate specifications, the use of an Address Resolution Protocol (ARP) implementation, and the...
| Published in: | Communications of the ACM Vol. 59; no. 7; pp. 68 - 78 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Published: |
Association for Computing Machinery
Jul2016
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |
| Summary: | The article discusses the use of satisfiability modulo theory solvers in formula-based software debugging as form of computer-assisted debugging. Topics include the use of symbolic techniques to extract candidate specifications, the use of an Address Resolution Protocol (ARP) implementation, and the use of interpolants to find error root-causes. |
|---|