loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Conference on Automated Software Engineering (ASE'04)
Heuristic Search with Reachability Tests for Automated Generation of Test Programs
Linz, Austria
September 20-September 24
ISBN: 0-7695-2131-2
Wee Kheng Leow, National University of Singapore
Siau Cheng Khoo, National University of Singapore
Tiong Hoe Loh, National University of Singapore
Vivy Suhendra, National University of Singapore
Our research complements the current research on automated specification-based testing by proposing a scheme that combines the setup process, test execution, and test validation into a single test program for testing the behavior of object-oriented classes. The test program can be generated automatically given the desired test cases and closed algebraic specifications of the classes. The core of the test program generator is a partial-order planner which plans the sequence of instructions required in the test program. A first-cut implementation of the planner has been presented in [Automated genera-tion of test programs from closed specifications of classes and test cases] based on simple depth-first search. This paper presents a more efficient and effective heuristic search algorithm that performs reachability tests using the Omega Calculator. Test results show that heuristic search with reachability tests significantly reduce the search time required to generate a valid sequence of instructions.
Citation:
Wee Kheng Leow, Siau Cheng Khoo, Tiong Hoe Loh, Vivy Suhendra, "Heuristic Search with Reachability Tests for Automated Generation of Test Programs," ase, pp.282-285, 19th IEEE International Conference on Automated Software Engineering (ASE'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.