The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
The program dependence graph in static program testing
Information Processing Letters
Dependence analysis for pointer variables
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
IEEE Transactions on Software Engineering
Object-oriented software engineering
Object-oriented software engineering
Dynamic slicing of computer programs
Journal of Systems and Software
The chaining approach for software test data generation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Art of Software Testing
Testing Computer Software, Second Edition
Testing Computer Software, Second Edition
Interprocedural Def-Use Associations for C Systems with Single Level Pointers
IEEE Transactions on Software Engineering
The data mining approach to automated software testing
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On the Testing of Particular Input Conditions
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Analysis of the effectiveness of students' test data
Journal of Computing Sciences in Colleges
The test suite generation problem: Optimal instances and their implications
Discrete Applied Mathematics
Generating combinatorial test suite for interaction relationship
Fourth international workshop on Software quality assurance: in conjunction with the 6th ESEC/FSE joint meeting
Assessing IRPS as an efficient pairwise test data generation strategy
International Journal of Advanced Intelligence Paradigms
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
Multi-function system testing: composition of test sets
HASE'04 Proceedings of the Eighth IEEE international conference on High assurance systems engineering
Application of quotient space theory in input-output relationship based combinatorial testing
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Information Sciences: an International Journal
An automated framework for software test oracle
Information and Software Technology
The Minimal Failure-Causing Schema of Combinatorial Testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Effective black-box testing with genetic algorithms
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
Artificial neural networks as multi-networks automated test oracle
Automated Software Engineering
Regression testing minimization, selection and prioritization: a survey
Software Testing, Verification & Reliability
An empirical evaluation of several test-a-few strategies for testing particular conditions
Software—Practice & Experience
State of the art: Dynamic symbolic execution for automated test generation
Future Generation Computer Systems
| Hi-index | 0.00 |
Test reduction is an important issue in black-box testing. The number of possible black-box tests for any non-trivial software application is extremely large. For the class of programs with multiple inputs and outputs, the number of possible tests grows very rapidly as combinations of input test data are considered. In this paper, we introduce an approach to test reduction that uses automated input-output analysis to identify relationships between program inputs and outputs. Our initial experience with the approach has shown that it can significantly reduce the number of black-box tests.