On the public citation graph

Heuristics-based infeasible path detection for dynamic test data generation

https://doi.org/10.1016/j.infsof.2007.06.006

0 signed · 86 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/(sici)1099-1689(199912)9:4<263::aid-stvr190>3.0.co;2-yopenalex-snapshot

Test-data generation using genetic algorithms

inferredcites →https://doi.org/10.1002/spe.684openalex-snapshot

Evolutionary test data generation: a comparison of fitness functions

inferredcites →https://doi.org/10.1007/11817963_38openalex-snapshot

CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools

inferredcites →https://doi.org/10.1007/978-3-540-31980-1_24openalex-snapshot

Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution

inferredcites →https://doi.org/10.1007/978-3-540-31984-9_20openalex-snapshot

Kaveri: Delivering the Indus Java Program Slicer to Eclipse

inferredcites →https://doi.org/10.1016/0950-5849(90)90110-dopenalex-snapshot

Predictive metric for likely feasibility of program paths

inferredcites →https://doi.org/10.1016/0950-5849(95)98039-iopenalex-snapshot

A path generation method for testing LCSAJs that restrains infeasible paths

inferredcites →https://doi.org/10.1016/j.infsof.2003.09.011openalex-snapshot

A structured experiment of test-driven development

inferredcites →https://doi.org/10.1109/32.57624openalex-snapshot

Automated software test data generation

inferredcites →https://doi.org/10.1109/32.83912openalex-snapshot

Using program slicing in software maintenance

inferredcites →https://doi.org/10.1109/32.988709openalex-snapshot

Generating software test data by evolution

inferredcites →https://doi.org/10.1109/ase.2000.873665openalex-snapshot

Identification of potentially infeasible program paths by monitoring the search for test data

inferredcites →https://doi.org/10.1109/ase.2000.873666openalex-snapshot

Generating test data for branch coverage

inferredcites →https://doi.org/10.1109/qsic.2003.1319109openalex-snapshot

Character string predicate based automatic software test data generation

inferredcites →https://doi.org/10.1109/sefm.2004.30openalex-snapshot

Path-oriented test data generation using symbolic execution and constraint solving techniques

inferredcites →https://doi.org/10.1109/tse.1976.233817openalex-snapshot

A System to Generate Test Data and Symbolically Execute Programs

inferredcites →https://doi.org/10.1142/s0218194001000487openalex-snapshot

A CONSTRAINT SOLVER AND ITS APPLICATION TO PATH FEASIBILITY ANALYSIS

inferredcites →https://doi.org/10.1142/s0218194002001074openalex-snapshot

AUTOMATIC TEST DATA GENERATION FOR PROGRAM PATHS USING GENETIC ALGORITHMS

inferredcites →https://doi.org/10.1145/1007512.1007526openalex-snapshot

Test input generation with java PathFinder

inferredcites →https://doi.org/10.1145/1007512.1007528openalex-snapshot

Evolutionary testing of classes

inferredcites →https://doi.org/10.1145/1062455.1062533openalex-snapshot

Check 'n' crash

inferredcites →https://doi.org/10.1145/186258.186523openalex-snapshot

Applications of feasible path analysis to program testing

inferredcites →https://doi.org/10.1145/1925805.1925818openalex-snapshot

Soot

inferredcites →https://doi.org/10.1145/226155.226158openalex-snapshot

The chaining approach for software test data generation

inferredcites →https://doi.org/10.1145/226295.226319openalex-snapshot

Automated test data generation for programs with procedures

inferredcites →https://doi.org/10.1145/229000.226319openalex-snapshot

Automated test data generation for programs with procedures

inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot

The program dependence graph and its use in optimization

inferredcites →https://doi.org/10.1145/258915.258929openalex-snapshot

Interprocedural conditional branch elimination

inferredcites →https://doi.org/10.1145/267895.267921openalex-snapshot

Refining data flow information using infeasible paths

inferredcites →https://doi.org/10.1145/267896.267921openalex-snapshot

Refining data flow information using infeasible paths

inferredcites →https://doi.org/10.1145/267896.267922openalex-snapshot

Feasible test path selection by principal slicing

inferredcites →https://doi.org/10.1145/288195.288321openalex-snapshot

Automated test data generation using an iterative relaxation method

inferredcites →https://doi.org/10.1145/75308.75315openalex-snapshot

