© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Correctness of Set-Sharing with Linearity
Jacob M. Howe and Andy King
Technical Report 3-02, University of Kent, Computing Laboratory, March 2002.Abstract
Zaffanella presents an intriguing abstract unification algorithm for tracing set-sharing with linearity and freeness as part of this doctoral thesis. This note provides a short correctness proof for the main novel aspect of this algorithm.
Download publication 206 kbytes (PostScript)Bibtex Record
@techreport{1354,
author = {Jacob M. Howe and Andy King},
title = {Correctness of {S}et-{S}haring with {L}inearity},
month = {March},
year = {2002},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2002/1354},
publication_type = {techreport},
submission_id = {28587_1016464777},
number = {3-02},
institution = {University of Kent, Computing Laboratory},
}