On the public citation graph
T‐wise combinatorial interaction test suites construction based on coverage inheritance
0 signed · 72 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1992.tb00164.xopenalex-snapshot
Robust Testing of AT&T PMX/StarMAIL Using OATS
inferredcites →https://doi.org/10.1002/jcd.20065openalex-snapshot
Products of mixed covering arrays of strength two
inferredcites →https://doi.org/10.1002/stvr.319openalex-snapshot
Combination testing strategies: a survey
inferredcites →https://doi.org/10.1002/stvr.381openalex-snapshot
IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testing
inferredcites →https://doi.org/10.1007/978-0-387-35497-2_21openalex-snapshot
Formulation of the Interaction Test Coverage Problem as an Integer Program
inferredcites →https://doi.org/10.1007/978-3-540-73770-4_11openalex-snapshot
Using Model Checking to Generate Fault Detecting Tests
inferredcites →https://doi.org/10.1007/978-3-540-79124-9_6openalex-snapshot
A Logic-Based Approach to Combinatorial Testing with Constraints
inferredcites →https://doi.org/10.1007/978-3-642-02949-3_4openalex-snapshot
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing
inferredcites →https://doi.org/10.1016/j.disc.2003.11.029openalex-snapshot
Problems and algorithms for covering arrays
inferredcites →https://doi.org/10.1016/j.disc.2007.11.021openalex-snapshot
Optimal and near-optimal mixed covering arrays by column expansion
inferredcites →https://doi.org/10.1016/s0166-218x(03)00291-9openalex-snapshot
Upper bounds for covering arrays by tabu search
inferredcites →https://doi.org/10.1016/s0950-5849(01)00222-1openalex-snapshot
Non-specification-based approaches to logic testing for software
inferredcites →https://doi.org/10.1109/18.6031openalex-snapshot
Vector sets for exhaustive testing of logic circuits
inferredcites →https://doi.org/10.1109/32.605761openalex-snapshot
The AETG system: an approach to testing based on combinatorial design
inferredcites →https://doi.org/10.1109/32.979992openalex-snapshot
A test generation strategy for pairwise testing
inferredcites →https://doi.org/10.1109/hase.1998.731623openalex-snapshot
In-parameter-order: a test generation strategy for pairwise testing
inferredcites →https://doi.org/10.1109/icse.1997.610252openalex-snapshot
Applying Design of Experiments to Software Testing
inferredcites →https://doi.org/10.1109/icstw.2009.7openalex-snapshot
IPO-s: Incremental Generation of Combinatorial Interaction Test Data Based on Symmetries of Covering Arrays
inferredcites →https://doi.org/10.1109/issre.1998.730876openalex-snapshot
Model-based testing of a highly programmable system
inferredcites →https://doi.org/10.1109/issre.2003.1251061openalex-snapshot
Augmenting simulated annealing to build interaction test suites
inferredcites →https://doi.org/10.1109/sew.2002.1199454openalex-snapshot
An investigation of the applicability of design of experiments to software testing
inferredcites →https://doi.org/10.1109/sew.2006.26openalex-snapshot
Pseudo-Exhaustive Testing for Software
inferredcites →https://doi.org/10.1109/ssbse.2009.25openalex-snapshot
An Improved Meta-heuristic Search for Constrained Interaction Testing
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
inferredcites →https://doi.org/10.1109/tse.2006.8openalex-snapshot
Covering arrays for efficient fault characterization in complex configuration spaces
inferredcites →https://doi.org/10.1109/tse.2008.50openalex-snapshot
Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy Approach
inferredcites →https://doi.org/10.1145/1062455.1062495openalex-snapshot
A framework of greedy methods for constructing interaction test suites
inferredcites →https://doi.org/10.1145/1082983.1083281openalex-snapshot
Modeling requirements for combinatorial software testing
inferredcites →https://doi.org/10.1145/1083274.1083281openalex-snapshot
Modeling requirements for combinatorial software testing
inferredcites →https://doi.org/10.1145/253228.253271openalex-snapshot
Applying design of experiments to software testing
inferredcites →https://doi.org/10.1145/302405.302640openalex-snapshot
Model-based testing in practice
inferredcites →https://doi.org/10.1214/aoms/1177729331openalex-snapshot
Orthogonal Arrays of Strength two and three
inferredcites →https://doi.org/10.5555/776816.776822openalex-snapshot
Constructing test suites for interaction testing
inferredcites →https://doi.org/10.6028/jres.113.022openalex-snapshot
Refining the In-Parameter-Order Strategy for Constructing Covering Arrays
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/qre.2176openalex-snapshot
A graph‐based postoptimization approach for covering arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_17openalex-snapshot
Efficient Combinatorial Test Generation Based on Multivalued Decision Diagrams
inferred← citeshttps://doi.org/10.1007/s11590-016-1012-xopenalex-snapshot
A two-stage algorithm for combinatorial testing
inferred← citeshttps://doi.org/10.1016/bs.adcom.2021.01.002openalex-snapshot
Evaluating software testing techniques: A systematic mapping study
inferred← citeshttps://doi.org/10.1016/j.infsof.2014.10.009openalex-snapshot
New bounds for mixed covering arrays in t-way testing with uniform strength
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.11.007openalex-snapshot
Practical minimization of pairwise-covering test configurations using constraint programming
inferred← citeshttps://doi.org/10.1016/j.ins.2018.10.048openalex-snapshot
A greedy algorithm to construct covering arrays using a graph representation
inferred← citeshttps://doi.org/10.1049/iet-sen.2017.0107openalex-snapshot
Improved pairwise test suites for non‐prime‐power orders
inferred← citeshttps://doi.org/10.1109/access.2018.2879638openalex-snapshot
An Empirical Comparison of Fixed-Strength and Mixed-Strength for Interaction Coverage Based Prioritization
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/cisis.2013.99openalex-snapshot
Automated Conformance Testing of Java Virtual Machines
inferred← citeshttps://doi.org/10.1109/icse.2015.71openalex-snapshot
Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search
inferred← citeshttps://doi.org/10.1109/icst.2012.141openalex-snapshot
CITLAB: A Laboratory for Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/icst.2013.52openalex-snapshot
ACTS: A Combinatorial Test Generation Tool
inferred← citeshttps://doi.org/10.1109/icst.2016.14openalex-snapshot
Repeated Combinatorial Test Design -- Unleashing the Potential in Multiple Testing Iterations
inferred← citeshttps://doi.org/10.1109/icstw.2014.10openalex-snapshot
Combinatorial Interaction Testing of a Java Card Static Verifier
inferred← citeshttps://doi.org/10.1109/icstw.2014.5openalex-snapshot
Validation of Models and Tests for Constrained Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/icstw.2015.7107441openalex-snapshot
Constraint handling in combinatorial test generation using forbidden tuples
inferred← citeshttps://doi.org/10.1109/icstw.2015.7107442openalex-snapshot
Using decision trees to aid algorithm selection in combinatorial interaction tests generation
inferred← citeshttps://doi.org/10.1109/icstw.2015.7107444openalex-snapshot
Improving IPOG's vertical growth based on a graph coloring scheme
inferred← citeshttps://doi.org/10.1109/icstw.2017.37openalex-snapshot
Optimizing IPOG's Vertical Growth with Constraints Based on Hypergraph Coloring
inferred← citeshttps://doi.org/10.1109/issre.2014.15openalex-snapshot
An Orchestrated Survey of Available Algorithms and Tools for Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/wetice.2013.35openalex-snapshot
Combinatorial Validation Testing of Java Card Byte Code Verifiers
inferred← citeshttps://doi.org/10.1109/wetice.2014.33openalex-snapshot
Assessing the Correctness of JVM Implementations
inferred← citeshttps://doi.org/10.1145/2695664.2695905openalex-snapshot
Random versus combinatorial effectiveness in software conformance testing
inferred← citeshttps://doi.org/10.1145/3071178.3071324openalex-snapshot
A penalty-based Tabu search for constrained covering arrays
inferred← citeshttps://doi.org/10.1145/3832783.3837479openalex-snapshot
Feature-Focused Test Generation
inferred← citeshttps://doi.org/10.11591/ijai.v12.i2.pp794-805openalex-snapshot
Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm
inferred← citeshttps://doi.org/10.14569/ijacsa.2015.061234openalex-snapshot
A New Algorithm for Post-Processing Covering Arrays
inferred← citeshttps://doi.org/10.19053/01211129.v25.n43.2016.5295openalex-snapshot
Metaheuristic algorithms for building Covering Arrays: A review
inferred← citeshttps://doi.org/10.22215/etd/2017-11952openalex-snapshot
An Analysis and Extension of Category Partition Testing in the Presence of Constraints
inferred← citeshttps://doi.org/10.26634/jse.9.3.3469openalex-snapshot
Hybrid Fault Categorization Approach To Reduce Thetesting Cost Of Combinatorial Test Cases
inferred← citeshttps://doi.org/10.3390/math12121908openalex-snapshot
New Upper Bounds for Covering Arrays of Order Seven
inferred← citeshttps://doi.org/10.48550/arxiv.1908.02480openalex-snapshot
A Survey of Constrained Combinatorial Testing
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.