On the public citation graph

Infeasible path generalization in dynamic symbolic execution

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

0 signed · 50 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.1007/11408901_21openalex-snapshot

PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis

inferredcites →https://doi.org/10.1007/11814948_5openalex-snapshot

A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

inferredcites →https://doi.org/10.1007/3-540-45349-0_19openalex-snapshot

Maintaining Arc-Consistency within Dynamic Backtracking

inferredcites →https://doi.org/10.1007/978-3-540-72788-0_32openalex-snapshot

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories

inferredcites →https://doi.org/10.1007/978-3-540-74105-3openalex-snapshot

Decision Procedures: An Algorithmic Point of View

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

Z3: An Efficient SMT Solver

inferredcites →https://doi.org/10.1007/978-3-540-78800-3_27openalex-snapshot

RWset: Attacking Path Explosion in Constraint-Based Test Generation

inferredcites →https://doi.org/10.1007/978-3-540-79124-9_10openalex-snapshot

Pex–White Box Test Generation for .NET

inferredcites →https://doi.org/10.1007/bf00995175openalex-snapshot

The applicability of program schema results to programs

inferredcites →https://doi.org/10.1007/s10664-005-3861-2openalex-snapshot

Supporting Controlled Experimentation with Testing Techniques: An Infrastructure and its Potential Impact

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

Heuristics-based infeasible path detection for dynamic test data generation

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

Mutation based test case generation via a path selection strategy

inferredcites →https://doi.org/10.1016/j.tcs.2006.01.012openalex-snapshot

Theoretical foundations of dynamic program slicing

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

Test sequences generation from LUSTRE descriptions: GATEL

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

Heuristics for Scalable Dynamic Test Generation

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

Detecting equivalent mutants and the feasible path problem

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

Fitness-guided path exploration in dynamic symbolic execution

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

A Symbolic Execution Tool Based on the Elimination of Infeasible Paths

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

Structural Testing of Executables

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

Explanation-Based Generalization of Infeasible Path

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

A Value Analysis for C Programs

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

Path slicing

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

DART

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

DART

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

CUTE

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

Detecting large number of infeasible paths through recognizing their patterns

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

Exploiting program dependencies for scalable multiple-path symbolic execution

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

Green

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

Boosting concolic testing via interpolation

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

A new approach to program testing

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

Reducing the effects of infeasible paths in branch testing

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

Reducing the effects of infeasible paths in branch testing

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

Proceedings of the international conference on Reliable software -

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-19212-9_1openalex-snapshot

Constraint Programming for Dynamic Symbolic Execution of JavaScript

inferred← citeshttps://doi.org/10.1016/j.csi.2020.103444openalex-snapshot

A Systematic Review of Search Strategies 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.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/ast52587.2021.00022openalex-snapshot

Towards exhaustive branch coverage with PathCrawler

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/kse50997.2020.9287629openalex-snapshot

Generate Test Data from C/C++ Source Code using Weighted CFG and Boundary Values

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.1142/s0218001417500124openalex-snapshot

Interactive WCET Prediction with Warning for Timeout Risk

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.17559/tv-20170324111348openalex-snapshot

A hybrid backtracking algorithm for automatic test data generation

inferred← citeshttps://doi.org/10.21203/rs.3.rs-2796131/v1openalex-snapshot

Automatic Test Data Generation based on the Prime Path Coverage Criterion: A Grouping-based GA Approach

inferred← citeshttps://doi.org/10.3837/tiis.2019.11.011openalex-snapshot

A Strategy for Multi-target Paths Coverage by Improving Individual Information Sharing

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.