Backward Pair Sharing Analysis: 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004. Proceedings

Lu, Lunjin and King, Andy (2004) Backward Pair Sharing Analysis: 7th International Symposium, FLOPS 2004, Nara, Japan, April 7-9, 2004. Proceedings. In: Kameyama, Yukiyoshi and Stuckey, Peter, eds. Functional and Logic Programming. Lecture Notes in Computer Science . Springer, pp. 132-146. ISBN 978-3-540-21402-1. (doi:10.1007/978-3-540-24754-8_11) (KAR id:37610)

PDF Language: English
Download this file (PDF/794kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL: http://dx.doi.org/10.1007/978-3-540-24754-8_11

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.

Item Type:	Book section
DOI/Identification number:	10.1007/978-3-540-24754-8_11
Subjects:	A General Works
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Andy King
Date Deposited:	13 Dec 2013 08:45 UTC
Last Modified:	05 Nov 2024 10:21 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/37610 (The current URI for this page, for reference purposes)

University of Kent Author Information

King, Andy.

Creator's ORCID:	https://orcid.org/0000-0001-5806-4822
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.