• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
He Wei, Zhao Ruilian, and Zhu Qunxiong. Call-Graph-Based Interclass MM Path Generation[J]. Journal of Computer Research and Development, 2013, 50(2): 332-343.
Citation: He Wei, Zhao Ruilian, and Zhu Qunxiong. Call-Graph-Based Interclass MM Path Generation[J]. Journal of Computer Research and Development, 2013, 50(2): 332-343.

Call-Graph-Based Interclass MM Path Generation

More Information
  • Published Date: February 14, 2013
  • Interclass integration testing of object-oriented software is particularly hard. Method/message path (MM path) is defined as an interleaved sequence of method executions linked by messages. It presents well the interactions between the methods of object-oriented software, and hence fits for object-oriented integration testing. In this paper, a call-graph-based approach to generate interclass MM paths automatically is proposed. This approach is evaluated by two typical call graph construction algorithms, class hierarchy analysis and Anderson’s points-to analysis, on twelve benchmark programs. The result shows that our approach is practicable, and based on Anderson’s points-to analysis, 13.11% more interclass MM paths can be generated with 27.78% less time consumption than based on the class hierarchy analysis. Moreover, the structural coverage is increased by 2% and 7% with the MM-path-oriented test suites which are generated based on Anderson’s points-to analysis than based on the class hierarchy analysis. Therefore, Anderson’s points-to analysis outperforms the class hierarchy analysis for call-graph-based interclass MM path generation.
  • Related Articles

    [1]Zhou Peng, Wu Yanjun, Zhao Chen. A Programming Paradigm Combining Programmer and Neural Network to Promote Automated Program Generation[J]. Journal of Computer Research and Development, 2021, 58(3): 638-650. DOI: 10.7544/issn1000-1239.2021.20200298
    [2]Dai Wangzhou, Zhou Zhihua. A Survey on Inductive Logic Programming[J]. Journal of Computer Research and Development, 2019, 56(1): 138-154. DOI: 10.7544/issn1000-1239.2019.20180759
    [3]Chen Donghuo, Liu Quan, Jin Haidong, Zhu Fei, Wang Hui. A Temporal Logic with a Semantics Defined on the Static Structure and Dynamic Behavior of Program[J]. Journal of Computer Research and Development, 2016, 53(9): 2067-2084. DOI: 10.7544/issn1000-1239.2016.20150370
    [4]Duan Zhao, Tian Cong, Duan Zhenhua. CEGAR Based Null-Pointer Dereference Checking in C Programs[J]. Journal of Computer Research and Development, 2016, 53(1): 155-164. DOI: 10.7544/issn1000-1239.2016.20150669
    [5]Zhang Zhitian, Li Zhaopeng, Chen Yiyun, and Liu Gang. An Automatic Program Verifier for PointerC: Design and Implementation[J]. Journal of Computer Research and Development, 2013, 50(5): 1044-1054.
    [6]Chen Qiaoqiao, Li Bixin, and Ji Shunhui. A Modeling and Verification Method of CPS Based on Differential-Algebraic Dynamic Logic[J]. Journal of Computer Research and Development, 2013, 50(4): 700-710.
    [7]Wang Changjing. Verifying the Correctness of Loop Optimization Based on Extended Logic Transformation System μTS[J]. Journal of Computer Research and Development, 2012, 49(9): 1863-1873.
    [8]Ma Peijun, Wang Tiantian, and Su Xiaohong. Automatic Grading of Student Programs Based on Program Understanding[J]. Journal of Computer Research and Development, 2009, 46(7): 1136-1142.
    [9]Lin Jiao, Chen Wenguang, Li Qiang, Zheng Weimin, Zhang Yimin. A New Data Clustering Algorithm for Parallel Whole-Genome Shotgun Sequence Assembly[J]. Journal of Computer Research and Development, 2006, 43(8): 1323-1329.
    [10]Sui Aina, Wu Wei, Chen Xiaowu, Zhao Qinping. A Assembly Constraint Semantic Model in Distributed Virtual Environment[J]. Journal of Computer Research and Development, 2006, 43(3): 542-550.

Catalog

    Article views (2042) PDF downloads (546) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return