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 “"pluggable type systems"”.

  1. Pluggable Properties for Program Understanding: Ontic Type Checking and Inference

    Pluggable type systems is a powerful approach to add additional information on types, which can facilitate the understanding of programs. This thesis presents our work on three pluggable type systems for helping both programmers and other program analysis tools to better understand programs. …

    waterloo Repository record for Pluggable Properties for Program Understanding: Ontic Type Checking and Inference (opens in a new tab)

  2. A General Pluggable Type Inference Framework and its use for Data-flow Analysis

    Java's pluggable type systems provide valuable compile-time guarantees, but annotating the program with pluggable types can be a significant burden on programmers. Checker Framework Inference, a framework that aims to provide a constraint-based type inference for pluggable types, can generate type …

    waterloo Repository record for A General Pluggable Type Inference Framework and its use for Data-flow Analysis (opens in a new tab)

  3. An Immutability Type System for Classes and Objects: Improvements, Experiments, and Comparisons

    … and objects by using static analysis with pluggable type systems. A properly implemented pluggable type system can statically analyze the mutability property of an object without execution. This thesis presents (1) the analysis of some previous work, including Javari, ReIm, and Glacier, (2) …

    waterloo Repository record for An Immutability Type System for Classes and Objects: Improvements, Experiments, and Comparisons (opens in a new tab)

  4. Interval Type Inference: Improvements and Evaluations

    … an upper bound. Interval analysis for integral types is useful in providing facts of the target program to help developers find issues such as unsafe narrowing casts, out-of-bound array indices, numerical overflows/underflows, divisions-by-zero, and dead branches. Various approaches have been …

    waterloo Repository record for Interval Type Inference: Improvements and Evaluations (opens in a new tab)

  5. UniFlow: A CFG-Based Framework for Pluggable Type Checking and Type Inference

    A type system is a crucial component of high-level programming languages, as it enhances program correctness by ruling out certain type errors. However, the built-in type system often adheres to a specific set of rules defined by the language's specification (e.g., Java, Kotlin and C++). Pluggable …

    waterloo Repository record for UniFlow: A CFG-Based Framework for Pluggable Type Checking and Type Inference (opens in a new tab)

  6. OppropBERT: An Extensible Graph Neural Network and BERT-style Reinforcement Learning-based Type Inference System

    Built-in type systems for statically-typed programming languages (e.g., Java) can only prevent rudimentary and domain-specific errors at compile time. They do not check for type errors in other domains, e.g., to prevent null pointer exceptions or enforce owner-as-modifier encapsulation discipline. …

    waterloo Repository record for OppropBERT: An Extensible Graph Neural Network and BERT-style Reinforcement Learning-based Type Inference System (opens in a new tab)

  7. Context Sensitive Typechecking And Inference: Ownership And Immutability

    Context sensitivity is one important feature of type systems that helps creating concise type rules and getting accurate types without being too conservative. In a context-sensitive type system, declared types can be resolved to different types according to invocation contexts, such as receiver and …

    waterloo Repository record for Context Sensitive Typechecking And Inference: Ownership And Immutability (opens in a new tab)