On the public citation graph
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
0 signed · 87 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.10059openalex-snapshot
Covering arrays with mixed alphabet sizes
inferredcites →https://doi.org/10.1002/jgt.3190120106openalex-snapshot
Searching for an edge in a graph
inferredcites →https://doi.org/10.1002/stvr.365openalex-snapshot
The density algorithm for pairwise interaction testing
inferredcites →https://doi.org/10.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferredcites →https://doi.org/10.1007/pl00009813openalex-snapshot
Approximating Probability Distributions Using Small Sample Spaces
inferredcites →https://doi.org/10.1007/s10878-007-9082-4openalex-snapshot
Locating and detecting arrays for interaction faults
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/j.tcs.2009.07.057openalex-snapshot
Covering arrays avoiding forbidden edges
inferredcites →https://doi.org/10.1104/pp.010683openalex-snapshot
Using Combinatorial Design to Study Regulation by Multiple Input Signals. A Tool for Parsimony in the Post-Genomics Era
inferredcites →https://doi.org/10.1109/18.6031openalex-snapshot
Vector sets for exhaustive testing of logic circuits
inferredcites →https://doi.org/10.1109/tse.2004.24openalex-snapshot
Software fault interactions and implications for software testing
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.1147/rd.282.0212openalex-snapshot
Iterative Exhaustive Pattern Generation for Logic Testing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-031-21385-4_28openalex-snapshot
Testing and Integration Method Utilization for Restricted Software Development
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_4openalex-snapshot
Mixed-Level Covering, Locating, and Detecting Arrays via Cyclotomy
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-642-12200-2_32openalex-snapshot
Finding the Best CAFE Is NP-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-15585-7_6openalex-snapshot
Bad Pairs in Software Testing
inferred← citeshttps://doi.org/10.1007/978-981-10-3482-4_8openalex-snapshot
An Efficient Algorithm to Identify Minimal Failure-Causing Schemas from Combinatorial Test Suite
inferred← citeshttps://doi.org/10.1007/s00022-011-0083-1openalex-snapshot
Constructing heterogeneous hash families by puncturing linear transversal designs
inferred← citeshttps://doi.org/10.1007/s10623-011-9498-9openalex-snapshot
The equivalence between optimal detecting arrays and super-simple OAs
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/s11219-024-09677-1openalex-snapshot
Two improving approaches for faulty interaction localization using logistic regression analysis
inferred← citeshttps://doi.org/10.1007/s11425-011-4307-5openalex-snapshot
Optimal locating arrays for at most two faults
inferred← citeshttps://doi.org/10.1007/s11786-018-0385-xopenalex-snapshot
On a Combinatorial Framework for Fault Characterization
inferred← citeshttps://doi.org/10.1007/s42081-019-00056-wopenalex-snapshot
Arrays for combinatorial interaction testing: a review on constructive approaches
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.disc.2011.10.026openalex-snapshot
Cover starters for covering arrays of strength two
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105202openalex-snapshot
Detecting arrays for effects of multiple interacting factors
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.07.011openalex-snapshot
Claims about the use of software engineering practices in science: A systematic literature review
inferred← citeshttps://doi.org/10.1016/j.infsof.2020.106346openalex-snapshot
Using simulated annealing for locating array construction
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.jss.2020.110771openalex-snapshot
Constrained locating arrays for combinatorial interaction testing
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.057openalex-snapshot
Covering arrays avoiding forbidden edges
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.010openalex-snapshot
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.005openalex-snapshot
An adaptive algorithm for group testing for complexes
inferred← citeshttps://doi.org/10.1080/00224065.2023.2220973openalex-snapshot
Scalable level-wise screening experiments using locating arrays
inferred← citeshttps://doi.org/10.1080/03610926.2020.1722841openalex-snapshot
Lower bound and construction of mixed-level locating arrays
inferred← citeshttps://doi.org/10.1109/access.2022.3151378openalex-snapshot
Locating Hardware Trojans Using Combinatorial Testing for Cryptographic Circuits
inferred← citeshttps://doi.org/10.1109/ic2e.2013.44openalex-snapshot
Adaptive Fault Detection for Testing Tenant Applications in Multi-tenancy SaaS Systems
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/icstw.2013.38openalex-snapshot
Identifying Failure-Inducing Combinations Using Tuple Relationship
inferred← citeshttps://doi.org/10.1109/icstw.2016.38openalex-snapshot
Coverage, Location, Detection, and Measurement
inferred← citeshttps://doi.org/10.1109/icstw.2019.00054openalex-snapshot
Efficient and Guaranteed Detection of t-Way Failure-Inducing Combinations
inferred← citeshttps://doi.org/10.1109/icstw.2019.00056openalex-snapshot
Partitioned Search with Column Resampling for Locating Array Construction
inferred← citeshttps://doi.org/10.1109/icstw50294.2020.00042openalex-snapshot
A Comparison Infrastructure for Fault Characterization Algorithms
inferred← citeshttps://doi.org/10.1109/icstw58534.2023.00049openalex-snapshot
Applying CT-FLA for AEB Function Testing: A Virtual Driving Case Study
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834368openalex-snapshot
Error-Correcting Locating Arrays for Interaction Fault Location in Combinatorial Testing
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/issrew.2014.34openalex-snapshot
Pinpointing Failure Inducing Event Orderings
inferred← citeshttps://doi.org/10.1109/mc.2013.408openalex-snapshot
Moving Forward with Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1109/prdc.2018.00044openalex-snapshot
Deriving Fault Locating Test Cases from Constrained Covering Arrays
inferred← citeshttps://doi.org/10.1109/qrs.2017.24openalex-snapshot
Improving Faulty Interaction Localization Using Logistic Regression
inferred← citeshttps://doi.org/10.1109/seai52285.2021.9477533openalex-snapshot
Machine Learning based Combinatorial Test Cases Ordering Approach
inferred← citeshttps://doi.org/10.1109/tr.2020.2975150openalex-snapshot
Combinatorial Testing of Browsers’ Support for Multimedia
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.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.2021.3113920openalex-snapshot
A Theory of Pending Schemas in Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/wcse.2013.19openalex-snapshot
Locating Faulty Code Using Failure-Causing Input Combinations in Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/wetice49692.2020.00050openalex-snapshot
A Two-Step Heuristic Algorithm for Generating Constrained Detecting Arrays for Combinatorial Interaction Testing
inferred← citeshttps://doi.org/10.1137/16m1056390openalex-snapshot
Disjoint Spread Systems and Fault Location
inferred← citeshttps://doi.org/10.1145/2001420.2001460openalex-snapshot
Characterizing failure-causing parameter interactions by adaptive testing
inferred← citeshttps://doi.org/10.1145/3634713.3634715openalex-snapshot
Incremental Identification of T-Wise Feature Interactions
inferred← citeshttps://doi.org/10.1145/3811916openalex-snapshot
Complete, Sound, and Scalable Identification of Minimal Failure-Causing Schema
inferred← citeshttps://doi.org/10.1186/s13638-023-02262-3openalex-snapshot
Measurement and evaluation method of radar anti-jamming effectiveness based on principal component analysis and machine learning
inferred← citeshttps://doi.org/10.13069/jacodesmath.17551openalex-snapshot
Locating one pairwise interaction: Three recursive constructions
inferred← citeshttps://doi.org/10.1587/transfun.2020eal2081openalex-snapshot
Upper Bounds and Constructions of Locating Arrays
inferred← citeshttps://doi.org/10.1587/transfun.2021eap1071openalex-snapshot
An Improved Adaptive Algorithm for Locating Faulty Interactions in Combinatorial Testing
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i38/102969openalex-snapshot
FTCI: A Tool to Identify Failure Triggering Combinations for Interaction Testing
inferred← citeshttps://doi.org/10.20381/ruor-19265openalex-snapshot
Covering arrays avoiding forbidden edges and edge clique covers
inferred← citeshttps://doi.org/10.20381/ruor-5890openalex-snapshot
Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing
inferred← citeshttps://doi.org/10.22215/etd/2009-09116openalex-snapshot
Projection - product and asymptotic constructions of mixed level covering arrays
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.23940/ijpe.19.10.p17.27092717openalex-snapshot
Comparing Minimal Failure-Causing Schema and Probabilistic Failure-Causing Schema on Boolean Specifications
inferred← citeshttps://doi.org/10.32920/ryerson.14661957openalex-snapshot
Error locating: degree constraints
inferred← citeshttps://doi.org/10.32920/ryerson.14661957.v1openalex-snapshot
Error locating: degree constraints
inferred← citeshttps://doi.org/10.3390/math8050831openalex-snapshot
Locating Arrays with Mixed Alphabet Sizes
inferred← citeshttps://doi.org/10.3390/sym10050146openalex-snapshot
Extended Covering Arrays for Sequence Coverage
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
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.