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 8 of 8 for “"mechanized proof"”.
-
Tail Recursion Modulo Cons Optimization in CakeML
… theorem prover, and included in the project is a mechanized proof that the transformation produces code that is semantically equivalent to the original.
-
Tag-based Security in C: Writing and Specifying Flexible Protection
… and an implementation in Tagged C, verified by mechanized proof in Coq.
-
κDOT: A DOT Calculus with Mutation and Constructors
… to that of Scala. κDOT is proven type safe via a mechanized proof in Coq.
-
Formalizing the SSA-based Compiler for Verified Advanced Program Transformations
… as type systems, static analysis, and formal proofs) and produce target programs with different meaning from source programs. Researchers have used mechanized proof tools to implement verified compilers that are guaranteed to preserve program semantics and proved to be more robust than ad-hoc …
-
Extending Event-B with discrete timing properties
… and predicate logic. It has the advantage of mechanized proof, and it is possible to model a system in several levels of abstraction by using refinement. Discrete timing properties are important in many critical systems. However, modelling of timing properties is not directly supported in …
-
Mechanizing the metatheory of ReWire
… type-safety and is strongly normalizing -- the proof of strong normalization is the first mechanized proof of its kind. We define an equational theory with respect to this language. This allows us to prove that the language has desirable security properties by construction. This work supports a …
-
Formal Proof of the Fundamental Theorem of Decorated Interval Arithmetic
… distinctive features of our formalization and proof. First, we define the semantics of an interval as a set of real numbers (including the empty set), and we do not impose any other restrictions on such a set, except that models of this interval can decide if the set is empty or not. For …
-
Verified commitment schemes and reduction proofs in the lean proof assistant
… 4 theorem prover, together with machine-checked proofs of their core security properties. Commitment schemes allow a party to commit to a value while keeping it hidden, with guarantees of binding (the value cannot be changed) and hiding (the value remains secret until revealed). We develop a …