White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

Static Methods to Check Low-Level Code for a Graph Reduction Machine

Perez Cervantes, Marco Polo (2013) Static Methods to Check Low-Level Code for a Graph Reduction Machine. PhD thesis, University of York.

[img]
Preview
Text
Thesis_mppc.pdf
Available under License Creative Commons Attribution-Noncommercial-No Derivative Works 2.0 UK: England & Wales.

Download (1117Kb) | Preview

Abstract

This thesis is about checking code for a graph-reduction machine computing by template instantiation. An equation-based static checking method for low-level code is proposed in this thesis. The checking can be performed without requiring any extra code annotations. Most ill-behaved programs can be rejected and most well-behaved programs can be accepted. The template code has no explicit information about data types but the static checker works by inferring low-level recursive types. We show compatibility between high-level and low-level type systems. We evaluate empirically the eff�ectiveness of checking to prevent failures. We investigate the low-level implementation of the static checker and how it can be made efficient.

Item Type: Thesis (PhD)
Academic Units: The University of York > Computer Science (York)
Identification Number/EthosID: uk.bl.ethos.605341
Depositing User: Mr Marco Polo Perez
Date Deposited: 09 Jun 2014 12:59
Last Modified: 08 Sep 2016 13:30
URI: http://etheses.whiterose.ac.uk/id/eprint/6248

You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.

Actions (repository staff only: login required)