• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
He Yanxiang, Chen Yong, Wu Wei, Xu Chao, and Wu Libing. Automatically Generating Error-Traceable Test Cases Based on Compiler[J]. Journal of Computer Research and Development, 2012, 49(9): 1843-1851.
Citation: He Yanxiang, Chen Yong, Wu Wei, Xu Chao, and Wu Libing. Automatically Generating Error-Traceable Test Cases Based on Compiler[J]. Journal of Computer Research and Development, 2012, 49(9): 1843-1851.

Automatically Generating Error-Traceable Test Cases Based on Compiler

More Information
  • Published Date: September 14, 2012
  • Automatic test case generation is an important guarantee to achieve automated testing and to verify the trustness of software. After analyzing the existing methods of automatic test case generation, we propose a compiler-based error-traceable method to generate the test cases automatically. This method relies on the compiler and inserts the test requirements into the source codes properly by expanding the existing syntax and semantics of the source codes. Therefore, when the code generator generates the object codes, it can generate simultaneously the test cases according to the results of the testing requirement analysis. This method unifies the test case generation and the object code generation and brings them in the compiler. By doing this, we can avoid the overhead of information transferring interface commonly included in the situation, in which we develop a single automatic test cases generator that uses the information of another compilers analysis. At the same time, when the test case cannot pass, it is very convenient for the programmer to correct the errors of their codes because the error positions can be found quickly by the error tracking information of the source codes. Finally, a sample program illustrates the concrete process of this method and proves that the method is effective.
  • Related Articles

    [1]Wang Fang, Wang Peiqun, Zhu Chunjie. Study and Implementation of Frequent Sequences Mining Based Prefetching Algorithm[J]. Journal of Computer Research and Development, 2016, 53(2): 443-448. DOI: 10.7544/issn1000-1239.2016.20148040
    [2]Ding Zhaoyun, Jia Yan, Zhou Bin. Survey of Data Mining for Microblogs[J]. Journal of Computer Research and Development, 2014, 51(4): 691-706.
    [3]Liao Guoqiong, Wu Lingqin, Wan Changxuan. Frequent Patterns Mining over Uncertain Data Streams Based on Probability Decay Window Model[J]. Journal of Computer Research and Development, 2012, 49(5): 1105-1115.
    [4]Zhu Ranwei, Wang Peng, and Liu Majin. Algorithm Based on Counting for Mining Frequent Items over Data Stream[J]. Journal of Computer Research and Development, 2011, 48(10): 1803-1811.
    [5]Hu Wenyu, Sun Zhihui, Wu Yingjie. Study of Sampling Methods on Data Mining and Stream Mining[J]. Journal of Computer Research and Development, 2011, 48(1): 45-54.
    [6]Yang Bei, Huang Houkuan. Mining Top-K Significant Itemsets in Landmark Windows over Data Streams[J]. Journal of Computer Research and Development, 2010, 47(3): 463-473.
    [7]Liu Xuejun, Xu Hongbing, Dong Yisheng, Qian Jiangbo, Wang Yongli. Mining Frequent Closed Patterns from a Sliding Window over Data Streams[J]. Journal of Computer Research and Development, 2006, 43(10): 1738-1743.
    [8]Zhao Chuanshen, Sun Zhihui, and Zhang Jing. Frequent Subtree Mining Based on Projected Branch[J]. Journal of Computer Research and Development, 2006, 43(3): 456-462.
    [9]Liu Xuejun, Xu Hongbing, Dong Yisheng, Wang Yongli, Qian Jiangbo. Mining Frequent Patterns in Data Streams[J]. Journal of Computer Research and Development, 2005, 42(12): 2192-2198.
    [10]Wang Wei, Zhou Haofeng, Yuan Qingqing, Lou Yubo, and Sui Baile. Mining Frequent Patterns Based on Graph Theory[J]. Journal of Computer Research and Development, 2005, 42(2): 230-235.

Catalog

    Article views (808) PDF downloads (617) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return