Abstract
Traditional code based coverage criteria for industrial programs are rarely met in practice due to the large size of the coverage list. In addition, debugging industrial programs is hard due to the large search space. A new tool, REDBUG, is introduced. REDBUG is based on an optimal search in structured domain technology. REDBUG supports a reduced coverage criterion rendering the coverage of industrial programs practical. In addition, by using an optimal search algorithm, REDBUG reduces the number of steps required to locate a bug. REDBUG also combines testing and debugging into one process. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Ben-Asher, Y., Breger, I., Farchi, E., & Gordon, I. (2006). Optimal algorithmic debugging and reduced coverage using search in structured domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3875 LNCS, pp. 149–157). https://doi.org/10.1007/11678779_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
