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 12 of 12 for “"compiler verification"”.

  1. Pushing the Limits of Compiler Verification

    … systems rely on the correctness of at least one compiler for correct operation. Formal verification is a powerful technique for constructing correct systems. While there have been many efforts to develop formally verified compilers, those compilers are still not widely used. In this thesis, I …

    washington Repository record for Pushing the Limits of Compiler Verification (opens in a new tab)

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

  3. Modular Compilers and Their Correctness Proofs

    … the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics …

    uiuc Repository record for Modular Compilers and Their Correctness Proofs (opens in a new tab)

  4. Language Design for Scalable, Extensible Proof Engineering

    Certified compilers are complex software systems. Like other large systems, they demand modular, extensible designs. While there has been progress in extensible metatheory mechanization, scaling extensibility and reuse to meet the demands of full compiler verification remains a major challenge. We …

    waterloo Repository record for Language Design for Scalable, Extensible Proof Engineering (opens in a new tab)

  5. Property-based Testing and Properties as Types: A hybrid approach to supercompiler verification

    This thesis describes a hybrid approach to compiler verification. Property-based testing and mechanised proof are combined to support the verification of a supercompiler — a particular source-to-source program optimisation. A careful developer may use formal methods to ensure that their program …

    whiterose Download PDF for Property-based Testing and Properties as Types: A hybrid approach to supercompiler verification (opens in a new tab)

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

  7. Automated Verification of Compiler Transformations

    … it increasingly challenging to develop reliable compilers that preserve the semantics of source code during compilation. Traditional testing methods often lack sufficient test coverage and fail to identify subtle errors and undefined behaviors that can lead to compiler malfunctions. Furthermore, …

    portland-state Repository record for Automated Verification of Compiler Transformations (opens in a new tab)

  8. Implementation Techniques for Lexical Effect Handlers

    … model, proven correct, and realized in the Lexa compiler. Direct Lexa identifies each handler with the stack address where it is installed, so a raise jumps directly to its handler, without any search. Zone Lexa extends the address-based strategy to multishot resumptions by virtualizing handler …

    waterloo Repository record for Implementation Techniques for Lexical Effect Handlers (opens in a new tab)

  9. A verification framework suitable for proving large language translations

    … some frameworks, such as Morpheus, to specify a compiler translation in a small language and prove the semantic preservation property of the translation in the language under the assumption of sequential consistency. Based on the Morpheus specification language, we extend the verification …

    uiuc Repository record for A verification framework suitable for proving large language translations (opens in a new tab)

  10. Překladač z fragmentu jazyka C do nástroje ARTMC

    S narastajúcou komplexitou softvérových programov je stále viac a viac žiadaná automa- tizovaná analýza a verifikácia týchto programov. Výskumná skupina VeriFIT na Fakulte informačních technologií Vysokého učení technického sa zaoberá výskumom v danej oblasti. Jedným z vytvorených nástrojov v tejto …

    brno-tech Repository record for Překladač z fragmentu jazyka C do nástroje ARTMC (opens in a new tab)

  11. Shared-Environment Call-by-Need

    … lazy functional languages rely heavily on their compiler to both preserve correctness and generate high-performance code for high level abstractions. In this dissertation I present a novel technique for compiling call-by-need semantics by using shared environments to share results of computation. …

    unm Repository record for Shared-Environment Call-by-Need (opens in a new tab)