Pair-sharing over rational trees

King, Andy (2000) Pair-sharing over rational trees. Journal of Logic Programming, 46 (1-2). pp. 139-155. ISSN 0743-1066. (doi:10.1016/S0743-1066(00)00009-1)

Abstract

Sharing information is useful in specialising, optimising and parallelising logic programs and thus sharing analysis is an important topic of both abstract interpretation and logic programming. Sharing analyses infer which pairs of program variables can never be bound to terms that contain a common variable. We generalise a classic pair sharing analysis from Herbrand unification to trace sharing over rational tree constraints. This is useful for reasoning about programs written in SICStus and Prolog-III because these languages use rational tree unification as the default equation solver.

Item Type: Article
DOI/Identification number: 10.1016/S0743-1066(00)00009-1
Uncontrolled keywords: Abstract interpretation; Sharing analysis; Rational trees
Subjects: A General Works
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 12 Dec 2013 20:07 UTC
Last Modified: 29 May 2019 11:40 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37582 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year