Orthogonal Latin squares: an application of experiment design to compiler testing
Communications of the ACM
Regression Testing of GUI Event Interactions
ICSM '96 Proceedings of the 1996 International Conference on Software Maintenance
Lower Bounds for Transversal Covers
Designs, Codes and Cryptography
A new method for constructing pair-wise covering designs for software testing
Information Processing Letters
Packing Arrays and Packing Designs
Designs, Codes and Cryptography
A Test Generation Strategy for Pairwise Testing
IEEE Transactions on Software Engineering
Applicability of Non-Specification-Based Approaches to Logic Testing for Software
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
Efficient software testing protocols
CASCON '98 Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
Fully automated interoperability test suite derivation for communication protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Testing web applications focusing on their specialties
ACM SIGSOFT Software Engineering Notes
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
Journal of Combinatorial Theory Series B
A backtracking search tool for constructing combinatorial test suites
Journal of Systems and Software
Strength Two Covering Arrays Construction Using a SAT Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Assessing IRPS as an efficient pairwise test data generation strategy
International Journal of Advanced Intelligence Paradigms
A browser compatibility testing method based on combinatorial testing
ICWE'03 Proceedings of the 2003 international conference on Web engineering
Data generation in model-based testing
Proceedings of the 2010 ACM Symposium on Applied Computing
A new strategy for pairwise test case generation
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
MiTS: a new approach of tabu search for constructing mixed covering arrays
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Construction of mixed covering arrays of variable strength using a tabu search approach
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Information Sciences: an International Journal
PTMD: pairwise testing based on module dependency
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
The Minimal Failure-Causing Schema of Combinatorial Testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Testing and fault diagnosis for web application compatibility based on combinatorial method
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
SP 800-142. Practical Combinatorial Testing
SP 800-142. Practical Combinatorial Testing
Protocol quality engineering: addressing industry concerns about formal methods
Computer Communications
Supercomputing and grid computing on the verification of covering arrays
The Journal of Supercomputing
| Hi-index | 0.00 |
Distributed systems consist of a number of network elements that interact with each other. As the number of network elements and interchangeable components for each network element increases, the trade-off that the system tester faces is the thoroughness of test configuration coverage vs. limited resources of time and expense that are available. An approach to resolving this trade-off is to determine a set of test configurations that test each pair-wise combination of network components. This goal gives a well-defined level of test coverage, with a reduced number of system configurations. To select such a set of test configurations, we show how to apply the method of orthogonal Latin squares, from the design of balanced statistical experiments. Since the theoretical treatment assumes constraints that may not be satisfied in practice, we then show how to adapt this approach to realistic application constraints.