School of Computing

Reduction and refinement

Eerke Boiten and Dan Grundy

Electronic Notes in Theoretical Computer Science, 201C:182-196, February 2008 Proceedings of the BCS-FACS Refinement Workshop, Oxford, 2007. doi 10.1016/j.entcs.2008.02.014 [doi].

Abstract

In this paper we explore the relation between refinement and reduction, especially as it is used in the context of cryptography. We show how refinement is a special case of reduction, and more interestingly, how reduction is an instance of a novel generalisation, "refinement with context".



Bibtex Record

@article{2674,
author = {Eerke Boiten and Dan Grundy},
title = {Reduction and refinement},
month = {February},
year = {2008},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Proceedings of the BCS-FACS Refinement Workshop, Oxford, 2007. doi 10.1016/j.entcs.2008.02.014},
doi = {10.1016/j.entcs.2008.02.014},
url = {http://www.cs.kent.ac.uk/pubs/2008/2674},
    publication_type = {article},
    submission_id = {409_1205058634},
    ISSN = {1571-0661},
    journal = {Electronic Notes in Theoretical Computer Science},
    volume = {201C},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014