On the public citation graph
The density algorithm for pairwise interaction testing
0 signed · 187 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/(sici)1097-024x(19980410)28:4<347::aid-spe145>3.0.co;2-lopenalex-snapshot
Effect of test set minimization on fault detection effectiveness
inferredcites →https://doi.org/10.1002/jcd.10002openalex-snapshot
On the state of strength‐three covering arrays
inferredcites →https://doi.org/10.1002/jcd.10059openalex-snapshot
Covering arrays with mixed alphabet sizes
inferredcites →https://doi.org/10.1002/jcd.3180010106openalex-snapshot
Covering arrays and intersecting codes
inferredcites →https://doi.org/10.1002/stvr.299openalex-snapshot
Applying simulation and design of experiments to the embedded software testing process
inferredcites →https://doi.org/10.1007/0-387-25036-0_10openalex-snapshot
Software and Hardware Testing Using Combinatorial Covering Suites
inferredcites →https://doi.org/10.1007/978-0-387-35516-0_4openalex-snapshot
Determination of Test Configurations for Pair-Wise Interaction Coverage
inferredcites →https://doi.org/10.1007/978-1-4612-1478-6_12openalex-snapshot
Tables of Orthogonal Arrays
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_32openalex-snapshot
Efficient Algorithms for Generation of Combinatorial Covering Suites
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.infsof.2006.03.004openalex-snapshot
Prioritized interaction testing for pair-wise coverage with seeding and constraints
inferredcites →https://doi.org/10.1016/s0020-0190(01)00195-8openalex-snapshot
A new method for constructing pair-wise covering designs for software testing
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.1109/12.166605openalex-snapshot
Computer benchmark evaluation and design of experiments: a case study
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/52.536462openalex-snapshot
The combinatorial design approach to automatic test generation
inferredcites →https://doi.org/10.1109/aero.2000.879426openalex-snapshot
Automating test case generation for the new generation mission software system
inferredcites →https://doi.org/10.1109/aiccsa.2001.933943openalex-snapshot
Proceedings ACS/IEEE International Conference on Computer Systems and Applications
inferredcites →https://doi.org/10.1109/aiccsa.2001.934001openalex-snapshot
A measure for component interaction test coverage
inferredcites →https://doi.org/10.1109/cmpsac.2003.1245373openalex-snapshot
A variable strength interaction testing of components
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/icse.2003.1201186openalex-snapshot
Constructing test suites for interaction testing
inferredcites →https://doi.org/10.1109/icsm.1996.565038openalex-snapshot
Regression testing of GUI event interactions
inferredcites →https://doi.org/10.1109/issre.1996.558835openalex-snapshot
A practical strategy for testing pair-wise coverage of network interfaces
inferredcites →https://doi.org/10.1109/issre.2000.885865openalex-snapshot
Generating test cases for GUI responsibilities using complete interaction sequences
inferredcites →https://doi.org/10.1109/issre.2001.989452openalex-snapshot
Proceedings 12th International Symposium on Software Reliability Engineering
inferredcites →https://doi.org/10.1109/issre.2003.1251061openalex-snapshot
Augmenting simulated annealing to build interaction test suites
inferredcites →https://doi.org/10.1109/qsic.2003.1319088openalex-snapshot
Generating small combinatorial test suites to cover input-output relationships
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/tse.2003.1232283openalex-snapshot
Efficient evaluation of multifactor dependent system performance using fractional factorial design
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.1145/1062455.1062495openalex-snapshot
A framework of greedy methods for constructing interaction test suites
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.1145/4372.4375openalex-snapshot
Orthogonal Latin squares: an application of experiment design to compiler testing
inferredcites →https://doi.org/10.1198/tech.2001.s605openalex-snapshot
Design and Analysis of Experiments
inferredcites →https://doi.org/10.5555/776816.776822openalex-snapshot
Constructing test suites for interaction testing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21657openalex-snapshot
Two‐stage algorithms for covering array construction
inferred← citeshttps://doi.org/10.1002/qre.2176openalex-snapshot
A graph‐based postoptimization approach for covering arrays
inferred← citeshttps://doi.org/10.1002/smr.2537openalex-snapshot
A novel combinatorial testing approach with fuzzing strategy
inferred← citeshttps://doi.org/10.1002/stvr.1689openalex-snapshot
Approaches for computing test‐case‐aware covering arrays
inferred← citeshttps://doi.org/10.1002/stvr.381openalex-snapshot
IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testing
inferred← citeshttps://doi.org/10.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferred← citeshttps://doi.org/10.1007/978-3-030-21363-3_10openalex-snapshot
Detecting Arrays for Main Effects
inferred← citeshttps://doi.org/10.1007/978-3-319-26285-7_17openalex-snapshot
Search-Based Software Engineering to Construct Binary Test-Suites
inferred← citeshttps://doi.org/10.1007/978-3-319-56932-1_10openalex-snapshot
Algebraic Modelling of Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_29openalex-snapshot
Separating Interaction Effects Using Locating and Detecting Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_44openalex-snapshot
Algorithms to Locate Errors Using Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_40openalex-snapshot
Randomized Postoptimization of Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-16773-7_33openalex-snapshot
MiTS: A New Approach of Tabu Search for Constructing Mixed Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_6openalex-snapshot
Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-22203-0_1openalex-snapshot
Practical Adoptions of T-Way Strategies for Interaction Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_12openalex-snapshot
Efficient Conditional Expectation Algorithms for Constructing Hash Families
inferred← citeshttps://doi.org/10.1007/978-3-642-28765-7_79openalex-snapshot
Simulated Annealing for Constructing Mixed Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-29694-9_15openalex-snapshot
MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-32541-0_1openalex-snapshot
Constraints Dependent T-Way Test Suite Generation Using Harmony Search Strategy
inferred← citeshttps://doi.org/10.1007/978-3-642-34654-5_62openalex-snapshot
Constructing Real Test-Suites Using an Enhanced Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-3-642-37798-3_12openalex-snapshot
A Post-optimization Strategy for Combinatorial Testing: Test Suite Reduction through the Identification of Wild Cards and Merge of Rows
inferred← citeshttps://doi.org/10.1007/978-981-13-0755-3_8openalex-snapshot
Learning Cuckoo Search Strategy for t-way Test Generation
inferred← citeshttps://doi.org/10.1007/s00500-021-05788-0openalex-snapshot
GALP: a hybrid artificial intelligence algorithm for generating covering array
inferred← citeshttps://doi.org/10.1007/s10623-017-0369-xopenalex-snapshot
Asymptotic and constructive methods for covering perfect hash families and covering arrays
inferred← citeshttps://doi.org/10.1007/s10878-007-9082-4openalex-snapshot
Locating and detecting arrays for interaction faults
inferred← citeshttps://doi.org/10.1007/s10878-022-00947-xopenalex-snapshot
Algorithmic methods for covering arrays of higher index
inferred← citeshttps://doi.org/10.1007/s11227-012-0763-0openalex-snapshot
Supercomputing and grid computing on the verification of covering arrays
inferred← citeshttps://doi.org/10.1007/s11390-015-1574-6openalex-snapshot
Balancing Frequencies and Fault Detection in the In-Parameter-Order Algorithm
inferred← citeshttps://doi.org/10.1007/s11786-017-0326-0openalex-snapshot
An Efficient Design and Implementation of the In-Parameter-Order Algorithm
inferred← citeshttps://doi.org/10.1007/s13198-016-0430-6openalex-snapshot
Construction of t-way covering arrays using genetic algorithm
inferred← citeshttps://doi.org/10.1007/s42979-023-02548-9openalex-snapshot
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.11.029openalex-snapshot
Application of Particle Swarm Optimization to uniform and variable strength covering array construction
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.08.022openalex-snapshot
Using simulated annealing for computing cost-aware covering arrays
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.024openalex-snapshot
Merging covering arrays and compressing multiple sequence alignments
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.017openalex-snapshot
Randomized post-optimization of covering arrays
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.07.029openalex-snapshot
An efficient strategy for covering array construction with fuzzy logic-based adaptive swarm optimization for software testing use
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.05.005openalex-snapshot
Achievement of minimized combinatorial test suite for configuration-aware software functional testing using the Cuckoo Search algorithm
inferred← citeshttps://doi.org/10.1016/j.infsof.2017.10.007openalex-snapshot
A tuned version of genetic algorithm for efficient test suite generation in interactive t -way testing strategy
inferred← citeshttps://doi.org/10.1016/j.infsof.2018.03.007openalex-snapshot
Combinatorial-based event sequence testing of Android applications
inferred← citeshttps://doi.org/10.1016/j.infsof.2020.106288openalex-snapshot
WCA: A weighting local search for constrained combinatorial test optimization
inferred← citeshttps://doi.org/10.1016/j.ins.2011.09.020openalex-snapshot
New bounds for binary covering arrays using simulated annealing
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.1016/j.jda.2012.04.004openalex-snapshot
Strengthening hash families and compressive sensing
inferred← citeshttps://doi.org/10.1016/j.jss.2011.06.004openalex-snapshot
A variable strength interaction test suites generation strategy using Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1016/j.jss.2014.08.005openalex-snapshot
PROW: A Pairwise algorithm with constRaints, Order and Weight
inferred← citeshttps://doi.org/10.1016/j.jss.2014.09.001openalex-snapshot
Generating combinatorial test suite using combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.383openalex-snapshot
Populations of Models, Experimental Designs and Coverage of Parameter Space by Latin Hypercube and Orthogonal Sampling
inferred← citeshttps://doi.org/10.1016/j.protcy.2012.05.127openalex-snapshot
Pair-wise Testing Using Simulated Annealing
inferred← citeshttps://doi.org/10.1038/s41467-026-68532-yopenalex-snapshot
On the fundamental resource for exponential advantage in quantum channel learning
inferred← citeshttps://doi.org/10.1049/iet-sen.2012.0074openalex-snapshot
Metaheuristic approach for constructing functional test‐suites
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.1080/00913367.2019.1652123openalex-snapshot
An Algorithm for Allocating Sponsored Recommendations and Content: Unifying Programmatic Advertising and Recommender Systems
inferred← citeshttps://doi.org/10.1080/1448837x.2009.11464227openalex-snapshot
Introducing Combinatorial Methods for Automating the Generation of Test Suites
inferred← citeshttps://doi.org/10.1080/15598608.2009.10411962openalex-snapshot
D-Optimal Designs with Interaction Coverage
inferred← citeshttps://doi.org/10.1088/1742-6596/1962/1/012045openalex-snapshot
Adopting Ant Colony Optimization Algorithm for Pairwise T-Way Test Suite Generation Strategy
inferred← citeshttps://doi.org/10.1088/1757-899x/715/1/012026openalex-snapshot
Statistical testing data generation for UAS
inferred← citeshttps://doi.org/10.1093/comjnl/bxaa020openalex-snapshot
Covering Array Constructors: An Experimental Analysis of Their Interaction Coverage and Fault Detection
inferred← citeshttps://doi.org/10.1109/access.2019.2907057openalex-snapshot
Methods to Construct Uniform Covering Arrays
inferred← citeshttps://doi.org/10.1109/afrcon.2013.6757749openalex-snapshot
PWTool, A novel automated tool for pairwise testing
inferred← citeshttps://doi.org/10.1109/ase.2015.61openalex-snapshot
TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T)
inferred← citeshttps://doi.org/10.1109/cec.2010.5586148openalex-snapshot
Simulated Annealing for constructing binary covering arrays of variable strength
inferred← citeshttps://doi.org/10.1109/compsac.2013.84openalex-snapshot
Prioritizing Variable-Strength Covering Array
inferred← citeshttps://doi.org/10.1109/ecbs.2011.9openalex-snapshot
Finding Interaction Faults Adaptively Using Distance-Based Strategies
inferred← citeshttps://doi.org/10.1109/ic3.2014.6897246openalex-snapshot
Integrating greedy based approach with genetic algorithm to generate mixed covering arrays for pair-wise testing
inferred← citeshttps://doi.org/10.1109/iccrd.2010.56openalex-snapshot
T-Way Test Data Generation Strategy Based on Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1109/icimia.2017.7975569openalex-snapshot
An analysis of suitable CTD model for applications
inferred← citeshttps://doi.org/10.1109/icse43902.2021.00030openalex-snapshot
AutoCCAG: An Automated Approach to Constrained Covering Array Generation
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00113openalex-snapshot
Towards High-Strength Combinatorial Interaction Testing for Highly Configurable Software Systems
inferred← citeshttps://doi.org/10.1109/icstw.2013.36openalex-snapshot
Empirically Identifying the Best Greedy Algorithm for Covering Array Generation
inferred← citeshttps://doi.org/10.1109/icstw.2013.77openalex-snapshot
Combinatorial Coverage Measurement Concepts and Applications
inferred← citeshttps://doi.org/10.1109/icstw.2014.16openalex-snapshot
Refining a Randomized Post-optimization Method for Covering Arrays
inferred← citeshttps://doi.org/10.1109/icstw.2019.00060openalex-snapshot
Using Parameter Mapping to Avoid Forbidden Tuples in a Covering Array
inferred← citeshttps://doi.org/10.1109/icstw50294.2020.00041openalex-snapshot
CAGEN: A fast combinatorial test generation tool with support for constraints and higher-index arrays
inferred← citeshttps://doi.org/10.1109/icstw55395.2022.00027openalex-snapshot
Parallel Test Generation for Combinatorial Models Based on Multivalued Decision Diagrams
inferred← citeshttps://doi.org/10.1109/isci.2011.5958995openalex-snapshot
On sequence based interaction testing
inferred← citeshttps://doi.org/10.1109/isci.2011.5959020openalex-snapshot
Development of a non-deterministic input-output based relationship test data set minimization strategy
inferred← citeshttps://doi.org/10.1109/isiea.2009.5356469openalex-snapshot
ITTW: T-way minimization strategy based on intersection of tuples
inferred← citeshttps://doi.org/10.1109/isiea.2010.5679443openalex-snapshot
Distributed t-way test suite data generation using exhaustive search method with map and reduce framework
inferred← citeshttps://doi.org/10.1109/isiea.2014.8049884openalex-snapshot
Distributed t-way test suite execution with code coverage on multiple machines
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654003openalex-snapshot
A Remark on Downlink Massive Random Access
inferred← citeshttps://doi.org/10.1109/itsim.2008.4631571openalex-snapshot
A parallelization strategies of test suites generation for t-way combinatorial interaction testing
inferred← citeshttps://doi.org/10.1109/mitp.2008.54openalex-snapshot
Practical Combinatorial Testing: Beyond Pairwise
inferred← citeshttps://doi.org/10.1109/qsic.2014.15openalex-snapshot
General Optimization Strategies for Refining the In-Parameter-Order Algorithm
inferred← citeshttps://doi.org/10.1109/tse.2010.34openalex-snapshot
Interactive, Evolutionary Search in Upstream Object-Oriented Class Design
inferred← citeshttps://doi.org/10.1109/tse.2012.65openalex-snapshot
Test Case-Aware Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/tse.2013.53openalex-snapshot
Reducing Masking Effects in CombinatorialInteraction Testing: A Feedback DrivenAdaptive Approach
inferred← citeshttps://doi.org/10.1109/tse.2018.2865772openalex-snapshot
An Interleaving Approach to Combinatorial Testing and Failure-Inducing Interaction Identification
inferred← citeshttps://doi.org/10.1109/tse.2021.3065950openalex-snapshot
Combinatorial Test Generation for Multiple Input Models With Shared Parameters
inferred← citeshttps://doi.org/10.1109/tse.2021.3131548openalex-snapshot
Enhance Combinatorial Testing with Metamorphic Relations
inferred← citeshttps://doi.org/10.1137/080730706openalex-snapshot
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
inferred← citeshttps://doi.org/10.1137/16m1067767openalex-snapshot
Upper Bounds on the Size of Covering Arrays
inferred← citeshttps://doi.org/10.1142/s0218194011005499openalex-snapshot
COST-COGNIZANT COMBINATORIAL TEST CASE PRIORITIZATION
inferred← citeshttps://doi.org/10.1142/s0218194020500151openalex-snapshot
Generation and Application of Constrained Interaction Test Suites Using Base Forbidden Tuples with a Mixed Neighborhood Tabu Search
inferred← citeshttps://doi.org/10.1142/s1793830912500334openalex-snapshot
CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH
inferred← citeshttps://doi.org/10.1145/1276958.1277173openalex-snapshot
One-test-at-a-time heuristic search for interaction test suites
inferred← citeshttps://doi.org/10.1145/1294921.1294922openalex-snapshot
Test suite prioritization by interaction coverage
inferred← citeshttps://doi.org/10.1145/1883612.1883618openalex-snapshot
A survey of combinatorial testing
inferred← citeshttps://doi.org/10.1145/2970276.2970335openalex-snapshot
Greedy combinatorial test case generation using unsatisfiable cores
inferred← citeshttps://doi.org/10.1145/3338906.3338914openalex-snapshot
Towards more efficient meta-heuristic algorithms for combinatorial test generation
inferred← citeshttps://doi.org/10.1145/3688836openalex-snapshot
Solving the t -Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling
inferred← citeshttps://doi.org/10.1145/3832783.3834349openalex-snapshot
DynCA: An Effective Algorithm for 3-Wise Combinatorial Interaction Testing in Highly Configurable Systems
inferred← citeshttps://doi.org/10.1155/2012/897027openalex-snapshot
New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing
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.12794/metadc1062844openalex-snapshot
Online Construction of Android Application Test Suites
inferred← citeshttps://doi.org/10.14257/ijca.2016.9.12.04openalex-snapshot
Automatic Test Case Generation and Optimization Strategies based on Components with Sequential Constraints
inferred← citeshttps://doi.org/10.14569/ijacsa.2019.0100431openalex-snapshot
ABCVS: An Artificial Bee Colony for Generating Variable T-Way Test Sets
inferred← citeshttps://doi.org/10.1504/ijspm.2007.014717openalex-snapshot
Biased covering arrays for progressive ranking and composition of Web Services
inferred← citeshttps://doi.org/10.17169/refubium-7452openalex-snapshot
Enhanced Test Case Generation with the Classification Tree Method
inferred← citeshttps://doi.org/10.17485/ijst/2015/v8i33/76884openalex-snapshot
Implementing Dynamically Evolvable Online Testing of Embedded Systems
inferred← citeshttps://doi.org/10.18293/seke2019-016openalex-snapshot
Research on Multi-constraint Combinatorial Test Technology for High Confidence Embedded Software (S)
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-11936openalex-snapshot
Covering Arrays from Maximal Sequences over Finite Fields
inferred← citeshttps://doi.org/10.26076/9556-90a9openalex-snapshot
Combinatorial-Based Prioritization For User-Session-Based Test Suites
inferred← citeshttps://doi.org/10.30534/ijeter/2019/047112019openalex-snapshot
Generating Test cases for Testing Embedded Systems using Combinatorial Techniques and Neural Networks based Learning Model
inferred← citeshttps://doi.org/10.3390/eng4010032openalex-snapshot
Covering Arrays ML HPO for Static Malware Detection
inferred← citeshttps://doi.org/10.3390/telecom4020015openalex-snapshot
Deep Learning Optimisation of Static Malware Detection with Grid Search and Covering Arrays
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2009.03497openalex-snapshot
Combinatorial Testing: Principles and Methods
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2013.04326openalex-snapshot
Optimization of Configurable Greedy Algorithm for Covering Arrays Generation
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2011.01126openalex-snapshot
Locating Error Interactions Based on Partial Covering Array
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2011.01509openalex-snapshot
An Adaptive Algorithm of Locating Fault Interactions Based Combinatorial Testing
inferred← citeshttps://doi.org/10.3844/jcssp.2011.1375.1385openalex-snapshot
A Review of Covering Arrays and Their Application to Software Testing
inferred← citeshttps://doi.org/10.3923/jai.2011.156.165openalex-snapshot
The Development of a Particle Swarm Based Optimization Strategy for Pairwise Testing
inferred← citeshttps://doi.org/10.4018/978-1-60566-731-7.ch014openalex-snapshot
Combinatorial Testing
inferred← citeshttps://doi.org/10.4218/etrij.10.0109.0266openalex-snapshot
MC-MIPOG: A Parallel t-Way Test Generation Strategy for Multicore Systems
inferred← citeshttps://doi.org/10.4304/jsw.8.12.3173-3181openalex-snapshot
Generating Variable Strength Covering Array for Combinatorial Software Testing with Greedy Strategy
inferred← citeshttps://doi.org/10.48550/arxiv.1908.02480openalex-snapshot
A Survey of Constrained Combinatorial Testing
inferred← citeshttps://doi.org/10.4995/thesis/10251/17027openalex-snapshot
Constructing Covering Arrays using Parallel Computing and Grid Computing
inferred← citeshttps://doi.org/10.5772/36019openalex-snapshot
Using Grid Computing for Constructing Ternary Covering Arrays
inferred← citeshttps://doi.org/10.5815/ijitcs.2015.10.04openalex-snapshot
Construction of Strength Two Mixed Covering Arrays Using Greedy Mutation in Genetic Algorithm
inferred← citeshttps://doi.org/10.5897/ijps11.1316openalex-snapshot
Comparative study of distributed implementation using Tuple space technology of two t-way test suite generation strategies
inferred← citeshttps://doi.org/10.5897/sre10.1196openalex-snapshot
ITTDG: Integrated T-way test data generation strategy for interaction testing
inferred← citeshttps://doi.org/10.5897/sre11.427openalex-snapshot
Development of interaction test suite generation strategy with input-output mapping supports
inferred← citeshttps://doi.org/10.6028/jres.113.022openalex-snapshot
Refining the In-Parameter-Order Strategy for Constructing Covering Arrays
inferred← citeshttps://doi.org/10.6028/nist.sp.800-142openalex-snapshot
Practical 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.