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 “"type qualifiers"”.
-
Polymorphic Type Qualifiers
Type qualifiers offer a simple yet effective mechanism for extending existing type systems to deal with additional constraints or safety requirements. For example, the const qualifier is a popular mechanism for annotating existing types to signify that the value in question is read-only in …
-
Type Qualifiers as Catalysts for Language Evolution
… languages. This thesis focuses on the theory of type qualifiers as a possible means of accelerating the adoption of research results into common usage. Type Qualifiers have a two-decade lineage of static analysis tools, with active research today, but are not yet available in a major programming …
-
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 …
-
Funqual: User-Defined, Statically-Checked Call Graph Constraints in C++
… environments. To accomplish this, we create a type system whereby functions can be given user-defined type qualifiers and where users can define their own restrictions on the call graph based on these type qualifiers. We demonstrate that this tool, when used with hand-crafted rules, can catch …
-
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 …
-
Context-Sensitive Optional Type Systems Meet Generics: A Uniform Treatment and Formalization
… a novel design of context-sensitive optional type systems which supports generics. Optional type systems, as the name suggests, optionally enforce type rules in typechecking and can be switched on only when needed. They give flexibility to developers because, whenever they need optional type …
-
Linear Types, Protocols, and Processes in Classical F°
Session types and typestate both promise a type system that can reason about protocol adherence. The complexity budgets of most programming languages, however, do not allow for new forms of types aimed at specific problem domains--even domains as broad as these. Classical F◦ --read "F-pop"--is a …
-
Automated Refinement Of Hierarchical Object Graphs
… express this object hierarchy, using ownership type qualifiers in the code. Adding qualifiers after the fact involves manual overhead, and requires developers to switch between adding qualifiers in the code and looking at abstract object graphs to understand the object structures that 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, …
-
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 …