Please use this identifier to cite or link to this item:
|Title:||Heuristic search with reachability tests for automated generation of test programs||Authors:||Leow, W.K.
|Issue Date:||2004||Citation:||Leow, W.K.,Khoo, S.C.,Loh, T.H.,Suhendra, V. (2004). Heuristic search with reachability tests for automated generation of test programs. Proceedings - 19th International Conference on Automated Software Engineering, ASE 2004 : 282-285. ScholarBank@NUS Repository.||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  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. © 2004 IEEE.||Source Title:||Proceedings - 19th International Conference on Automated Software Engineering, ASE 2004||URI:||http://scholarbank.nus.edu.sg/handle/10635/41458||ISBN:||0769521312|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.