Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"path explosion"”.

  1. Increasing Program Code Coverage Using Fuzzing and Targeted Branch Exploration

    … Exhaustive enumeration of possible input paths to every code region is desirable in theory but computationally infeasible in practice, especially in large-scale codebases. Fuzzing is a widely used technique for input generation and is effective at exploring smaller programs but often …

    mit Repository record for Increasing Program Code Coverage Using Fuzzing and Targeted Branch Exploration (opens in a new tab)

  2. Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution

    … program behaviors by exploring all feasible paths. For each path it explores, it builds a path condition, and checks the path's feasibility by solving its corresponding path condition using off-the-shelf constraint solvers. Symbolic execution is a powerful program analysis technique and has …

    texas-state Repository record for Parallelizing Path Exploration and Optimizing Constraint Solving for Efficient Symbolic Execution (opens in a new tab)

  3. Strategies for Scalable Symbolic Execution-based Test Generation

    … have been shown to be very effective in path-based test generation; however, they fail to scale to large programs due to the exponential number of paths to be explored. In this thesis, we focus on tackling this path explosion problem and propose search strategies to achieve quick branch …

    vt Repository record for Strategies for Scalable Symbolic Execution-based Test Generation (opens in a new tab)

  4. An Efficient 2-Phase Strategy to Achieve High Branch Coverage

    … execution-based test generation because of the path explosion problem. We present a new 2-phase symbolic execution driven strategy that achieves high branch coverage in software quickly. Phase 1 follows a greedy approach that quickly covers as many branches as possible by exploring each branch …

    vt Repository record for An Efficient 2-Phase Strategy to Achieve High Branch Coverage (opens in a new tab)

  5. Partitioning Strategies to Enhance Symbolic Execution

    … consumes about half of the development cost. The path explosion problem often necessitates one to consider an extremely large number of paths in order to reach a specific target. Symbolic execution can reduce this cost by using symbolic values and heuristic exploration strategies. Although various …

    vt Repository record for Partitioning Strategies to Enhance Symbolic Execution (opens in a new tab)

  6. Harmonizing data mining and static analysis to tackle hardware and system level verification

    … for generating input vector patterns for all paths of an RTL design using RTL symbolic execution. To attack the path explosion problem in STAR, we present HYBRO and the symbolic state caching method. HYBRO uses branch coverage metric to guide the path exploration. It is a best-effort method …

    uiuc Repository record for Harmonizing data mining and static analysis to tackle hardware and system level verification (opens in a new tab)

  7. On Improving Backwards Reasoning with Symbolic Execution: Integrating Loop Summarization, Alias Analysis, and Compositional Summarization

    … on systematic reasoning about program execution paths. Symbolic execution has emerged as a powerful method for systematic program analysis. However, symbolic execution faces a fundamental challenge known as state-space explosion, where the number of potential execution paths grows exponentially. …

    vt Repository record for On Improving Backwards Reasoning with Symbolic Execution: Integrating Loop Summarization, Alias Analysis, and Compositional Summarization (opens in a new tab)