Reducing the effects of infeasible paths in branch testing

inferredcites →https://doi.org/10.21236/ada484701openalex-snapshot

CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools (Tools Paper)

inferredcites →https://doi.org/10.6028/nist.ir.5737openalex-snapshot

A method to determine a basis set of paths to perform program testing

inferredcites →https://doi.org/10.6028/nist.sp.500-235openalex-snapshot

Structured 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-67163-1_6openalex-snapshot

On the Use of Meta-Heuristic Algorithms for Automated Test Suite Generation in Software Testing

inferred← citeshttps://doi.org/10.1007/978-3-319-19024-2_5openalex-snapshot

Finding the Critical Path with Loop Structure for a Basis Path Testing Using Genetic Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-642-21515-5_18openalex-snapshot

PSO Based Pseudo Dynamic Method for Automated Test Case Generation Using Interpreter

inferred← citeshttps://doi.org/10.1007/978-3-642-45422-6_5openalex-snapshot

Detection of Infeasible Paths: Approaches and Challenges

inferred← citeshttps://doi.org/10.1007/s00500-019-04444-yopenalex-snapshot

Performance analysis of six meta-heuristic algorithms over automated test suite generation for path coverage-based optimization

inferred← citeshttps://doi.org/10.1016/j.infsof.2008.11.001openalex-snapshot

Automated test data generation using a scatter search approach

inferred← citeshttps://doi.org/10.1016/j.infsof.2012.04.007openalex-snapshot

Reducing test effort: A systematic mapping study on existing approaches

inferred← citeshttps://doi.org/10.1016/j.infsof.2014.07.012openalex-snapshot

Infeasible path generalization in dynamic symbolic execution

inferred← citeshttps://doi.org/10.1016/j.infsof.2018.11.006openalex-snapshot

FSCT: A new fuzzy search strategy in concolic testing

inferred← citeshttps://doi.org/10.1016/j.ipl.2014.01.009openalex-snapshot

Automatic generation of basis test paths using variable length genetic algorithm

inferred← citeshttps://doi.org/10.1016/j.jss.2015.05.007openalex-snapshot

A UML model-based approach to detect infeasible paths

inferred← citeshttps://doi.org/10.1016/j.scico.2024.103183openalex-snapshot

Automatic detection of infeasible paths in large-scale program based on program summaries

inferred← citeshttps://doi.org/10.1049/iet-sen.2009.0092openalex-snapshot

Automatic detection of infeasible paths in software testing

inferred← citeshttps://doi.org/10.1049/iet-sen.2017.0112openalex-snapshot

Bayes‐TDG: effective test data generation using Bayesian belief network: toward failure‐detection effectiveness and maximum coverage

inferred← citeshttps://doi.org/10.1063/1.5055481openalex-snapshot

Infeasible paths in static analysis: Problems and challenges

inferred← citeshttps://doi.org/10.1109/access.2019.2894593openalex-snapshot

Detecting Interprocedural Infeasible Paths Based on Unsatisfiable Path Constraint Patterns

inferred← citeshttps://doi.org/10.1109/access.2019.2918558openalex-snapshot

An Approach for Detecting Infeasible Paths Based on a SMT Solver

inferred← citeshttps://doi.org/10.1109/ast.2015.21openalex-snapshot

Mining Patterns of Unsatisfiable Constraints to Detect Infeasible Paths

inferred← citeshttps://doi.org/10.1109/csmr-wcre.2014.6747227openalex-snapshot

Detecting infeasible branches based on code patterns

inferred← citeshttps://doi.org/10.1109/icsea.2010.74openalex-snapshot

A Symbolic Execution Tool Based on the Elimination of Infeasible Paths

inferred← citeshttps://doi.org/10.1109/icspis51611.2020.9349588openalex-snapshot

Automatic detection of infeasible ALL-DU paths in the data flow test using an evolutionary approach

inferred← citeshttps://doi.org/10.1109/icst.2010.13openalex-snapshot

Explanation-Based Generalization of Infeasible Path

inferred← citeshttps://doi.org/10.1109/icst.2015.7102607openalex-snapshot

Sound and Quasi-Complete Detection of Infeasible Test Requirements

inferred← citeshttps://doi.org/10.1109/inmic.2011.6151487openalex-snapshot

