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 10 of 10 for “"Compiler correctness"”.

  1. Compilation as normalization : a multi-language semantics approach to compiler correctness

    Modern compiler projects link together diverse components, which may come from multiple source languages and be at varying stages of compilation. Compositional compiler correctness (CCC), a property which captures these intricacies, has previously required complex semantic proof theories to reason …

    ubc Repository record for Compilation as normalization : a multi-language semantics approach to compiler correctness (opens in a new tab) Download PDF for Compilation as normalization : a multi-language semantics approach to compiler correctness (opens in a new tab)

  2. Proving Correctness of a Chez Scheme Compiler Pass

    We present a proof of correctness for a pass of the Chez Scheme compiler over a subset of the Scheme programming language. To improve trust in our proof approach, we provide two different validation frameworks. The first, created with the Coq proof assistant, is a partial mechanization of the …

    calpoly Repository record for Proving Correctness of a Chez Scheme Compiler Pass (opens in a new tab)

  3. A Formally Verified Compiler for Programs that Deal with Cached Address Translation

    … buffer (TLB). One method of showing the correctness of operating systems is formal verification, but previous work has left the correctness of the TLB as an assumption. Later work on the correctness of the TLB and high-level languages respectively leaves a gap. In this report, we …

    chalmers Repository record for A Formally Verified Compiler for Programs that Deal with Cached Address Translation (opens in a new tab)

  4. Verified compilation of a purely functional language to a realistic machine semantics

    Formal verification of a compiler offers the ultimate understanding of the behaviour of compiled code: a mathematical proof relates the semantics of each output program to that of its corresponding input. Users can rely on the same formally-specified understanding of source-level behaviour as the …

    kent Download PDF for Verified compilation of a purely functional language to a realistic machine semantics (opens in a new tab)

  5. 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)

  6. Retrofitting automated verification to systems code by scaling symbolic evaluation

    … for writing and verifying just-in-time (JIT) compilers for the Berkeley Packet Filter (BPF) language in the Linux kernel. We develop a specification of compiler correctness suitable for these JITs. Using this approach, we found and fixed more than 30 new bugs in the JITs in the Linux kernel …

    washington Repository record for Retrofitting automated verification to systems code by scaling symbolic evaluation (opens in a new tab)

  7. Verified optimizations for functional languages

    … bugs in either the extraction function or the compiler of the extraction language can render source-level verification useless. A verified compiler is a compiler whose output provably preserves thesemantics of the source language. CertiCoq is a verified compiler, currently under development, …

    greece Repository record for Verified optimizations for functional languages (opens in a new tab)

  8. Formally Verified Space-Safety for Program Transformations

    Existing work on compilers has often primarily concerned itself with preserving behavior, but programs have other facets besides their observable behavior. We expect that the performance of our code is preserved and bettered by the compiler, not made worse. Unfortunately, that's exactly what …

    rit Repository record for Formally Verified Space-Safety for Program Transformations (opens in a new tab)

  9. C, Lambda Calculus and Compiler Verification - a study in Haskell of purely-functional techniques for a formal specification of imperative programming languages and an epistemically-sound verification of their compilers

    Formal verification of a compiler is a long-standing problem in computer science and, although recent years have seen substantial achievements in the area, most of the proposed solutions do not scale very well with the complexity of modern software development environments. In this thesis, I …

    unsw Repository record for C, Lambda Calculus and Compiler Verification - a study in Haskell of purely-functional techniques for a formal specification of imperative programming languages and an epistemically-sound verification of their compilers (opens in a new tab)

  10. 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)