Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-a-combinatorial-framework-for-fault-characterization-a8qRV0F03P
References (78)
-
C. Martínez, Lucia Moura, D. Panario, B. Stevens (2009)
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing AlgorithmsSIAM J. Discret. Math., 23
-
Peyman Nayeri, C. Colbourn, G. Konjevod (2009)
Randomized Postoptimization of Covering Arrays -
Wujie Zhou, Deping Zhang (2012)
Sole error locating array and approximate error locating array2012 IEEE International Conference on Computer Science and Automation Engineering
-
Tsong Chen, H. Leung, I. Mak (2004)
Adaptive Random Testing2008 The Eighth International Conference on Quality Software
-
J. Bach, Patrick Schroeder, inviata Milwaukee, Wisconsin Schroeder (2005)
Pairwise Testing : A Best Practice That Isn ’ -
E. Berg, E. Candès, G. Chinn, C. Levin, P. Olcott, C. Sing-Long (2012)
Single-photon sampling architecture for solid-state imaging sensorsProceedings of the National Academy of Sciences, 110
-
C. Colbourn, D. McClary (2008)
Locating and detecting arrays for interaction faultsJournal of Combinatorial Optimization, 15
-
K. Tai, Yu Lei (2002)
A Test Generation Strategy for Pairwise TestingIEEE Trans. Software Eng., 28
-
A. Aldaco, C. Colbourn, V. Syrotiuk (2015)
Locating Arrays: A New Experimental Design for Screening Complex Engineered SystemsACM SIGOPS Oper. Syst. Rev., 49
-
David Johnson (1973)
Approximation algorithms for combinatorial problemsProceedings of the fifth annual ACM symposium on Theory of computing
-
S. Chen, D. Donoho, M. Saunders (1998)
Atomic Decomposition by Basis PursuitSIAM J. Sci. Comput., 20
-
L. Lovász (1975)
On the ratio of optimal integral and fractional coversDiscret. Math., 13
-
J. Petke, Myra Cohen, M. Harman, S. Yoo (2015)
Practical Combinatorial Interaction Testing: Empirical Findings on Efficiency and Early Fault DetectionIEEE Transactions on Software Engineering, 41
-
Yu Tang, C. Colbourn, Jianxing Yin (2012)
Optimality and Constructions of Locating ArraysJournal of Statistical Theory and Practice, 6
-
Jaganmohan Chandrasekaran, Laleh Ghandehari, Yu Lei, R. Kacker, D. Kuhn (2016)
Evaluating the Effectiveness of BEN in Localizing Different Types of Software Fault2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)
-
D. Du, F. Hwang (1993)
Combinatorial Group Testing and Its Applications -
Randy Compton, M. Mehari, C. Colbourn, E. Poorter, V. Syrotiuk (2016)
Screening interacting factors in a wireless network testbed using locating arrays2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
-
Takahiro Nagamoto, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya (2014)
Locating a Faulty Interaction in Pair-wise Testing2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing
-
Ching-Shui Cheng, Boxin Tang (2001)
Upper bounds on the number of columns in supersaturated designsBiometrika, 88
-
NH Bshouty, A Costa (2016)
Exact learning of juntas from membership queriesLect. Notes Artif. Intell., 9925
-
Alessandra Mattei, F. Mealli, A. Nodehi (2006)
Design and Analysis of ExperimentsTechnometrics, 48
-
D. Kuhn, R. Kacker, Yu Lei (2015)
Combinatorial coverage as an aspect of test quality, 28
-
T. Chen, Fei-Ching Kuo, Robert Merkel, T. Tse (2010)
Adaptive Random Testing: The ART of test case diversityJ. Syst. Softw., 83
-
A Hartman (2005)
Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms -
D. Kuhn, Itzel Mendoza, R. Kacker, Yu Lei (2013)
Combinatorial Coverage Measurement Concepts and Applications2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops
-
M. Grindal, Jeff Offutt, Sten Andler (2005)
Combination testing strategies: a surveySoftware Testing, 15
-
Kaushik Sarkar, C. Colbourn (2016)
Upper Bounds on the Size of Covering ArraysSIAM J. Discret. Math., 31
-
Renée Bryce, C. Colbourn (2013)
Expected time to detection of interaction faultsThe journal of combinatorial mathematics and combinatorial computing, 86
-
(2012)
New upper bounds for binary covering arrays using simulated annealing -
Hao Jin, Tatsuhiro Tsuchiya (2017)
Constrained locating arrays for combinatorial interaction testingJ. Syst. Softw., 170
-
C. Colbourn, Bingli Fan, Daniel Horsley (2016)
Disjoint Spread Systems and Fault LocationSIAM J. Discret. Math., 30
-
Changhai Nie, Huayao Wu, Xintao Niu, Fei-Ching Kuo, H. Leung, C. Colbourn (2015)
Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failuresInf. Softw. Technol., 62
-
Myra Cohen, Matthew Dwyer, Jiangfan Shi (2008)
Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy ApproachIEEE Transactions on Software Engineering, 34
-
DS Johnson (1974)
Approximation algorithms for combinatorial problemsJ. Comput. Syst. Sci., 9
-
Stephen Seidel, Kaushik Sarkar, C. Colbourn, V. Syrotiuk (2018)
Separating Interaction Effects Using Locating and Detecting Arrays -
A. Godbole, Daphne Skipper, Rachel Sunley (1996)
t-Covering Arrays: Upper Bounds and Poisson ApproximationsCombinatorics, Probability and Computing, 5
-
Laleh Ghandehari, Jaganmohan Chandrasekaran, Yu Lei, R. Kacker, D. Kuhn (2015)
BEN: A combinatorial testing-based fault localization tool2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)
-
Alan Hartman, Leonid Raskin (2004)
Problems and algorithms for covering arraysDiscret. Math., 284
-
Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya (2019)
Finding minimum locating arrays using a CSP solverArXiv, abs/1904.07480
-
AP Godbole, DE Skipper, RA Sunley (1996)
$$t$$ t -covering arrays: upper bounds and Poisson approximationsComb. Probab. Comput., 5
-
B. Jones, D. Majumdar (2014)
Optimal Supersaturated DesignsJournal of the American Statistical Association, 109
-
J. Petke (2015)
Constraints: The Future of Combinatorial Interaction Testing2015 IEEE/ACM 8th International Workshop on Search-Based Software Testing
-
R. Hamlet, R. Taylor (1988)
Partition testing does not inspire confidence[1988] Proceedings. Second Workshop on Software Testing, Verification, and Analysis
-
D. Kuhn, D. Wallace, A. Gallo (2004)
Software fault interactions and implications for software testingIEEE Transactions on Software Engineering, 30
-
C. Colbourn, V. Syrotiuk (2016)
Coverage, Location, Detection, and Measurement2016 IEEE Ninth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)
-
T. Y. Chen, H. Leung, I. K. Mak (2004)
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making -
Patrick Schroeder, Pankaj Bolaki, Vijayram Gopu (2004)
Comparing the fault detection effectiveness of n-way and random test suitesProceedings. 2004 International Symposium on Empirical Software Engineering, 2004. ISESE '04.
-
B. Bollobás (2015)
The Probabilistic MethodFundamentals of Ramsey Theory
-
Stephen A. Seidel, Kaushik Sarkar, Charles J. Colbourn, Violet R. Syrotiuk (2018)
Lecture Notes in Computer Science -
Yin Zhang (2008)
On Theory of Compressive Sensing via L_1-Minimization: Simple Derivations and Extensions -
D Hamlet, R Taylor (1990)
Partition testing does not inspire confidence (program testing)IEEE Trans. Softw. Eng., 16
-
D. Donoho, X. Huo (2001)
Uncertainty principles and ideal atomic decompositionIEEE Trans. Inf. Theory, 47
-
Renée Bryce, C. Colbourn, D. Kuhn (2011)
Finding Interaction Faults Adaptively Using Distance-Based Strategies2011 18th IEEE International Conference and Workshops on Engineering of Computer-Based Systems
-
Pak Li, Karen Meagher (2012)
Sperner Partition SystemsJournal of Combinatorial Designs, 21
-
A. Hartman (2005)
Software and Hardware Testing Using Combinatorial Covering Suites -
D. Kuhn, R. Kacker, Yu Lei (2013)
Introduction to Combinatorial Testing -
Cemal Yilmaz, Myra Cohen, A. Porter (2004)
Covering arrays for efficient fault characterization in complex configuration spacesIEEE Transactions on Software Engineering, 32
-
D. Kuhn, michael. reilly, michael. reilly (2002)
An investigation of the applicability of design of experiments to software testing27th Annual NASA Goddard/IEEE Software Engineering Workshop, 2002. Proceedings.
-
P. Lovász
Problems and Results on 3-chromatic Hypergraphs and Some Related Questions -
Ce Shi, Yu Tang, Jianxing Yin (2012)
Optimal locating arrays for at most two faultsScience China Mathematics, 55
-
S. Dalal, C. Mallows (1998)
Factor-covering designs for testing softwareTechnometrics, 40
-
S. Stein (1974)
Two Combinatorial Covering TheoremsJ. Comb. Theory, Ser. A, 16
-
Nevena Franceti'c, B. Stevens (2015)
Asymptotic Size of Covering Arrays: An Application of Entropy CompressionJournal of Combinatorial Designs, 25
-
Robin Moser, G. Tardos (2009)
A constructive proof of the general lovász local lemmaJ. ACM, 57
-
Karen Meagher, Lucia Moura, B. Stevens (2005)
A Sperner-Type Theorem for Set-Partition SystemsElectron. J. Comb., 12
-
P. Frankl, R. Hamlet, B. Littlewood, L. Strigini (1998)
Evaluating Testing Methods by Delivered ReliabilityIEEE Trans. Software Eng., 24
-
N. Bshouty, A. Costa (2017)
Exact Learning of Juntas from Membership QueriesTheor. Comput. Sci., 742
-
D. Kuhn, Renée Bryce, Feng Duan, Laleh Ghandehari, Yu Lei, R. Kacker (2015)
Combinatorial Testing: Theory and PracticeAdv. Comput., 99
-
Renée Bryce, C. Colbourn (2009)
A density‐based greedy algorithm for higher strength covering arraysSoftware Testing, 19
-
Cemal Yilmaz, Emine Dumlu, Myra Cohen, A. Porter
Ieee Transactions on Software Engineering 1 Reducing Masking Effects in Combinatorial Interaction Testing: a Feedback Driven Adaptive Approach -
D. Cohen, S. Dalal, M. Fredman, G. Patton (1997)
The AETG System: An Approach to Testing Based on Combinatiorial DesignIEEE Trans. Software Eng., 23
-
C Yilmaz, E Dumlu, MB Cohen, A Porter (2014)
Reducing masking effects in combinatorial interaction testing: A feedback driven adaptive approachIEEE Trans. Softw. Eng., 40
-
Changhai Nie, H. Leung (2011)
A survey of combinatorial testingACM Comput. Surv., 43
-
Stephen Seidel, M. Mehari, C. Colbourn, E. Poorter, I. Moerman, V. Syrotiuk (2018)
Analysis of large-scale experimental data from wireless networksIEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
-
S. Ghosh, T. Shirakura, J. Srivastava (2007)
Model Identification Using Search Linear Models and Search Designs -
P. Damaschke (1998)
Adaptive Versus Nonadaptive Attribute-Efficient LearningMachine Learning, 41
-
C. Colbourn, Erin Lanus, Kaushik Sarkar (2018)
Asymptotic and constructive methods for covering perfect hash families and covering arraysDesigns, Codes and Cryptography, 86
-
C. Colbourn, Bingli Fan (2016)
Locating one pairwise interaction: Three recursive constructions, 3
- Publisher
- Springer Journals
- Copyright
- Copyright © 2018 by Springer Nature Switzerland AG
- Subject
- Mathematics; Mathematics, general; Computer Science, general
- ISSN
- 1661-8270
- eISSN
- 1661-8289
- DOI
- 10.1007/s11786-018-0385-x
- Publisher site
- See Article on Publisher Site
Abstract
Covering arrays have been widely used to detect the presence of faults in large software and hardware systems. Indeed, finding failures that result from faulty interactions requires that all interactions that may cause faults be covered by a test case. However, finding the actual faults requires more, because the failures resulting from two potential sets of faults must not be the same. The combinatorial requirements on test suites to enable a tester to locate the faults are developed, and set in the context of similar combinatorial search questions. Test suites known as locating and detecting arrays to locate faults both in principle and in practice generalize covering arrays, thereby addressing combinatorial fault characterization. In common with covering arrays, these locating and detecting arrays scale logarithmically in size with the number of factors, but unlike covering arrays they support complete characterization of the interactions that underlie faults.
Journal
Mathematics in Computer Science – Springer Journals
Published: Sep 20, 2018