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 “"type qualifier"”.
-
Less is sometimes more in the automation of software evolution tasks
… the refactorings supported by modern IDEs and type qualifier inference. Type qualifiers augment a type system to check more properties of the software. Automated inference of type qualifiers can reduce the cost of using type qualifiers. The compositional paradigm enabled us to build the first …
-
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 …
-
Type Checking and Whole-program Inference for Value Range Analysis
… thesis explores the use of static analysis with type systems for value range analysis. Properly formalized type systems can provide mathematical guarantees for the correctness of a program at compile time. This thesis presents (1) a novel type system, the Narrowing and Widening Checker, (2) a …
-
Lightweight Verification via Specialized Typecheckers
… via the use of specialized pluggable typecheckers. Our contributions are in two categories: (1) new techniques that increase the expressiveness of lightweight verification by making verification simpler or cheaper for particular classes of problems— thus making verification of the …
-
Light-weight verification of cryptographic API usage
A pluggable type system is a light-weight approach for compile-time program verification, which provides more powerful types to both developers and compilers. Developers use pluggable types to boost program understanding, while compilers leverage the new types to enforce interesting properties, …