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...

Descripción completa

Detalles Bibliográficos
Publicado en:	Communications of the ACM Vol. 59; no. 7; pp. 68 - 78
Autores principales:	ROYCHOUDHURY, ABHIK, CHANDRA, SATISH
Formato:	Artículo
Publicado:	Association for Computing Machinery Jul2016
Materias:	Debugging Root cause analysis Computer software testing Satisfiability (Computer science) Software engineering
Acceso en línea:	Ver este registro en EBSCOhost

Descripción
Sumario:	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.