Improving path selection by handling loops in automatic test data generation

inferred← citeshttps://doi.org/10.1109/qrs-c65679.2025.00092openalex-snapshot

Research on Automatic Detection of Infeasible Paths Based on Symbolic Execution and Constraint Solving

inferred← citeshttps://doi.org/10.1109/rtas.2014.6926000openalex-snapshot

Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets

inferred← citeshttps://doi.org/10.1109/tase.2013.29openalex-snapshot

Feasibility Analysis of the EFSM Transition Path Combining Slicing with Theorem Proving

inferred← citeshttps://doi.org/10.1109/tse.2015.2490067openalex-snapshot

Bidirectional Symbolic Analysis for Effective Branch Testing

inferred← citeshttps://doi.org/10.1109/wcse.2009.328openalex-snapshot

Automatic Determination of Branch Correlations in Software Testing

inferred← citeshttps://doi.org/10.1142/s0218194025500457openalex-snapshot

A Reinforcement Learning-Based Approach for Determining Infeasible Paths of Programs

inferred← citeshttps://doi.org/10.1145/3180155.3180191openalex-snapshot

Time to clean your test objectives

inferred← citeshttps://doi.org/10.1145/3395363.3402646openalex-snapshot

Automatic support for the identification of infeasible testing requirements

inferred← citeshttps://doi.org/10.1145/3559744.3559748openalex-snapshot

A Strategy to Support the Infeasible Test Requirements Identification

inferred← citeshttps://doi.org/10.1155/2020/4258291openalex-snapshot

Infeasible Path Detection Based on Code Pattern and Backward Symbolic Execution

inferred← citeshttps://doi.org/10.11606/t.55.2023.tde-19122023-151021openalex-snapshot

Uma abordagem para apoiar a identificação de não executabilidade no teste estrutural de software

inferred← citeshttps://doi.org/10.12681/eadd/38297openalex-snapshot

Effective methods to tackle the equivalent mutant problem when testing software with mutation

inferred← citeshttps://doi.org/10.1504/ijbic.2013.053045openalex-snapshot

Heuristic search-based approach for automated test data generation: a survey

inferred← citeshttps://doi.org/10.1587/transinf.2015edp7121openalex-snapshot

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

inferred← citeshttps://doi.org/10.26190/unsworks/16384openalex-snapshot

Towards verified microkernels for real-time mixed-criticality systems

inferred← citeshttps://doi.org/10.32657/10356/41497openalex-snapshot

Applying program analysis augmented with empirical properties into software analysis, testing and maintenance

inferred← citeshttps://doi.org/10.32657/10356/61780openalex-snapshot

Augmenting static program analysis and design verification with pattern recognition

inferred← citeshttps://doi.org/10.3724/sp.j.1016.2008.01549openalex-snapshot

Sharp Static Analysis of Programs

inferred← citeshttps://doi.org/10.3923/jse.2012.65.78openalex-snapshot

Detecting Infeasible Paths via Mining Branch Correlations

inferred← citeshttps://doi.org/10.4156/ijact.vol4.issue1.56openalex-snapshot

Infeasible Basis Paths Detection of Program with Exception-Handling Constructs

inferred← citeshttps://doi.org/10.48550/arxiv.1011.0594openalex-snapshot

Heuristic Approach of Automated Test Data Generation for Program having Array of Different Dimensions and Loops with Variable Number of Iteration

inferred← citeshttps://doi.org/10.5121/ijcses.2011.2108openalex-snapshot

Automated Software Test Data Generation: Direction of Research

inferred← citeshttps://doi.org/10.5121/ijsea.2010.1405openalex-snapshot

Heuristic Approach of Automated Test Data Generation for Programs Having Array of Different Dimensions and Loops with Variable Number of Iteration

inferred← citeshttps://doi.org/10.5220/0003989002120217openalex-snapshot

Detecting Infeasible Traces in Process Models

inferred← citeshttps://doi.org/10.5815/ijieeb.2014.06.01openalex-snapshot

Diagnostic Path-Oriented Test Data Generation by Hyper Cuboids

inferred← citeshttps://doi.org/10.70675/5c48fbd2z0163z458ez9d37z9b9a04bfba0dopenalex-snapshot

Détermination de propriétés de flot de données pour améliorer les estimations de temps d'exécution pire-cas

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.