Mode Analysis Domains for Typed Logic Programs

Smaus, J.G. and Hill, P. and King, A. (2000) Mode Analysis Domains for Typed Logic Programs. In: 9th International Workshop on Logic-Based Program Synthesis and Transformation (LOPSTR'99), Sep 22-24, 1999, Venice, Italy,.

Postscript
Download (336Kb)	Preview
PDF
Download (324Kb)	Preview

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, in part, on the expressiveness of the abstract domain and its associated abstraction function. This paper 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. By providing a generic definition of abstract unification, the abstraction of a program using these domains is formalised. The domain construction procedure is fully implemented using the Godel language and tested on a number of example programs to demonstrate the viability of the approach.

Item Type:	Conference or workshop item (Paper)
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	27 Aug 2009 14:13
Last Modified:	06 Sep 2011 04:12
Resource URI:	http://kar.kent.ac.uk/id/eprint/22064 (The current URI for this page, for reference purposes)

• Depositors only (login required):