An Applicable Family of Data Flow Testing Criteria
IEEE Transactions on Software Engineering
Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
Automated Software Test Data Generation
IEEE Transactions on Software Engineering
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
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
How many paths are needed for branch testing?
Journal of Systems and Software - Special issue on software reliability issues
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Graphs and Hypergraphs
Architecture-based software testing
ISAW '96 Joint proceedings of the second international software architecture workshop (ISAW-2) and international workshop on multiple perspectives in software development (Viewpoints '96) on SIGSOFT '96 workshops
Feasible test path selection by principal slicing
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
WYSIWYT testing in the spreadsheet paradigm: an empirical evaluation
Proceedings of the 22nd international conference on Software engineering
The Impact of Software Evolution on Code Coverage Information
ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Using Spanning Sets for Coverage Testing
IEEE Transactions on Software Engineering
Evaluation of debug-testing efficiency by duplication of the detected fault and delay time of repair
Information Sciences—Informatics and Computer Science: An International Journal
Integrating automated test generation into the WYSIWYT spreadsheet testing methodology
ACM Transactions on Software Engineering and Methodology (TOSEM)
Spy: A flexible code profiling framework
Computer Languages, Systems and Structures
Using model checking for reducing the cost of test generation
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Dependence testing: extending data flow testing with control dependence
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Reducing test effort: A systematic mapping study on existing approaches
Information and Software Technology
| Hi-index | 0.00 |
Test coverage criteria define a set of entities of a program flowgraph and require that every entity is covered by some test. We first identify E/sub c/, the set of entities to be covered according to a criterion c, for a family of widely used test coverage criteria. We then present a method to derive a minimum set of entities, called a spanning set, such that a set of test paths covering the entities in this set covers every entity in E/sub c/. We provide a generalised algorithm, which is parametrized by the coverage criterion. We suggest several useful applications of spanning sets of entities to testing. In particular they help to reduce and to estimate the number of tests needed to satisfy test coverage criteria.