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 5 of 5 for “"compiler correctness"”.

  1. A Framework for Modular, Extensible, Equivalence-Preserving Compilation

    … the verification of extensible, compositional compilers in Coq. Current techniques for proving compiler correctness are generally tied to the specific structures of the languages and compilers that they support. This limits the extent to which these systems can be extended and composed. In …

    mit Repository record for A Framework for Modular, Extensible, Equivalence-Preserving Compilation (opens in a new tab)

  2. Techniques for Foundational End-to-End Verification of Systems Stacks

    … concerns: It is end-to-end in the sense that the correctness proofs of individual components are used to discharge the assumptions of adjacent components throughout the whole stack, resulting in end-to-end theorems that only mention the top-most and bottom-most specifications, so that bugs in …

    mit Repository record for Techniques for Foundational End-to-End Verification of Systems Stacks (opens in a new tab)

  3. Foundational Integration Verification of Diverse Software and Hardware Components

    … Computer-checked mathematical proofs of software correctness have emerged as a promising method to rule out large classes of bugs. However, the appropriate notion of correctness for a computer-systems component is exceedingly difficult to specify correctly in isolation, and unrelated verification …

    mit Repository record for Foundational Integration Verification of Diverse Software and Hardware Components (opens in a new tab)

  4. Specifying and verifying program transformations with PTRANS

    Software developers, compiler designers, and formal methods researchers all stand to benefit from improved tools for compiler design and verification. Program correctness for compiled languages depends fundamentally on compiler correctness, and compiler optimizations are usually not formally …

    uiuc Repository record for Specifying and verifying program transformations with PTRANS (opens in a new tab)

  5. Extracting Parallelism from Legacy Sequential Code Using Transactional Memory

    … the Jikes RVM and modifying its baseline compiler. Correctness of the program is preserved through exploiting Software Transactional Memory (STM) to manage concurrent and out-of-order memory accesses. Our experiments show that HydraVM achieves speedup between 2×-5× on a set of benchmark …

    vt Repository record for Extracting Parallelism from Legacy Sequential Code Using Transactional Memory (opens in a new tab)