An Applicable Family of Data Flow Testing Criteria
IEEE Transactions on Software Engineering
Run-time detection of undefined variables considered essential
Software—Practice & Experience
Introduction to the theory of programming languages
Introduction to the theory of programming languages
Copying and Swapping: Influences on the Design of Reusable Software Components
IEEE Transactions on Software Engineering
Advances in computers
Data flow coverage and the C language
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Lock-and-key strategies for handling undefined variables
Software—Practice & Experience
Data Flow Analysis in Software Reliability
ACM Computing Surveys (CSUR)
A Formal Analysis of the Fault-Detecting Ability of Testing Methods
IEEE Transactions on Software Engineering
Provable Improvements on Branch Testing
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
The all-du-paths data flow testing criterion was designed to be more demanding than the all-uses criterion, which itself was designed to be more demanding than the all-edges criterion. However, formal comparison metrics developed within the testing community have failed to validate these relationships, without requiring restrictive or undecidable assumptions regarding the universe of programs to which the criteria apply. In this correspondence, we show that the formal relationships among these criteria can be made consistent with their intended relative strengths, without making restrictive or undecidable assumptions.