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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ben-Asher, Y., Farchi, E.: Compact representations of search in complex domains. International Game Theory Review 7(2), 171–188 (1997)
Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees. In: 8’th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), New Orleans (1997)
Choi, J.D., Zeller, A.: Isolating failure inducing thread schedules. In: International Symposium on Software Testing and Analysis (2002)
Clarke, L.A.: Comparison of data-flow path selection criteria. IEEE Transaction on Software Engineering (1985)
Clarke, L.A.: An investigation of data flow path selection criteria. In: Work Shop On Software Testing, Banff, Canada (1986)
Fritzson, P., et al.: Generalized algorithmic debugging and testing. ACM Letters on Programming Languages and testing 1, 303–322 (1992)
Peter, F., Mariam, K., Nahid, S.: Interprocedural dynamic slicing applied to interprocedural data flow testing. In: Proceedings of the Conference on Software Maintenance (1993)
Shahmehri, N., Kamkar, M., Fritzson, P.: Interprocedural dynamic slicing and its application to generalized algorithm debugging. In: Proceedings of the International Conference on Programming Language (1992)
Auguston, M., Fritzson, P., Shahmehri, N.: Using assertions in declarative and operational models for automated debugging. Journal of Systems and Software 25(3), 223–232 (1994)
Weyuker., E.J.: Axiomatizing software test data adequacy. IEEE Transaction on Software Engineering SE-12(12) (December 1986)
Weyuker, E.J.: The evaluation of program-based software test data adequacy criteria. Communications of the ACM 31(6) (June 1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Asher, Y., Breger, I., Farchi, E., Gordon, I. (2006). Optimal Algorithmic Debugging and Reduced Coverage Using Search in Structured Domains. In: Ur, S., Bin, E., Wolfsthal, Y. (eds) Hardware and Software, Verification and Testing. HVC 2005. Lecture Notes in Computer Science, vol 3875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11678779_11
Download citation
DOI: https://doi.org/10.1007/11678779_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32604-5
Online ISBN: 978-3-540-32605-2
eBook Packages: Computer ScienceComputer Science (R0)