loading...
BINTEST - Binary Search-based Test Case Generation
Dallas, Texas November 03-November 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2003.124531827th Annual International Computer So ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sami Beydeda, University of Leipzig, Germany
Volker Gruhn, University of Leipzig, Germany
One of the important tasks during software testing is the generation of test cases. Various approaches have been proposed to automate this task. The approaches available, however, often have problems limiting their use. A problem of dynamic test case generation approaches, for instance, is that a large number of iterations can be necessary to obtain test cases. This article proposes a novel algorithm for path-oriented test case generation based on binary search and describes a possible implementation.
Citation:
Sami Beydeda, Volker Gruhn, "BINTEST - Binary Search-based Test Case Generation," compsac, pp.28, 27th Annual International Computer Software and Applications Conference, 2003
Usage of this product signifies your acceptance of the Terms of Use.