Selecting Software Test Data Using Data Flow Information
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
An Applicable Family of Data Flow Testing Criteria
IEEE Transactions on Software Engineering
Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
A methodology for controlling the size of a test suite
ACM Transactions on Software Engineering and Methodology (TOSEM)
Unconstrained edges and their application to branch analysis and testing of programs
Journal of Systems and Software
Dominators, super blocks, and program coverage
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On mutation and data flow
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs
IEEE Transactions on Software Engineering
Effect of test set minimization on fault detection effectiveness
Proceedings of the 17th international conference on Software engineering
Unconstrained duals and their use in achieving all-uses coverage
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Reducing and estimating the cost of test coverage criteria
Proceedings of the 18th international conference on Software engineering
How many paths are needed for branch testing?
Journal of Systems and Software - Special issue on software reliability issues
A case study in branch testing automation
Journal of Systems and Software - Special issue on achieving quality in software
Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria
ICSE '94 Proceedings of the 16th international conference on Software engineering
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Test Driven Development: By Example
Test Driven Development: By Example
An Empirical Study of the Effects of Minimization on the Fault Detection Capabilities of Test Suites
ICSM '98 Proceedings of the International Conference on Software Maintenance
ACM Transactions on Software Engineering and Methodology (TOSEM)
Building an infrastructure to support experimentation with software testing techniques
ACM SIGSOFT Software Engineering Notes
Aspect language features for concern coverage profiling
Proceedings of the 4th international conference on Aspect-oriented software development
Empirical Software Engineering
A concept analysis inspired greedy algorithm for test suite minimization
PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Towards minimization of test sets for human-computer systems
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Subsumption of program entities for efficient coverage and monitoring
Proceedings of the 3rd international workshop on Software quality assurance
Test minimization for human-computer interaction
Applied Intelligence
System Test Planning of Software: An Optimization Approach
IEEE Transactions on Software Engineering
Efficiently monitoring data-flow test coverage
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
A novel approach for test suite reduction based on requirement relation contraction
Proceedings of the 2008 ACM symposium on Applied computing
A rigorous approach towards test case generation
Information Sciences: an International Journal
MINTS: A general framework and tool for supporting test-suite minimization
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Nature-inspired techniques for conformance testing of object-oriented software
Applied Soft Computing
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
A test suite reduction approach based on pairwise interaction of requirements
Proceedings of the 2011 ACM Symposium on Applied Computing
A minimal test suite generation method based on quotient space theory
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Minimal spanning set for coverage testing of interactive systems
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Regression testing minimization, selection and prioritization: a survey
Software Testing, Verification & Reliability
Efficient and flexible GUI test execution via test merging
Proceedings of the 2013 International Symposium on Software Testing and Analysis
Diversity in software engineering research
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
| Hi-index | 0.00 |
A test coverage criterion defines a set E_c of entities of the program flowgraph and requires that every entity in this set is covered under some test case. Coverage criteria are also used to measure the adequacy of the executed test cases. In this paper, we introduce the notion of spanning sets of entities for coverage testing. A spanning set is a minimum subset of E_c, such that a test suite covering the entities in this subset is guaranteed to cover every entity in E_c. When the coverage of an entity always guarantees the coverage of another entity, the former is said to subsume the latter. Based on the subsumption relation between entities, we provide a generic algorithm to find spanning sets for control flow and data flow-based test coverage criteria. We suggest several useful applications of spanning sets: They help reduce and estimate the number of test cases needed to satisfy coverage criteria. We also empirically investigate how the use of spanning sets affects the fault detection effectiveness.