DocumentCode :
2829025
Title :
AICTO: an improved algorithm for planning inter-class test order
Author :
Mao, Chengying ; Lu, Yansheng
Author_Institution :
Coll. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., China
fYear :
2005
fDate :
21-23 Sept. 2005
Firstpage :
927
Lastpage :
931
Abstract :
Determining inter-class test order is one of the most difficult tasks in cluster level testing. This paper proposes the concept of weighted object relation diagram (WORD) by extending the traditional object relation diagram (ORD). When generating the inter-class test order based on WORD, minimizing the number of realistic stubs (not the number of classes to be stubbed) is regarded as optimization objective. Some heuristic rules, such as association intensity, cycling weight and direction factors of edges, are used as important criteria to cut association edges to break cycles. An improved algorithm AICTO is presented via analyzing some principles of the existing methods and overcoming some of their drawbacks. This algorithm has some merits such as the fewer number of classes to be stubbed, holding the association edges with higher RD and excellent stability. In practice, the algorithm AICTO has been applied to our C/C++ program testing prototype CppTest and produces favorable effects.
Keywords :
object-oriented programming; program testing; software prototyping; C; C++; CppTest; association intensity; cluster level testing; heuristic rules; inter-class test order; optimization objective; program testing prototype; weighted object relation diagram; Algorithm design and analysis; Clustering algorithms; Computer science; Educational institutions; Fault detection; Information technology; Prototypes; Software testing; Sorting; Stability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on
Print_ISBN :
0-7695-2432-X
Type :
conf
DOI :
10.1109/CIT.2005.59
Filename :
1562776
Link To Document :
بازگشت