School of Computing

Backward Pair Sharing Analysis

Lunjin Lu and Andy King

In Yukiyoshi Kameyama and Peter Stuckey, editors, Seventh International Symposium on Functional and Logic Programming, volume 2998 of Lecture Notes in Computer Science, pages 182-196. Springer-Verlag, April 2004 Also see http://www.springer.de/comp/lncs/index.html.

Abstract

This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the query is successfully executed. The analysis uses a pair sharing domain and is capable of inferring pre-conditions that ensure the absence of sharing. This, in turn, has many applications in logic programming. The work is unique in that it demonstrates that backward analysis is applicable even for properties that are not closed under instantiation.

Download publication 331 kbytes (PostScript)

Bibtex Record

@conference{1763,
author = {Lunjin Lu and Andy King},
title = {Backward {P}air {S}haring {A}nalysis},
month = {April},
year = {2004},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Also see http://www.springer.de/comp/lncs/index.html 
},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2004/1763},
    publication_type = {conference},
    submission_id = {18701_1074072136},
    booktitle = {Seventh International Symposium on Functional and Logic Programming},
    editor = {Yukiyoshi Kameyama and Peter Stuckey},
    series = {Lecture Notes in Computer Science},
    publisher = {Springer-Verlag},
    refereed = {yes},
    volume = {2998},
}

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

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

Last Updated: 21/03/2014