By Topic

Heuristic search with reachability tests for automated generation of test programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wee Kheng Leow ; Dept. of Comput. Sci., Singapore Nat. Univ. ; Siau Cheng Khoo ; Tiong Hoe Loh ; Suhendra, V.

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 by Leow et al. (2004) 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

Published in:

Automated Software Engineering, 2004. Proceedings. 19th International Conference on

Date of Conference:

24-24 Sept. 2004