School of Computing

Mode Analysis Domains for Typed Logic Programs

Jan-Georg Smaus, Pat Hill, and Andy King

In A Bossi, editor, Logic Programming, Synthesis and Transformation (Selected Papers), volume 1817 of Lecture Notes in Computer Science, pages 182-196, September 2000 Copyright Springer-Verlag, see http://www.springer.de./comp/lncs/index.html.

Abstract

Precise mode information is important for compiler optimisations and in program development tools. Within the framework of abstract compilation, the precision of a mode analysis depends on the expressiveness of the abstract domain. This work considers abstract domains for polymorphically typed logic programs and shows how specialised domains may be constructed for each type in the program. These domains capture the degree of instantiation to a high level of precision. The domain construction procedure is fully implemented using the Goedel language and tested on a number of example programs.

Download publication 219 kbytes (PostScript)

Bibtex Record

@inproceedings{826,
author = {Jan-Georg Smaus and Pat Hill and Andy King},
title = {{Mode Analysis Domains for Typed Logic Programs}},
month = {September},
year = {2000},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Copyright Springer-Verlag, see 
http://www.springer.de./comp/lncs/index.html},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2000/826},
    editor = {A Bossi},
    refereed = {yes},
    series = {Lecture Notes in Computer Science},
    volume = {1817},
    booktitle = {Logic Programming, Synthesis and Transformation (Selected Papers)},
}

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

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

Last Updated: 21/03/2014