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 20 of 151 for “"Control-Flow"”.

  1. Trace-based hardware control flow signature checking

    … a performance penalty. One such advancement, control-flow integrity (CFI), offers immunity to code-reuse attacks but slows down software that enforces CFI. In this work, we present a hardware monitor design that utilizes hardware support for instruction tracing to detect code-reuse attacks. …

    uiuc Repository record for Trace-based hardware control flow signature checking (opens in a new tab)

  2. Evaluating modern defenses against control flow hijacking

    … such as Code Pointer Integrity (CPI) and Control Flow Integrity (CFI) have their weaknesses. In this thesis, we present attacks that expose the fundamental weaknesses of CPI and CFI. CPI promises to balance security and performance by focusing memory safety on code pointers thus preventing …

    mit Repository record for Evaluating modern defenses against control flow hijacking (opens in a new tab)

  3. Low-Level Static Analysis for Memory Usage and Control Flow Recovery

    … methods do not scale well either. Sound control flow recovery (CFR) is also important for binary decompilation, verification, patching, and security analysis. It lifts raw unstructured data into a form that allows reasoning over behavior and semantics. However, doing so requires …

    vt Repository record for Low-Level Static Analysis for Memory Usage and Control Flow Recovery (opens in a new tab)

  4. USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow

    Writing bug-free code is fraught with difficulty, and existing tools for the formal verification of programs do not scale well to large, complicated codebases such as that of systems software. This thesis presents USIMPL, a component of the Orca project for formal verification that builds on …

    vt Repository record for USIMPL: An Extension of Isabelle/UTP with Simpl-like Control Flow (opens in a new tab)

  5. Control Flow Merging: A Compiler Transformation to Mitigate Branch Misprediction by Branch Elimination

    … is rarely reached because data, structural, and control flow hazards can stall the pipeline and interrupt execution. Branch prediction is widely adopted in modern architectures to mitigate control flow hazards, yet even sophisticated predictors struggle to handle branches driven by random data. …

    vt Repository record for Control Flow Merging: A Compiler Transformation to Mitigate Branch Misprediction by Branch Elimination (opens in a new tab)

  6. Enhancing Software Security through Code Diversification Verification, Control-flow Restriction, and Automatic Compartmentalization

    … traditional memory exploits such as buffer overflows, but new threats like code-reuse attacks quickly bypass these defenses. Code-reuse attacks exploit existing code sequences, known as gadgets, without injecting new malicious code, making them challenging to counter. Additionally, input-based …

    vt Repository record for Enhancing Software Security through Code Diversification Verification, Control-flow Restriction, and Automatic Compartmentalization (opens in a new tab)

  7. Analysis of defenses against code reuse attacks on modern and new architectures

    … avenue for exploitation of computer systems is a control-flow attack in which the attacker gains direct or indirect control of the instruction pointer. In order to gain remote code execution, attackers then exploit legitimate fragments of code in the executable via techniques such as …

    mit Repository record for Analysis of defenses against code reuse attacks on modern and new architectures (opens in a new tab)

  8. A systematic analysis of defenses against code reuse attacks

    … defense bypasses. Next, we investigate the control flow graphs enforced by proposed control flow integrity (CFI) systems. We model the behavior of these systems using a graph search. We also develop several code reuse payloads that work within the control flow graph enforced by one proposed …

    mit Repository record for A systematic analysis of defenses against code reuse attacks (opens in a new tab)

  9. RTL Functional Test Generation Using Factored Concolic Execution

    … visualized as the systematic unraveling of the control-flow response of the design over multiple (factored) explorations. We begin by transforming the Register Transfer Level (RTL) source for the design into a high-performance C++ compiled functional simulator which is instrumented for branch …

    vt Repository record for RTL Functional Test Generation Using Factored Concolic Execution (opens in a new tab)

  10. Runtime execution tracing and alignment with PANDA

    … Dynamic Analysis (PANDA) which tracks control flow at runtime at the basic block level, recording a hash of the current location in program structure at every conditional jump. By considering only control flow history up to and including the current stack frame, multiple divergences and …

    mit Repository record for Runtime execution tracing and alignment with PANDA (opens in a new tab)

  11. A practical, comprehensive and accessible binary framework for security

    … Static approaches struggle with precise control flow recovery, leading to unsound binaries or limited binary support. Dynamic approaches, while more comprehensive, incur high performance costs. Additionally, complexities of binary frameworks hinder swift development of security solutions. …

    cambridge Repository record for A practical, comprehensive and accessible binary framework for security (opens in a new tab)

  12. Modulo Scheduling with isomorphic control transformations

    … scheduling is presented that uses Isomorphic Control Transformations (ICTs). If-conversion is used to convert an acyclic control flow graph into a large basic block or hyper-block. Local scheduling techniques which are well-known and widely supported can then be applied to schedule operations. …

    uiuc Repository record for Modulo Scheduling with isomorphic control transformations (opens in a new tab)

  13. Understanding asynchronous code

    … the language's idioms rely heavily on non-linear control flow via function pointers. The aim of this work is to create a debugging interface that helps users understand complicated control flow in languages like JavaScript. This thesis presents a programming editor extension called Theseus that …

    mit Repository record for Understanding asynchronous code (opens in a new tab)

  14. Analysis of return oriented programming and countermeasures

    … which allows an attacker to redirect a program's control flow to pre-existing snippets of code. Code reuse attacks have historically been a powerful and ubiquitous exploitation technique [2]. Even as recently as 2014 there has been an outbreak of these code reuse attacks, targeting such …

    mit Repository record for Analysis of return oriented programming and countermeasures (opens in a new tab)

  15. Secure execution environment via program shepherding

    … program shepherding, a method for monitoring control flow transfers during program execution in order to enforce a security policy. Program shepherding provides three basic techniques as building blocks for security policies. First, program shepherding can restrict execution privileges on the …

    mit Repository record for Secure execution environment via program shepherding (opens in a new tab)

  16. Program Anomaly Detection Against Data-Oriented Attacks

    … be broadly classified into two categories: i) control-flow attacks and ii) data-oriented attacks. Though data-oriented attacks are known for a long time, the threats have not been adequately addressed due to the fact that most previous defense mechanisms focus on preventing control-flow

    vt Repository record for Program Anomaly Detection Against Data-Oriented Attacks (opens in a new tab)

  17. Code Decomposition: A New Hope

    … by converting Python source code into a control flow graph. Static analysis is performed on the control flow graph to direct the generation of suggestions based on code slices.</p>

    calpoly Repository record for Code Decomposition: A New Hope (opens in a new tab)

  18. Improving Error Discovery Using Guided Model Checking

    … however, inlining functions at call sites in the control flow graph to capture calling context leads to exponential growth in the computation. This paper presents a new algorithm that implicitly inlines functions at call sites to compute distance data with unbounded calling context that is …

    byu Repository record for Improving Error Discovery Using Guided Model Checking (opens in a new tab)

  19. Design and evaluation of an optimistic CPU: the warp engine

    … performance in processors by manipulating the flow of instructions. These control flow manipulations alone are not adequate to allow large numbers of instructions to execute in parallel because performance is limited by accesses to the relatively slow memory system. Performance can be improved …

    waikato-masters Repository record for Design and evaluation of an optimistic CPU: the warp engine (opens in a new tab)

  20. Systematic Compilation for Predicated Execution

    … the Predicate Analysis System, the Predicate Dataflow Graph, and the Program Decision Logic Optimizer are demonstrated to work synergistically in the compiler to generate efficient code for nonnumeric programs. Using predication, these techniques effectively optimize codes in the presence of …

    uiuc Repository record for Systematic Compilation for Predicated Execution (opens in a new tab)

Page 1 of 8