Search for dissertations about: "stack machine"

Showing result 1 - 5 of 15 swedish dissertations containing the words stack machine.

2. 1. Proving the correctness of a virtual machine by a bisimulation

   Author : Mikael Rittri; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; stack machine; snapshot; one-step reduction; interpreter correctness; verification mapping; bisimulation; operational semantics; compiler correctness; SECD--machine; context; McGowan mapping; state-trace; debugging;

   Abstract : .... READ MORE

4. 2. Discourse in Statistical Machine Translation

   Author : Christian Hardmeier; Joakim Nivre; Jörg Tiedemann; Marcello Federico; Lluís Màrquez; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Statistical machine translation; Discourse-level machine translation; Document decoding; Local search; Pronominal anaphora; Pronoun translation; Neural networks; Computational Linguistics; Datorlingvistik;

   Abstract : This thesis addresses the technical and linguistic aspects of discourse-level processing in phrase-based statistical machine translation (SMT). Connected texts can have complex text-level linguistic dependencies across sentences that must be preserved in translation. However, the models and algorithms of SMT are pervaded by locality assumptions. READ MORE

5. 3. Towards a Trustworthy Stack: Formal Verification of Low-Level Hardware and Software

   Author : Ning Dong; Roberto Guanciale; Mads Dam; Magnus Myreen; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Formal Verification; Information Flow; Refinement; Interactive Theorem Prover; HOL4; Serial Interface; Pipelined Processor; Microarchitecture; Out-of-order Execution; Formell Verifiering; Informationsflöde; Förfining; Interaktiva Bevisprogrammet; HOL4; Seriellt Gränssnitt; Pipelined Processor; Mikroarkitektur; Omordnad Exekvering; Datalogi; Computer Science;

   Abstract : Computer systems, consisting of hardware and software, have gained significant importance in the digitalised world. These computer systems rely on critical components to provide core functionalities and handle sensitive data. READ MORE

6. 4. Types for Crash Preventionn

   Author : Lars Pareto; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; reliability; dependability; concurrent programming; denotational semantics; real-time systems and embedded systems; data-flow; dynamic storage management; applicative functional programming languages ; type systems;

   Abstract : This thesis seeks to strengthen the capabilities of static polymorphic type-checking (as known from typed lambda calculus and functional programming) to allow a larger class of programming errors to be caught at compile time: the goal is to not only prevent illegal uses of data, but to also errors that lead to busy-loops, deadlocks, stack-overflows and heap-overflows. The thesis exploits that, for recursive programs, many correctness properties (including freedom from errors leading to busy-loops, etc. READ MORE

7. 5. Building Verified Hardware and Verified Stacks in HOL

   Author : Andreas Lööw; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : This thesis explores building provably correct software and hardware inside the HOL4 interactive theorem prover. Interactive theorem provers such as HOL4 are proof environments where manual (human) and automated (machine) proofs can be composed in logically safe ways, and all proof steps (be it manual or automated) are mechanically checked. READ MORE