Back to search

University of York

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

Abstract

dc:description.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.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of York
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Perez Cervantes, Marco Polo
Advisor dc:contributor.advisor
  • Colin, Runciman

Rights

Language dc:language.dcterms_iso639_2
eng

Identifiers

dc:identifier.*
Identifier
uk.bl.ethos.605341

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

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