• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Tao Qiuming, Zhao Chen, Wang Yongji. An Automated Method of Test Program Generation for Compiler Optimizations Based on Process Graph[J]. Journal of Computer Research and Development, 2009, 46(9): 1567-1577.
Citation: Tao Qiuming, Zhao Chen, Wang Yongji. An Automated Method of Test Program Generation for Compiler Optimizations Based on Process Graph[J]. Journal of Computer Research and Development, 2009, 46(9): 1567-1577.

An Automated Method of Test Program Generation for Compiler Optimizations Based on Process Graph

More Information
  • Published Date: September 14, 2009
  • Compiler is the fundamental tool for software development, and its dependability is undoubtedly significant. As an effective and efficient means to assure the quality of compilers, automatic testing has attracted much attention from academic world and industry. Optimizations are indispensable functions of modern compilers, and in recent years, the advanced optimizations which are based on data dependence analysis have become important development issues of modern compilers. To automatically test these optimizations, a method of test program generation is proposed, which can automatically generate test programs according to specified features of test program’s data dependence. The authors have designed LoSpec language for specifying test programs, realized automatic test program generation by adopting a special program model for easily representing data dependence—process graph, as the intermediate model, and developed an automated test tool, LoTester. Compared with other existing methods, this method is more effective for advanced optimizations and combined optimizations, and has a higher degree of automation. As an automatic test tool, LoTester can be used to conduct abundant testing in early development phases of optimizing compilers, which is favorable for finding bugs earlier. So far LoTester has been applied in the development of EECC, an optimizing compiler oriented at multimedia applications, and has yielded good results.
  • Related Articles

    [1]Meng Yinfeng, Liang Jiye. Linear Regularized Functional Logistic Model[J]. Journal of Computer Research and Development, 2020, 57(8): 1617-1626. DOI: 10.7544/issn1000-1239.2020.20200496
    [2]Geng Pu, Zhu Yuefei. A Code Encrypt Technique Based on Branch Condition Obfuscation[J]. Journal of Computer Research and Development, 2019, 56(10): 2183-2192. DOI: 10.7544/issn1000-1239.2019.20190368
    [3]Wang Rongquan, Ouyang Dantong, Wang Yiyuan, Liu Siguang, Zhang Liming. Solving Minimal Hitting Sets Method with SAT Based on DOEC Minimization[J]. Journal of Computer Research and Development, 2018, 55(6): 1273-1281. DOI: 10.7544/issn1000-1239.2018.20160809
    [4]Jiang Shujuan, Han Han, Shi Jiaojiao, Zhang Yanmei, Ju Xiaolin, Qian Junyan. Detecting Infeasible Paths Based on Branch Correlations Analysis[J]. Journal of Computer Research and Development, 2016, 53(5): 1072-1085. DOI: 10.7544/issn1000-1239.2016.20148031
    [5]Miao Dongjing, Liu Xianmin, Li Jianzhong. An Algorithm on Mining Approximate Functional Dependencies in Probabilistic Database[J]. Journal of Computer Research and Development, 2015, 52(12): 2857-2865. DOI: 10.7544/issn1000-1239.2015.20140685
    [6]Feng Lin, Liu Shenglan, Zhang Jing, and Wang Huibing. Robust Activation Function of Extreme Learning Machine and Linear Dimensionality Reduction in High-Dimensional Data[J]. Journal of Computer Research and Development, 2014, 51(6): 1331-1340.
    [7]Mao Chengying, Yu Xinxin, Xue Yunzhi. Algorithm Design and Empirical Analysis for Particle Swarm Optimization-Based Test Data Generation[J]. Journal of Computer Research and Development, 2014, 51(4): 824-837.
    [8]Jin Wenbing, Shi Feng, Zuo Qi, Zhang Yang. Study of Ahead Branch Prediction Architecture and Algorithm[J]. Journal of Computer Research and Development, 2013, 50(10): 2228-2238.
    [9]Zhou Lian, Wang Guojin. Piecewise Linear Approximation of Rational Triangular Surfaces[J]. Journal of Computer Research and Development, 2012, 49(5): 1116-1122.
    [10]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.

Catalog

    Article views (853) PDF downloads (763) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return