More Web Proxy on the site http://driver.im/

Article

Free access

A static measure of a subset of intra-procedural data flow testing coverage based on node coverage

Authors:

Ettore M. Merlo,

Giuliano AntoniolAuthors Info & Claims

CASCON '99: Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research

Page 7

Published: 08 November 1999 Publication History

Abstract

In the past years, a number of research works, which have been mostly based on pre and post dominator analysis, have been presented about finding subsets of nodes and edges (called "unrestricted subsets") such that their traversal during execution (if feasible) exercises respectively all feasible nodes and edges in a Control Flow Graph (CFG).This paper presents an approach to statically measure a subset of intra-procedural data flow ("all uses") coverage obtained by exercising an "unrestricted subset" of nodes during testing. This measure indicates the possible degree of data flow testing obtainable while using a weaker test coverage criteria.The approach has been implemented in C++ on a PC under Linux and results obtained from the analysis of "Gnu find tool", which is about 16 KLOC of C-language source code, are presented together with discussions and conclusions.

References

[1]

{1} H. Agrawal. "Dominators, Super Blocks, and Program Coverage", POPL'94:Symp. on Principles of Programming Languages, 1994, pp.25-34.

Digital Library

[2]

{2} A. V. Aho, R. Sethi, and J. D. Ullman. "Compilers: Principles, Techniques, and Tools", Addison-Wesley, 1986.

Digital Library

[3]

{3} Antoniol, G., Fiutem, R., Lutteri, G., P. Tonella, P., Zanfei, S., and Merlo, E., "Program Understanding and Maintenance with the CANTO Environment", Proc. of International Conference on Software Maintenance, IEEE Computer Society Press, 1997, pp. 72-81.

Digital Library

[4]

{4} B. Beizer. "Software testing techniques, second edition", International Thomson computer press, 1990.

Digital Library

[5]

{5} A. Bertolino and M. Marré. "Automatic generation of path covers based on the control flow analysis of computer programs", IEEE Trans. Soft. Eng., dec. 1994, pp.885-898.

Digital Library

[6]

{6} T. Chusho. "Test data selection and quality estimation based on the concept of essential branches for path testing", "IEEE Trans. Soft. Eng., may 1987, pp.509-517.

Digital Library

[7]

{7} J. Ferrante, K.J Ottenstein, J.D. Warren, "The Program Dependence Graph and its Use in Optimization", ACM Transactions on Programming Languages and Systems, vol. 9, n. 3, pp. 319-349, July 1987.

Digital Library

[8]

{8} K. B. Gallagher and J. R. Lyle, "Using program slicing in software maintenance", IEEE Trans. Soft. Eng., 17(8), 1991, pp.751-761.

Digital Library

[9]

{9} R. Gupta, "Generalized dominators and postdominators", Conference record of the nineteenth ACM symp. on principles or prog. lang. (POPL'92), jan. 1992, pp.246-257.

Digital Library

[10]

{10} D. Harel, "A linear time algorithm for finding dominators in flow graphs and related problems", Proc. 17th ACM symp. on theory of computing, may 1985, pp.185-194.

Digital Library

[11]

{11} S. Lapierre, E. Merlo, G. Savard, G. Antoniol, R. Fiutem and P. Tonella. "Description of TAO test data generation system", École Polytechnique technical report, EPM/RT-97/25, aug. 1997.

[12]

{12} T. Lengauer and R. E. Tarjan, "A fast algorithm for finding dominators in a flow-graph", ACM trans. on programming lang. and syst., july 1979, pp.121-141.

Digital Library

[13]

{13} P. W. Purdom Jr. and E. F. Moore, "Immediate predominators in directed graphs", Comm. of the ACM, aug. 1972, pp.777-778.

Digital Library

[14]

{14} S. Rapps and E. Weyuker. "Data flow analysis techniques for test data selection", IEEE proc. of ICSE-6, 1982, pp.272-278.

Digital Library

[15]

{15} Tonella, P., Antoniol, G., Fiutem, R., and Merlo, E., "Flow Insensitive C++ Pointers and Polymorphism Analysis and its Applications to Slicing", Proceedings of IEEE, International Conference on Software Engineering (ICSE), IEEE Computer Society Press, May 1997, pp. 433-443.

Digital Library

Cited By

Santelices RHarrold MStirewalt KEgyed AFischer B(2007)Efficiently monitoring data-flow test coverageProceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering10.1145/1321631.1321682(343-352)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.1145/1321631.1321682
Santelices RSinha SHarrold MMayer JGupta NLedru Y(2006)Subsumption of program entities for efficient coverage and monitoringProceedings of the 3rd international workshop on Software quality assurance10.1145/1188895.1188899(2-5)Online publication date: 6-Nov-2006
https://dl.acm.org/doi/10.1145/1188895.1188899
Del Grosso CAntoniol GDi Penta MGalinier PMerlo EO'Reilly U(2005)Improving network applications securityProceedings of the 7th annual conference on Genetic and evolutionary computation10.1145/1068009.1068185(1037-1043)Online publication date: 25-Jun-2005
https://dl.acm.org/doi/10.1145/1068009.1068185
Show More Cited By

Index Terms

A static measure of a subset of intra-procedural data flow testing coverage based on node coverage
1. Software and its engineering
  1. Software creation and management

Recommendations

Efficient static analysis with path pruning using coverage data

Soundness and completeness are two primary concerns of a static analysis tool for finding defects in software. Exhaustive static analysis of the program through all paths is not always possible, especially for a large software causing incompleteness in ...
An efficient bitwise algorithm for intra-procedural data-flow testing coverage

Data-flow (DF) testing was introduced to achieve more comprehensive structural evaluation of programs. It requires tests that traverse a path in which the definition of a variable and its subsequent use, i.e., a definition-use association (dua), is ...
Data coverage testing

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

CASCON '99: Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research

November 1999

186 pages

Sponsors

IBM Canada: IBM Canada
NRC: National Research Council - Canada

Publisher

IBM Press

Publication History

Published: 08 November 1999

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 24 of 90 submissions, 27%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
292
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)2

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Santelices RHarrold MStirewalt KEgyed AFischer B(2007)Efficiently monitoring data-flow test coverageProceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering10.1145/1321631.1321682(343-352)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.1145/1321631.1321682
Santelices RSinha SHarrold MMayer JGupta NLedru Y(2006)Subsumption of program entities for efficient coverage and monitoringProceedings of the 3rd international workshop on Software quality assurance10.1145/1188895.1188899(2-5)Online publication date: 6-Nov-2006
https://dl.acm.org/doi/10.1145/1188895.1188899
Del Grosso CAntoniol GDi Penta MGalinier PMerlo EO'Reilly U(2005)Improving network applications securityProceedings of the 7th annual conference on Genetic and evolutionary computation10.1145/1068009.1068185(1037-1043)Online publication date: 25-Jun-2005
https://dl.acm.org/doi/10.1145/1068009.1068185
Orso ASinha SHarrold M(2001)Incremental Slicing Based on Data-Dependences TypesProceedings of the IEEE International Conference on Software Maintenance (ICSM'01)10.1109/ICSM.2001.972726Online publication date: 7-Nov-2001
https://dl.acm.org/doi/10.1109/ICSM.2001.972726

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents