Optimal algorithmic debugging and reduced coverage using search in structured domains

Authors:
Yosi Ben-Asher;Igor Breger;Eitan Farchi;Ilia Gordon
Affiliations:
Comp. Sci. Dep. Haifa University, Haifa, Israel;Comp. Sci. Dep. Haifa University, Haifa, Israel;I.B.M. Research Center, Haifa, Israel;Comp. Sci. Dep. Haifa University, Haifa, Israel
Venue:
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
Year:
2005

Citing 7
Cited 0

Axiomatizing software test data adequacy

IEEE Transactions on Software Engineering
The evaluation of program-based software test data adequacy criteria

Communications of the ACM
Generalized algorithmic debugging and testing

ACM Letters on Programming Languages and Systems (LOPLAS)
Using assertions in declarative and operational models for automated debugging

Journal of Systems and Software
Optimal search in trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Isolating failure-inducing thread schedules

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Interprocedural Dynamic Slicing Applied to Interprocedural Data How Testing

ICSM '93 Proceedings of the Conference on Software Maintenance

Quantified Score

Hi-index	0.00

Visualization

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.