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

Authors:
Ettore M. Merlo;Giuliano Antoniol
Affiliations:
École Polytechnique de Montréal;IRST-Istituto per la Ricerca Scientifica e Tecnologica
Venue:
CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
Year:
1999

Citing 14
Cited 6

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
A linear algorithm for finding dominators in flow graphs and related problems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The program dependence graph and its use in optimization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Test Data Selection and Quality Estimation Based on the Concept of Essential Branches for Path Testing

IEEE Transactions on Software Engineering
Using Program Slicing in Software Maintenance

IEEE Transactions on Software Engineering
Generalized dominators and post-dominators

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dominators, super blocks, and program coverage

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs

IEEE Transactions on Software Engineering
Flow insensitive C++ pointers and polymorphism analysis and its application to slicing

ICSE '97 Proceedings of the 19th international conference on Software engineering
A fast algorithm for finding dominators in a flowgraph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate predominators in a directed graph [H]

Communications of the ACM
Software Testing Techniques

Software Testing Techniques
Program Understanding and Maintenance with the CANTO Environment

ICSM '97 Proceedings of the International Conference on Software Maintenance
Data flow analysis techniques for test data selection

ICSE '82 Proceedings of the 6th international conference on Software engineering

Incremental Slicing Based on Data-Dependences Types

ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Classifying data dependences in the presence of pointers for program comprehension, testing, and debugging

ACM Transactions on Software Engineering and Methodology (TOSEM)
Improving network applications security: a new heuristic to generate stress testing data

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Subsumption of program entities for efficient coverage and monitoring

Proceedings of the 3rd international workshop on Software quality assurance
Efficiently monitoring data-flow test coverage

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Detecting buffer overflow via automatic test input data generation

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.