A static measure of a subset of intra-procedural data flow testing coverage based on node coverage
作者： Ettore M. Merlo , Giuliano Antoniol
DOI:
关键词:
摘要: In the past years, a number of research works, which have been mostly based on pre and post dominator analysis, presented about finding subsets nodes edges (called "unrestricted subsets") such that their traversal during execution (if feasible) exercises respectively all feasible in Control Flow Graph (CFG).This paper presents an approach to statically measure subset intra-procedural data flow ("all uses") coverage obtained by exercising subset" testing. This indicates possible degree testing obtainable while using weaker test criteria.The has implemented C++ PC under Linux results from analysis "Gnu find tool", is 16 KLOC C-language source code, are together with discussions conclusions.
参考文章(13)
Ravi Sethi, Jeffrey D. Ullman, Alfred V. Aho, Compilers: Principles, Techniques, and Tools ,(1986)
Boris Beizer, Software Testing Techniques ,(1983)
Rajiv Gupta, Generalized dominators and post-dominators symposium on principles of programming languages. pp. 246- 257 ,(1992) , 10.1145/143165.143216
T. Chusho, Test Data Selection and Quality Estimation Based on the Concept of Essential Branches for Path Testing IEEE Transactions on Software Engineering. ,vol. 13, pp. 509- 517 ,(1987) , 10.1109/TSE.1987.233196
Paul W. Purdom, Edward F. Moore, Immediate predominators in a directed graph [H] Communications of the ACM. ,vol. 15, pp. 777- 778 ,(1972) , 10.1145/361532.361566
D Harel, A linear algorithm for finding dominators in flow graphs and related problems Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85. pp. 185- 194 ,(1985) , 10.1145/22145.22166
Paolo Tonella, Giuliano Antoniol, Roberto Fiutem, Ettore Merlo, Flow insensitive C++ pointers and polymorphism analysis and its application to slicing international conference on software engineering. pp. 433- 443 ,(1997) , 10.1145/253228.253371
Elaine J. Weyuker, Sandra Rapps, Data flow analysis techniques for test data selection ,(2011)
Thomas Lengauer, Robert Endre Tarjan, A fast algorithm for finding dominators in a flowgraph ACM Transactions on Programming Languages and Systems. ,vol. 1, pp. 121- 141 ,(1979) , 10.1145/357062.357071
A. Bertolino, M. Marre, Automatic generation of path covers based on the control flow analysis of computer programs IEEE Transactions on Software Engineering. ,vol. 20, pp. 885- 899 ,(1994) , 10.1109/32.368137