On the public citation graph

IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testing

https://doi.org/10.1002/stvr.381
0 signed · 264 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/stvr.319openalex-snapshot
Combination testing strategies: a survey
inferredcites →https://doi.org/10.1002/stvr.365openalex-snapshot
The density algorithm for pairwise interaction testing
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.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.1023/a:1008379710317openalex-snapshot
Covering Arrays of Strength Three
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/aswec.2007.27openalex-snapshot
Managing Conflicts When Using Combination Strategies to Test Software
inferredcites →https://doi.org/10.1109/icse.2003.1201186openalex-snapshot
Constructing test suites for interaction testing
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/sew.2006.26openalex-snapshot
Pseudo-Exhaustive Testing for Software
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
inferredcites →https://doi.org/10.1142/s021853930100058xopenalex-snapshot
FAILURE MODES IN MEDICAL DEVICE SOFTWARE: AN ANALYSIS OF 15 YEARS OF RECALL DATA
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/4372.4375openalex-snapshot
Orthogonal Latin squares: an application of experiment design to compiler testing
inferredcites →https://doi.org/10.1214/aoms/1177729387openalex-snapshot
Orthogonal Arrays of Index Unity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/smr.2537openalex-snapshot
A novel combinatorial testing approach with fuzzing strategy
inferred← citeshttps://doi.org/10.1002/spe.1098openalex-snapshot
An empirical evaluation of several test‐a‐few strategies for testing particular conditions
inferred← citeshttps://doi.org/10.1002/stvr.1689openalex-snapshot
Approaches for computing test‐case‐aware covering arrays
inferred← citeshttps://doi.org/10.1002/stvr.466openalex-snapshot
T‐wise combinatorial interaction test suites construction based on coverage inheritance
inferred← citeshttps://doi.org/10.1007/978-3-030-17666-2_9openalex-snapshot
Effectiveness of Combinatorial Test Design with Executable Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-43120-4_24openalex-snapshot
IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-75884-4_6openalex-snapshot
Automated Driving Vehicles
inferred← citeshttps://doi.org/10.1007/978-3-031-17098-0_15openalex-snapshot
A Hierarchical Dependency-Driven Scenario-Based Testing for Autonomous Vehicles
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/978-3-319-18473-9_28openalex-snapshot
A Framework for Incremental Covering Arrays Construction
inferred← citeshttps://doi.org/10.1007/978-3-319-31895-0_22openalex-snapshot
Testing Autonomous and Highly Configurable Systems: Challenges and Feasible Solutions
inferred← citeshttps://doi.org/10.1007/978-3-319-42911-3_22openalex-snapshot
Generating Covering Arrays with Pseudo-Boolean Constraint Solving and Balancing Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-319-47443-4_16openalex-snapshot
Set-Based Algorithms for Combinatorial Test Set Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-61607-0_7openalex-snapshot
A Method for an Efficient, Systematic Test Case Generation for Advanced Driver Assistance Systems in Virtual Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-67549-7_10openalex-snapshot
Testing TLS Using Combinatorial Methods and Execution Framework
inferred← citeshttps://doi.org/10.1007/978-3-319-71734-0_15openalex-snapshot
Generating Cost-Aware Covering Arrays for Free
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_16openalex-snapshot
Evaluation of Tie-Breaking and Parameter Ordering for the IPO Family of Algorithms Used in Covering Array Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-99007-1_23openalex-snapshot
Self-adaptive Population Size Strategy Based on Flower Pollination Algorithm for T-Way Test Suite Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-14306-9_51openalex-snapshot
A Parallel Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing
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-22203-0_8openalex-snapshot
A Parallel Tree Based Strategy for T-Way Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-35615-5_28openalex-snapshot
An Effective Approach to Build Optimal T-way Interaction Test Suites over Cloud Using Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-43429-1_4openalex-snapshot
The IPO Family
inferred← citeshttps://doi.org/10.1007/978-3-662-44303-3_12openalex-snapshot
Using Genetic Improvement and Code Transplants to Specialise a C++ Program to a Problem Class
inferred← citeshttps://doi.org/10.1007/978-3-662-45919-5_4openalex-snapshot
The IPO Family
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/978-981-13-6031-2_17openalex-snapshot
A New Variable Strength t-Way Strategy Based on the Cuckoo Search Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-15-2317-5_12openalex-snapshot
Combinatorial Test Suite Generation Strategy Using Enhanced Sine Cosine Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-16-2183-3_100openalex-snapshot
Recent t-way Test Generation Strategies Based on Optimization Algorithms: An Orchestrated Survey
inferred← citeshttps://doi.org/10.1007/978-981-33-6104-1_3openalex-snapshot
Adaptive Neighbor Heuristics Flower Pollination Algorithm Strategy for Sequence Test Generation
inferred← citeshttps://doi.org/10.1007/s00500-019-03795-wopenalex-snapshot
Constraints handling in combinatorial interaction testing using multi-objective crow search and fruitfly optimization
inferred← citeshttps://doi.org/10.1007/s00500-020-04769-zopenalex-snapshot
An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications
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/s00521-023-09000-2openalex-snapshot
Q-learning whale optimization algorithm for test suite generation with constraints support
inferred← citeshttps://doi.org/10.1007/s00766-024-00421-6openalex-snapshot
Enhancing the requirements engineering of configurable systems by the ongoing use of variability models
inferred← citeshttps://doi.org/10.1007/s10664-019-09799-2openalex-snapshot
How does combinatorial testing perform in the real world: an empirical study
inferred← citeshttps://doi.org/10.1007/s10664-021-10017-1openalex-snapshot
CT-IoT: a combinatorial testing-based path selection framework for effective IoT testing
inferred← citeshttps://doi.org/10.1007/s11219-011-9160-9openalex-snapshot
Pairwise testing for software product lines: comparison of two approaches
inferred← citeshttps://doi.org/10.1007/s11219-018-9412-zopenalex-snapshot
Testing TLS using planning-based combinatorial methods and execution framework
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/s11786-021-00502-7openalex-snapshot
Factorials Experiments, Covering Arrays, and Combinatorial Testing
inferred← citeshttps://doi.org/10.1007/s12652-020-01696-7openalex-snapshot
Combinatorial test list generation based on Harmony Search 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.1007/s42979-024-03134-3openalex-snapshot
On the Impact of Input Models on the Fault Detection Capabilities of 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.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.03.021openalex-snapshot
A Tabu Search hyper-heuristic strategy for t-way test suite generation
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.asoc.2020.106219openalex-snapshot
Extracting Combinatorial Test parameters and their values using model checking and evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.111070openalex-snapshot
Combinatorial t-way test suite generation using an improved asexual reproduction optimization algorithm
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.2012.01.002openalex-snapshot
Design and implementation of a harmony-search-based variable-strength t-way testing strategy with constraints support
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.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.2015.11.007openalex-snapshot
Practical minimization of pairwise-covering test configurations using constraint programming
inferred← citeshttps://doi.org/10.1016/j.infsof.2017.02.004openalex-snapshot
Handling constraints in combinatorial interaction testing in the presence of multi objective particle swarm and multithreading
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.2020.106288openalex-snapshot
WCA: A weighting local search for constrained combinatorial test optimization
inferred← citeshttps://doi.org/10.1016/j.infsof.2021.106768openalex-snapshot
An Adaptive Penalty based Parallel Tabu Search for Constrained Covering Array Generation
inferred← citeshttps://doi.org/10.1016/j.infsof.2022.107045openalex-snapshot
Constrained detecting arrays: Mathematical structures for fault identification in combinatorial interaction testing
inferred← citeshttps://doi.org/10.1016/j.infsof.2022.107080openalex-snapshot
Detecting false-passing products and mitigating their impact on variability fault localization in software product lines
inferred← citeshttps://doi.org/10.1016/j.infsof.2024.107601openalex-snapshot
Top-down: A better strategy for incremental covering array generation
inferred← citeshttps://doi.org/10.1016/j.infsof.2026.108255openalex-snapshot
An effective covering array generation algorithm based on rollback and candidate-based test case removal strategies
inferred← citeshttps://doi.org/10.1016/j.ins.2011.01.002openalex-snapshot
Design and implementation of a t-way test data generation strategy with automated execution tool support
inferred← citeshttps://doi.org/10.1016/j.jestch.2015.11.006openalex-snapshot
Test case minimization approach using fault detection and combinatorial optimization techniques for configuration-aware structural testing
inferred← citeshttps://doi.org/10.1016/j.jksuci.2021.06.020openalex-snapshot
Gravitational search algorithm based strategy for combinatorial t-way test suite generation
inferred← citeshttps://doi.org/10.1016/j.jksuci.2022.11.010openalex-snapshot
SCIPOG: Seeding and constraint support in IPOG strategy for combinatorial t-way testing to generate optimum test cases
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.104791openalex-snapshot
Effectively computing high strength mixed covering arrays with constraints
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.2013.02.061openalex-snapshot
An orchestrated survey of methodologies for automated software test case generation
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.jss.2014.09.002openalex-snapshot
Aggregate-strength interaction test suite prioritization
inferred← citeshttps://doi.org/10.1016/j.jss.2022.111353openalex-snapshot
CIT-daily: A combinatorial interaction testing-based daily build process
inferred← citeshttps://doi.org/10.1016/j.matcom.2018.10.010openalex-snapshot
M-PCM-OFFD: An effective output statistics estimation method for systems of high dimensional uncertainties subject to low-order parameter interactions
inferred← citeshttps://doi.org/10.1016/j.matpr.2021.04.138openalex-snapshot
Amalgamation and characterization for test Suite enhancement in software testing using data mining techniques
inferred← citeshttps://doi.org/10.1016/j.measurement.2013.02.021openalex-snapshot
Combinatorial testing for software: An adaptation of design of experiments
inferred← citeshttps://doi.org/10.1016/j.procs.2015.09.040openalex-snapshot
3-way Interaction Testing Using the Tree Strategy
inferred← citeshttps://doi.org/10.1016/j.procs.2015.09.099openalex-snapshot
A Parallel Tree Based Strategy for 3-way Interaction Testing
inferred← citeshttps://doi.org/10.1049/iet-sen.2018.5005openalex-snapshot
Adapting the elitism on greedy algorithm for variable strength combinatorial test cases generation
inferred← citeshttps://doi.org/10.1049/sfw2.12054openalex-snapshot
A synergic quantum particle swarm optimisation for constrained combinatorial test generation
inferred← citeshttps://doi.org/10.1049/sfw2.12104openalex-snapshot
A systematic review on search‐based test suite reduction: State‐of‐the‐art, taxonomy, and future directions
inferred← citeshttps://doi.org/10.1088/1742-6596/1830/1/012013openalex-snapshot
Hybrid Migrating Birds Optimization Strategy for t-way Test Suite Generation
inferred← citeshttps://doi.org/10.1088/1757-899x/767/1/012009openalex-snapshot
Implementation of Sine Cosine Algorithm (SCA) for Combinatorial Testing
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.2017.2771562openalex-snapshot
Constrained Interaction Testing: A Systematic Literature Study
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/access.2020.3032851openalex-snapshot
Combinatorial Test Suites Generation Strategy Utilizing the Whale Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/access.2020.3033888openalex-snapshot
Using Deep Reinforcement Learning for Exploratory Performance Testing of Software Systems With Multi-Dimensional Input Spaces
inferred← citeshttps://doi.org/10.1109/access.2021.3055367openalex-snapshot
An Adaptive Opposition-Based Learning Selection: The Case for Jaya Algorithm
inferred← citeshttps://doi.org/10.1109/access.2022.3188856openalex-snapshot
Construction of Prioritized T-Way Test Suite Using Bi-Objective Dragonfly Algorithm
inferred← citeshttps://doi.org/10.1109/afrcon.2013.6757749openalex-snapshot
PWTool, A novel automated tool for pairwise testing
inferred← citeshttps://doi.org/10.1109/ams.2010.14openalex-snapshot
PSTG: A T-Way Strategy Adopting Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1109/ams.2010.15openalex-snapshot
Interaction Testing: From Pairwise to Variable Strength Interaction
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/ase.2019.00053openalex-snapshot
Feature-Interaction Aware Configuration Prioritization for Configurable Code
inferred← citeshttps://doi.org/10.1109/asew60602.2023.00027openalex-snapshot
Continuous Domain Input Abstraction and Fault Detection Capability in Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/ast58925.2023.00013openalex-snapshot
Better Safe Than Sorry! Automated Identification of Functionality-Breaking Security-Configuration Rules
inferred← citeshttps://doi.org/10.1109/compsac.2013.84openalex-snapshot
Prioritizing Variable-Strength Covering Array
inferred← citeshttps://doi.org/10.1109/compsac.2016.167openalex-snapshot
Prioritizing Interaction Test Suites Using Repeated Base Choice Coverage
inferred← citeshttps://doi.org/10.1109/compsacw.2013.25openalex-snapshot
Incrementally Applicable t-Wise Combinatorial Test Suites for High-Strength Interaction Testing
inferred← citeshttps://doi.org/10.1109/hase.2008.53openalex-snapshot
An Interaction-Based Test Sequence Generation Approach for Testing Web Applications
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/iccoins.2018.8510601openalex-snapshot
Artificial Bee Colony Algorithm for t-Way Test Suite Generation
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/iccsce.2015.7482175openalex-snapshot
Assessing optimization based strategies for t-way test suite generation: The case for flower-based strategy
inferred← citeshttps://doi.org/10.1109/icdi57181.2022.10007210openalex-snapshot
Proposed Method of Seeding and Constraint in One-Parameter-At-a- Time Approach for t-way Testing
inferred← citeshttps://doi.org/10.1109/iceccs20050.2012.6299217openalex-snapshot
Efficient Algorithms for T-way Test Sequence Generation
inferred← citeshttps://doi.org/10.1109/icraect.2017.62openalex-snapshot
Recast IPOG-D Algorithm with Constraint Handling for Combinatorial Testing
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/icse.2019.00112openalex-snapshot
Distance-Based Sampling of Software Configuration Spaces
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/icsecs.2015.7333096openalex-snapshot
Adopting search-based algorithms for pairwise testing
inferred← citeshttps://doi.org/10.1109/icsess.2012.6269509openalex-snapshot
Sole error locating array and approximate error locating array
inferred← citeshttps://doi.org/10.1109/icsm.2009.5306321openalex-snapshot
A combinatorial approach to building navigation graphs for dynamic web applications
inferred← citeshttps://doi.org/10.1109/icsrs.2017.8272871openalex-snapshot
Combinatorial testing data generation based on bird swarm algorithm
inferred← citeshttps://doi.org/10.1109/icst.2012.117openalex-snapshot
Identifying Failure-Inducing Combinations in a Combinatorial Test Set
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.53openalex-snapshot
Combinatorial Interaction Testing with CITLAB
inferred← citeshttps://doi.org/10.1109/icst.2017.58openalex-snapshot
Test Design as Code: JCUnit
inferred← citeshttps://doi.org/10.1109/icst62969.2025.10989003openalex-snapshot
Coverage Metrics for T-Wise Feature Interactions
inferred← citeshttps://doi.org/10.1109/icstw.2013.37openalex-snapshot
Cascade: A Test Generation Tool for Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/icstw.2013.45openalex-snapshot
Combinatorial Testing for Feature Models Using CitLab
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.7107436openalex-snapshot
Evaluation of the IPO-Family algorithms for test case generation in web security testing
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.2016.7openalex-snapshot
Towards Automatic Cost Model Discovery for Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/icstw.2016.8openalex-snapshot
Should We Care about "Don't Care" Testing Inputs?: Empirical Investigation of Pair-Wise Testing
inferred← citeshttps://doi.org/10.1109/icstw.2017.36openalex-snapshot
Mutation Score, Coverage, Model Inference: Quality Assessment for T-Way Combinatorial Test-Suites
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/icstw.2019.00060openalex-snapshot
Using Parameter Mapping to Avoid Forbidden Tuples in a Covering Array
inferred← citeshttps://doi.org/10.1109/icstw52544.2021.00022openalex-snapshot
A Combinatorial Approach to Testing Deep Neural Network-based Autonomous Driving Systems
inferred← citeshttps://doi.org/10.1109/icstw55395.2022.00026openalex-snapshot
A C++ implementation of the IPO algorithm
inferred← citeshttps://doi.org/10.1109/icstw55395.2022.00028openalex-snapshot
A Constrained Covering Array Generator using Adaptive Penalty based Parallel Tabu Search
inferred← citeshttps://doi.org/10.1109/icstw58534.2023.00043openalex-snapshot
Meta-Heuristic Algorithm for Constructing Higher-Index Covering Arrays for Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/isiea.2009.5356419openalex-snapshot
Assessing combinatorial interaction strategy for reverse engineering of combinational circuits
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.5679441openalex-snapshot
Effectiveness of the cumulative vs. normal mode of operation for combinatorial testing
inferred← citeshttps://doi.org/10.1109/isiea.2011.6108767openalex-snapshot
Input-input relationship constraints in T-way testing
inferred← citeshttps://doi.org/10.1109/isiea.2011.6108773openalex-snapshot
Comparison of metahuristic test generation strategies based on interaction elements coverage criterion
inferred← citeshttps://doi.org/10.1109/isiea.2011.6108775openalex-snapshot
Interaction test data generation using Harmony Search Algorithm
inferred← citeshttps://doi.org/10.1109/isms.2014.119openalex-snapshot
Event Driven Input Sequence T-Way Test Strategy Using Simulated Annealing
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/issre.2015.7381817openalex-snapshot
Boundary value analysis in automatic white-box test generation
inferred← citeshttps://doi.org/10.1109/issre.2017.10openalex-snapshot
An Exploratory Study of Field Failures
inferred← citeshttps://doi.org/10.1109/kse.2019.8919456openalex-snapshot
A Combinatorial Technique for Mobile Applications Software Testing
inferred← citeshttps://doi.org/10.1109/mc.2015.114openalex-snapshot
Introducing Combinatorial Testing in a Large Organization
inferred← citeshttps://doi.org/10.1109/mrl.2024.3355874openalex-snapshot
Combinatorial Testing for Building Reliable Systems
inferred← citeshttps://doi.org/10.1109/mysec.2011.6140686openalex-snapshot
Prioritizing interaction test suite for t-way testing
inferred← citeshttps://doi.org/10.1109/prdc.2017.19openalex-snapshot
Generating High Strength Test Suites for Combinatorial Interaction Testing Using ZDD-Based Graph Algorithms
inferred← citeshttps://doi.org/10.1109/qrs-c.2017.131openalex-snapshot
Improving MC/DC and Fault Detection Strength Using Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/qrs-c.2017.18openalex-snapshot
Combinatorial Methods of Feature Selection for Cell Image Classification
inferred← citeshttps://doi.org/10.1109/qrs-c.2017.21openalex-snapshot
An Approach for Choosing the Best Covering Array Constructor to Use
inferred← citeshttps://doi.org/10.1109/qrs-c.2017.23openalex-snapshot
Can Pairwise Testing Perform Comparably to Manually Handcrafted Testing Carried Out by Industrial Engineers?
inferred← citeshttps://doi.org/10.1109/qrs-c.2018.00072openalex-snapshot
An Unsupervised Parameter Grouping Algorithm for Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/qrs.2016.15openalex-snapshot
How Effective Is Branch-Based Combinatorial Testing? An Exploratory Study
inferred← citeshttps://doi.org/10.1109/qrs.2016.16openalex-snapshot
Applying Combinatorial Testing in Industrial Settings
inferred← citeshttps://doi.org/10.1109/qrs.2018.00055openalex-snapshot
Combinatorial Modeling and Test Case Generation for Industrial Control Software Using ACTS
inferred← citeshttps://doi.org/10.1109/qrs54544.2021.00038openalex-snapshot
On the Automation of Audio Plugin Testing
inferred← citeshttps://doi.org/10.1109/qsic.2010.36openalex-snapshot
Adaptive Interaction Fault Location Based on Combinatorial Testing
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/rose.2019.00006openalex-snapshot
Exposing Off-Nominal Behaviors in Multi-Robot Coordination
inferred← citeshttps://doi.org/10.1109/sbst.2015.11openalex-snapshot
Constraints: The Future of Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/scored.2015.7449424openalex-snapshot
Sequence and sequence-less T-way test suite generation strategy based on flower pollination algorithm
inferred← citeshttps://doi.org/10.1109/skima.2014.7083520openalex-snapshot
MTTG: An efficient technique for test data generation
inferred← citeshttps://doi.org/10.1109/tr.2018.2847247openalex-snapshot
Finding Bugs in Cryptographic Hash Function Implementations
inferred← citeshttps://doi.org/10.1109/tse.2011.85openalex-snapshot
Formal Analysis of the Probability of Interaction Fault Detection Using Random Testing
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.2015.2421279openalex-snapshot
Practical Combinatorial Interaction Testing: Empirical Findings on Efficiency and Early Fault Detection
inferred← citeshttps://doi.org/10.1109/tse.2017.2702606openalex-snapshot
Specialising Software for Different Downstream Applications Using Genetic Improvement and Code Transplantation
inferred← citeshttps://doi.org/10.1109/tse.2018.2837759openalex-snapshot
CHiP: A Configurable Hybrid Parallel Covering Array Constructor
inferred← citeshttps://doi.org/10.1109/tse.2018.2844259openalex-snapshot
Identifying Failure-Causing Schemas in the Presence of Multiple Faults
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.2018.2865935openalex-snapshot
A Combinatorial Testing-Based Approach to Fault Localization
inferred← citeshttps://doi.org/10.1109/tse.2019.2955687openalex-snapshot
Comparative Analysis of Constraint Handling Techniques for Constrained Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/tse.2020.3007560openalex-snapshot
ConEx: Efficient Exploration of Big-Data System Configurations for Better Performance
inferred← citeshttps://doi.org/10.1109/tse.2020.3010317openalex-snapshot
Flexible Combinatorial Interaction Testing
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.1109/tse.2023.3306461openalex-snapshot
An Effective Approach to High Strength Covering Array Generation in Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/tse.2024.3419919openalex-snapshot
A Scalable t-Wise Coverage Estimator: Algorithms and Applications
inferred← citeshttps://doi.org/10.1109/wetice.2009.52openalex-snapshot
Building T-wise Combinatorial Interaction Test Suites by Means of Grid Computing
inferred← citeshttps://doi.org/10.1109/wsc.2014.7019936openalex-snapshot
Effective and scalable uncertainty evaluation for large-scale complex system applications
inferred← citeshttps://doi.org/10.1142/s0218194013500459openalex-snapshot
PRIORITIZATION OF COMBINATORIAL TEST CASES BY INCREMENTAL INTERACTION COVERAGE
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/3341105.3373952openalex-snapshot
Constrained detecting arrays for fault localization in combinatorial testing
inferred← citeshttps://doi.org/10.1145/3368089.3409744openalex-snapshot
Baital: an adaptive weighted sampling approach for improved t-wise coverage
inferred← citeshttps://doi.org/10.1145/3528100openalex-snapshot
HINNPerf: Hierarchical Interaction Neural Network for Performance Prediction of Configurable Systems
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/2010/323429openalex-snapshot
A Strategy for Automatic Quality Signing and Verification Processes for Hardware and Software Testing
inferred← citeshttps://doi.org/10.1155/acis/2108076openalex-snapshot
A 2‐Dimensional Search Space Representation for Combinatorial T‐Way Test Suite Generator Using the Whale Optimization Algorithm
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.12677/sea.2020.92018openalex-snapshot
Combinatorial Test Case Generation Method Based on Improved Particle Swarm Optimization Algorithm
showing the first 200 of 246 · page through all 246
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.