On the public citation graph
Enhancing mirror adaptive random testing through dynamic partitioning
0 signed · 65 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.1007/11767077_13openalex-snapshot
Adaptive Random Testing Through Iterative Partitioning
inferredcites →https://doi.org/10.1016/0951-8320(91)90052-9openalex-snapshot
NASA Software failure characterization experiments
inferredcites →https://doi.org/10.1016/j.infsof.2004.07.004openalex-snapshot
Mirror adaptive random testing
inferredcites →https://doi.org/10.1016/j.jss.2013.02.061openalex-snapshot
An orchestrated survey of methodologies for automated software test case generation
inferredcites →https://doi.org/10.1109/12.2185openalex-snapshot
Data diversity: an approach to software fault tolerance
inferredcites →https://doi.org/10.1109/32.707695openalex-snapshot
Evaluating testing methods by delivered reliability [software]
inferredcites →https://doi.org/10.1109/ase.2009.13openalex-snapshot
A Divergence-Oriented Approach to Adaptive Random Testing of Java Programs
inferredcites →https://doi.org/10.1109/c-m.1978.217941openalex-snapshot
A Case Study of Simulation as a Computer System Design Tool
inferredcites →https://doi.org/10.1109/c-m.1978.218136openalex-snapshot
Hints on Test Data Selection: Help for the Practicing Programmer
inferredcites →https://doi.org/10.1109/ftcs.1993.627312openalex-snapshot
The variation of software survival time for different operational input profiles (or why you can wait a long time for a big bug to fail)
inferredcites →https://doi.org/10.1109/qsic.2003.1319079openalex-snapshot
Mirror adaptive random testing
inferredcites →https://doi.org/10.1109/qsic.2003.1319081openalex-snapshot
Random program generator for Java JIT compiler test system
inferredcites →https://doi.org/10.1109/qsic.2004.1357947openalex-snapshot
Adaptive random testing through dynamic partitioning
inferredcites →https://doi.org/10.1109/qsic.2004.6openalex-snapshot
Adaptive random testing through dynamic partitioning
inferredcites →https://doi.org/10.1109/qsic.2009.15openalex-snapshot
An Indepth Study of Mirror Adaptive Random Testing
inferredcites →https://doi.org/10.1109/qsic.2013.19openalex-snapshot
The ART of Divide and Conquer: An Innovative Approach to Improving the Efficiency of Adaptive Random Testing
inferredcites →https://doi.org/10.1109/tse.1980.234486openalex-snapshot
A Domain Strategy for Computer Program Testing
inferredcites →https://doi.org/10.1109/tse.2012.18openalex-snapshot
Centroidal Voronoi Tessellations- A New Approach to Random Testing
inferredcites →https://doi.org/10.1142/s0218194006002926openalex-snapshot
RESTRICTED RANDOM TESTING: ADAPTIVE RANDOM TESTING BY EXCLUSION
inferredcites →https://doi.org/10.1142/s0218194007003501openalex-snapshot
ON FAVOURABLE CONDITIONS FOR ADAPTIVE RANDOM TESTING
inferredcites →https://doi.org/10.1145/1086228.1086282openalex-snapshot
Random testing of interrupt-driven software
inferredcites →https://doi.org/10.1145/1101908.1101963openalex-snapshot
Lattice-based adaptive random testing
inferredcites →https://doi.org/10.1145/1159733.1159751openalex-snapshot
An empirical analysis and comparison of random testing techniques
inferredcites →https://doi.org/10.1145/2430536.2430540openalex-snapshot
Achieving scalable model-based testing through test case diversity
inferredcites →https://doi.org/10.1145/2593882.2593885openalex-snapshot
Software testing: a research travelogue (2000–2014)
inferredcites →https://doi.org/10.1145/96267.96279openalex-snapshot
An empirical study of the reliability of UNIX utilities
inferredcites →https://doi.org/10.25916/sut.26244137openalex-snapshot
On Adaptive Random Testing through iterative partitioning
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-319-71767-8_47openalex-snapshot
An Optimized Adaptive Random Partition Software Testing by Using Bacterial Foraging Algorithm
inferred← citeshttps://doi.org/10.1007/s00500-024-09680-5openalex-snapshot
Dynamic domain testing with multi-agent Markov chain Monte Carlo method
inferred← citeshttps://doi.org/10.1007/s11219-022-09599-wopenalex-snapshot
A dynamic random testing strategy in the context of cloud computing
inferred← citeshttps://doi.org/10.1016/j.infsof.2020.106470openalex-snapshot
Dynamic random testing with test case clustering and distance-based parameter adjustment
inferred← citeshttps://doi.org/10.1016/j.jss.2021.111008openalex-snapshot
SWFC-ART: A cost-effective approach for Fixed-Size-Candidate-Set Adaptive Random Testing through small world graphs
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102730openalex-snapshot
Candidate test set reduction for adaptive random testing: An overheads reduction technique
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102743openalex-snapshot
A nearest-neighbor divide-and-conquer approach for adaptive random testing
inferred← citeshttps://doi.org/10.1049/iet-sen.2017.0208openalex-snapshot
A cost‐effective adaptive random testing approach by dynamic restriction
inferred← citeshttps://doi.org/10.1049/iet-sen.2019.0325openalex-snapshot
Adaptive random testing based on flexible partitioning
inferred← citeshttps://doi.org/10.1049/sfw2/4814836openalex-snapshot
Proximity‐Based Filtering: An Improved Adaptive Random Testing Approach Based on Orthogonal Bisections and Imaginary Offsets
inferred← citeshttps://doi.org/10.1109/access.2019.2919160openalex-snapshot
Elimination by Linear Association: An Effective and Efficient Static Mirror Adaptive Random Testing
inferred← citeshttps://doi.org/10.1109/ccdc.2017.7978795openalex-snapshot
Comparison analysis of two test case prioritization approaches with the core idea of adaptive
inferred← citeshttps://doi.org/10.1109/dsa52907.2021.00086openalex-snapshot
KD-RRT: Restricted Random Testing based on K-Dimensional Tree
inferred← citeshttps://doi.org/10.1109/iccke.2018.8566625openalex-snapshot
Arselda: An Improvement on Adaptive Random Testing by Adaptive Region Selection
inferred← citeshttps://doi.org/10.1109/icosnikom56551.2022.10034907openalex-snapshot
Test Case Prioritization by Combining Mirror Adaptive Random Testing and Forgetting
inferred← citeshttps://doi.org/10.1109/issre5003.2020.00034openalex-snapshot
FSCS-SIMD: An efficient implementation of Fixed-Size-Candidate-Set adaptive random testing using SIMD instructions
inferred← citeshttps://doi.org/10.1109/qrs.2017.13openalex-snapshot
Improving Random Test Sets Using a Locally Spreading Approach
inferred← citeshttps://doi.org/10.1109/qrs.2019.00019openalex-snapshot
A Distance-Based Dynamic Random Testing with Test Case Clustering
inferred← citeshttps://doi.org/10.1109/qrs.2019.00020openalex-snapshot
Random Border Mirror Transform: A Diversity Based Approach to an Effective and Efficient Mirror Adaptive Random Testing
inferred← citeshttps://doi.org/10.1109/qrs54544.2021.00036openalex-snapshot
MMFC-ART: a Fixed-size-Candidate-set Adaptive Random Testing approach based on the modified Metric-Memory tree
inferred← citeshttps://doi.org/10.1109/qrs57517.2022.00089openalex-snapshot
A Distance-Based Dynamic Random Testing Strategy for Natural Language Processing DNN Models
inferred← citeshttps://doi.org/10.1109/qrs62785.2024.00011openalex-snapshot
A Strategy of Dynamic Random Testing with Hybrid Distance Metrics for Quantum Programs
inferred← citeshttps://doi.org/10.1109/tetci.2020.3013713openalex-snapshot
Identification of Failure Regions for Programs With Numeric Inputs
inferred← citeshttps://doi.org/10.1109/tr.2019.2892230openalex-snapshot
KDFC-ART: a KD-tree approach to enhancing Fixed-size-Candidate-set Adaptive Random Testing
inferred← citeshttps://doi.org/10.1109/tr.2019.2907577openalex-snapshot
One-Domain-One-Input: Adaptive Random Testing by Orthogonal Recursive Bisection With Restriction
inferred← citeshttps://doi.org/10.1109/tr.2019.2911593openalex-snapshot
Dynamic Random Testing: Technique and Experimental Evaluation
inferred← citeshttps://doi.org/10.1109/tr.2022.3218602openalex-snapshot
VPP-ART: An Efficient Implementation of Fixed-Size-Candidate-Set Adaptive Random Testing Using Vantage Point Partitioning
inferred← citeshttps://doi.org/10.1109/tse.2019.2942921openalex-snapshot
A Survey on Adaptive Random Testing
inferred← citeshttps://doi.org/10.1142/s0218194020500308openalex-snapshot
A Proactive Approach to Test Case Selection — An Efficient Implementation of Adaptive Random Testing
inferred← citeshttps://doi.org/10.1145/3412841.3442128openalex-snapshot
Which type of exclusion region is better for restricted random testing?
inferred← citeshttps://doi.org/10.2139/ssrn.6958671openalex-snapshot
Q-HDRT: A Hybrid-distance-guided Dynamic Random Testing Strategy for Quantum Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1909.10879openalex-snapshot
A Taxonomic Review of Adaptive Random Testing: Current Status, Classifications, and Issues
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.