Constructing test suites for interaction testing
By M. B. Cohen, P. B. Gibbons, W. Mugridge, Charles J. Colbourn. 25th International Conference on Software Engineering, 2003. Proceedings., 2003
421 citations recorded by the source corpus.
Subfields: Information Systems, Software
View Paper: https://www.semanticscholar.org/paper/e72b5a6516bb961a184d90644fc58ad7188f2f9f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Information Systems
- Mark Harman
- Phil McMinn
- Hareton K. N. Leung
- Changhai Nie
- Charles J. Colbourn
- Yuanyuan Zhang
- Myra B. Cohen
- S. Afshin Mansouri
In Software
- Mark Harman
- Hareton K. N. Leung
- Changhai Nie
- Phil McMinn
- Charles J. Colbourn
- Myra B. Cohen
- Yuanyuan Zhang
- S. Afshin Mansouri
Citations in the corpus
- An orchestrated survey of methodologies for automated software test case generation (2013, methodology): “, 2009), nteractions (Cohen et al., 2003), integration (Colanzi et al.”
- IPOG: A General Strategy for T-Way Software Testing (2007, methodology): “For example, a system of 20 parameters that have 10 values each requires 10(20) tests for exhaustive testing, but as few as 180 tests for 2-way (or pairwise) testing [6].”
- Combinatorial aspects of covering arrays (2006, background): “This is smaller than the bound reported by a construction in [20], and matches that found by annealing in [32].”
- Search-Based Software Testing: Past, Present and Future (2011, methodology): “Search-based optimisation has been used as an enabler to a plethora of testing problems, including functional testing [6], [7], temporal testing [8], [9], [10], integration testing [11], regression testing [12], stress testing [13], mutation testing [14], test prioritisation [15], [16], interaction ”
- A survey of combinatorial testing (2011, methodology): “When a1 = a2 = ... = an = v, the covering array is written as CA (N; t,n,v), and its covering array number as CAN (N; t,n,v) [Cohen et al. 2003a; 2007b].”
- Covering arrays for efficient fault characterization in complex configuration spaces (2004, methodology): “In [6] several greedy algorithms are compared with heuristi c search such as simulated annealing and hill climbing.”
- A systematic review of search-based testing for non-functional system properties (2009, neutral): “[46,47], Stardom [45], Nurmela [49], Shiba et al.”
- Search Based Software Engineering: A Comprehensive Analysis and Review of Trends Techniques and Applications (2009, methodology): “[122] 2003 Interaction Testing Maximise pair-wise and t-way coverage Arrays HC, SA Synthetic”
- Combination testing strategies: a survey (2005, methodology): “A special case of t-wise coverage called variable strength was proposed by Cohen, Gibbons, Mugridge, and Colburn [ 16 ].”
- Software fault interactions and implications for software testing (2004, background): “Many more empirical studies of other classes of software are needed to evaluate the applicability of combinatorial testing for other classes of systems.”
- Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory (2007, background): “]. Appendix A contains two tables of new upper bounds on the minimal size of covering arrays. To improve applications, generalizations of orthogonal arrays and of covering arrays have been considered [17, 39, 57]. In this thesis, we examine covering arrays with a graph structure. Prior to this thesi”