The Community for Technology Leaders
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011) (2004)
Linz, Austria
Sept. 20, 2004 to Sept. 24, 2004
ISSN: 1068-3062
ISBN: 0-7695-2131-2
pp: 282-285
Tiong Hoe Loh , National University of Singapore
Wee Kheng Leow , National University of Singapore
Siau Cheng Khoo , National University of Singapore
Vivy Suhendra , National University of Singapore
ABSTRACT
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.
INDEX TERMS
null
CITATION
Tiong Hoe Loh, Wee Kheng Leow, Siau Cheng Khoo, Vivy Suhendra, "Heuristic Search with Reachability Tests for Automated Generation of Test Programs", 2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011), vol. 00, no. , pp. 282-285, 2004, doi:10.1109/ASE.2004.10024
82 ms
(Ver 3.3 (11022016))