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 14 of 14 for “"Soundness proof"”.
-
Formal Semantics and Mechanized Soundness Proof for Fast Gradually Typed JavaScript
… of this type system, and provides a mechanized soundness proof using the Coq proof assistant.
-
Formal specification and verification techniques for mutable references and advanced aliasing in Rust
… is non-trivial. We then propose an updated soundness proof for Creusot that allows proving the soundness of a new version of its ghost type. The old version of the ghost type was found to be unsound. The existing soundness proof for Creusot has limitations, which require us to make …
-
Computing Sensitivity By Parametricity: An Approach to Higher-Order Functions
… a somewhat dependent type language. We provide a soundness proof for λSpar with the function space and l1 norm.
-
A System for Bounding the Execution Cost of Web Assembly Functions
… specified using an abstract syntax, and a soundness proof of this specification has been written and mechanized. We build on this to create a system that determines a bound on the runtime cost of a WebAssembly function. We show that for a broad class of real-world programs this cost can be …
-
Automated Amortised Analysis
… various inputs. The main result is the formal soundness proof of the proposed analysis for a functional language. The strictly evaluated language features higher-order types, full mutual recursion, nested data types, suspension of evaluation, and can deal with aliased data. The presentation …
-
A type inference algorithm and transition semantics for polymorphic C
… function. Smith and Volpano proved a type soundness theorem that basically says that evaluation of a well-typed PolyC program cannot fail due to a type mismatch. The type soundness proof is based on an operational characterization of a special kind of semantic formulation called a natural …
-
Region-based Program Specialization
… deallocation explicit. The formal correctness proof of our novel specialization technique based on a region type system requires two theoretical building blocks: a type soundness proof for the region calculus and a correctly proven equational theory between region-annotated terms. Putting these …
-
Building a Typed Scripting Language
… of the type system and to employ a novel type soundness proof strategy based on simulation. At the heart of our approach is a type indexed record we call the onion which supports asymmetric concatenation and dispatch; we use onions to formally encode a variety of features, including records, …
-
Decidability and Algorithmic Analysis of Dependent Object Types (DOT)
… the study of DOT calculi mostly focuses on the soundness proof, which does not directly contribute to development of compilers. This thesis presents a detailed investigation of decidability and algorithmic properties of the family of DOT calculi. In decidability analysis, the undecidability of …
-
The metatheory of the monadic hybrid calculus
In this dissertation we prove the Completeness, Soundness and Compactness of the Monadic Hybrid Calculus MHC and we prove its expressive equivalence to the Monadic Predicate Calculus MPC. The Monadic Hybrid Calculus MHC is a new system that is based on the (propositional) modal logic S5. It is …
-
Protection against malicious JavaScript using hybrid flow-sensitive information flow monitoring
… the running JavaScript program. We provide the soundness proof of the model with respect to termination-insensitive non-interference security policy and develop a new security benchmark to establish experimentally its effectiveness in detecting and preventing illicit information flow. When …
-
Java(X): A Type-Based Program Analysis Framework
… different refinement type system with guaranteed soundness. <br>The thesis introduces the framework with some motivating examples, formalizes the core language of Java(X), provides a generic soundness proof, and presents a modular type checking algorithm that also infers the optimal capability …
-
Void safety
… It formalizes the rules in the Isabelle/HOL proof assistant and establishes some of their properties. To ensure safety at the end of object life cycle it also specifies validity rules for finalizers. A number of examples are used to demonstrate that the proposed solutions are of practical use …
-
Petra: A compositional, contract-based, Correct-by-Construction OOP language, using explainable, layered abstractions, for scalable V&V
… behaviour of a program at run-time. We prove soundness between correct symbolic and operational semantics through a structural induction that is designed to prove that a correct symbolic semantics implies a correct operational semantics. This is split into two parts, first by proving correct …