On the public citation graph

Finding Interaction Faults Adaptively Using Distance-Based Strategies

0 signed · 42 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/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
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.1002/stvr.393openalex-snapshot
A density‐based greedy algorithm for higher strength covering arrays
inferredcites →https://doi.org/10.1002/stvr.v19:1openalex-snapshot
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.1016/j.infsof.2006.03.004openalex-snapshot
Prioritized interaction testing for pair-wise coverage with seeding and constraints
inferredcites →https://doi.org/10.1080/00401706.1998.10485524openalex-snapshot
Factor-Covering Designs for Testing Software
inferredcites →https://doi.org/10.1109/32.328991openalex-snapshot
A Markov chain model for statistical software testing
inferredcites →https://doi.org/10.1109/32.689399openalex-snapshot
Empirical studies of a safe regression test selection technique
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/icfem.1998.730569openalex-snapshot
Using model checking to generate tests from specifications
inferredcites →https://doi.org/10.1109/icse.1994.296778openalex-snapshot
Experiments on the effectiveness of dataflow- and control-flow-based test adequacy criteria
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/isese.2004.1334893openalex-snapshot
Comparing the fault detection effectiveness of n-way and random test suites
inferredcites →https://doi.org/10.1109/isese.2004.16openalex-snapshot
Comparing the fault detection effectiveness of n-way and random test suites
inferredcites →https://doi.org/10.1109/issre.1995.497647openalex-snapshot
Antirandom testing: getting the most out of black-box 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.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/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.1145/62959.62964openalex-snapshot
The category-partition method for specifying and generating functional tests
inferredcites →https://doi.org/10.5555/257734.257766openalex-snapshot
Experiments on the effectiveness of dataflow- and control-flow-based test adequacy criteria
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.1007/978-981-10-4481-6_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-981-10-4481-6_4openalex-snapshot
Test Algebra for Concurrent Combinatorial Testing
inferred← citeshttps://doi.org/10.1007/s11786-018-0385-xopenalex-snapshot
On a Combinatorial Framework for Fault Characterization
inferred← citeshttps://doi.org/10.1109/compsac.2012.15openalex-snapshot
Adaptive Random Test Case Generation for 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/issre.2016.26openalex-snapshot
Distance-Integrated Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/tr.2018.2833449openalex-snapshot
Test-Algebra-Based Fault Location Analysis for the Concurrent Combinatorial Testing
inferred← citeshttps://doi.org/10.1109/tr.2019.2908068openalex-snapshot
Abstract Test Case Prioritization Using Repeated Small-Strength Level-Combination Coverage
inferred← citeshttps://doi.org/10.1155/2014/843248openalex-snapshot
Adaptive Random Testing with Combinatorial Input Domain
inferred← citeshttps://doi.org/10.26599/tst.2024.9010078openalex-snapshot
Prioritization of Abstract Test Cases by Weighting Covered Value Combinations
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.