Optimal algorithmic debugging and reduced coverage using search in structured domains

Yosi Ben-Asher, Igor Breger, Eitan Farchi, Ilia Gordon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationHardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers
Pages149-157
Number of pages9
DOIs
StatePublished - 2006
Event1st International Haifa Verification Conference on Hardware and Software, Verification and Testing - Haifa, Israel
Duration: 13 Nov 200516 Nov 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3875 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Haifa Verification Conference on Hardware and Software, Verification and Testing
Country/TerritoryIsrael
CityHaifa
Period13/11/0516/11/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Optimal algorithmic debugging and reduced coverage using search in structured domains'. Together they form a unique fingerprint.

Cite this