Optimal algorithmic debugging and reduced coverage using search in structured domains

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

doi:10.1007/11678779_11

Optimal algorithmic debugging and reduced coverage using search in structured domains

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers
Pages	149-157
Number of pages	9
DOIs	https://doi.org/10.1007/11678779_11
State	Published - 2006
Event	1st International Haifa Verification Conference on Hardware and Software, Verification and Testing - Haifa, Israel Duration: 13 Nov 2005 → 16 Nov 2005

Publication series

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

Conference

Conference	1st International Haifa Verification Conference on Hardware and Software, Verification and Testing
Country/Territory	Israel
City	Haifa
Period	13/11/05 → 16/11/05

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11678779_11

Cite this

Ben-Asher, Y., Breger, I., Farchi, E., & Gordon, I. (2006). Optimal algorithmic debugging and reduced coverage using search in structured domains. In Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers (pp. 149-157). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3875 LNCS). https://doi.org/10.1007/11678779_11

Ben-Asher, Yosi ; Breger, Igor ; Farchi, Eitan et al. / Optimal algorithmic debugging and reduced coverage using search in structured domains. Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers. 2006. pp. 149-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{294c1e8d980641e1984e7e4e02b03110,

title = "Optimal algorithmic debugging and reduced coverage using search in structured domains",

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

author = "Yosi Ben-Asher and Igor Breger and Eitan Farchi and Ilia Gordon",

year = "2006",

doi = "10.1007/11678779_11",

language = "English",

isbn = "3540326049",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "149--157",

booktitle = "Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers",

note = "1st International Haifa Verification Conference on Hardware and Software, Verification and Testing ; Conference date: 13-11-2005 Through 16-11-2005",

}

Ben-Asher, Y, Breger, I, Farchi, E & Gordon, I 2006, Optimal algorithmic debugging and reduced coverage using search in structured domains. in Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3875 LNCS, pp. 149-157, 1st International Haifa Verification Conference on Hardware and Software, Verification and Testing, Haifa, Israel, 13/11/05. https://doi.org/10.1007/11678779_11

Optimal algorithmic debugging and reduced coverage using search in structured domains. / Ben-Asher, Yosi; Breger, Igor; Farchi, Eitan et al.
Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers. 2006. p. 149-157 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3875 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal algorithmic debugging and reduced coverage using search in structured domains

AU - Ben-Asher, Yosi

AU - Breger, Igor

AU - Farchi, Eitan

AU - Gordon, Ilia

PY - 2006

Y1 - 2006

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

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

UR - http://www.scopus.com/inward/record.url?scp=33745520351&partnerID=8YFLogxK

U2 - 10.1007/11678779_11

DO - 10.1007/11678779_11

M3 - Conference contribution

AN - SCOPUS:33745520351

SN - 3540326049

SN - 9783540326045

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 149

EP - 157

BT - Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers

T2 - 1st International Haifa Verification Conference on Hardware and Software, Verification and Testing

Y2 - 13 November 2005 through 16 November 2005

ER -

Ben-Asher Y, Breger I, Farchi E, Gordon I. Optimal algorithmic debugging and reduced coverage using search in structured domains. In Hardware and Software, Verification and Testing - First International Haifa Verification Conference, Revised Selected Papers. 2006. p. 149-157. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11678779_11

Optimal algorithmic debugging and reduced coverage using search in structured domains

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this