Skip to main content

Mode Analysis Domains for Typed Logic Programs

Smaus, Jan-Georg and Hill, Pat and King, Andy (1999) Mode Analysis Domains for Typed Logic Programs. In: Bossi, Annalisa, ed. Logic-Based Program Synthesis and Transformation 9th International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 82-101. ISBN 978-3-540-67628-7. E-ISBN 978-3-540-45148-8. (doi:10.1007/10720327_6)

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: Book section
DOI/Identification number: 10.1007/10720327_6
Uncontrolled keywords: Logic Program, Operational Semantic, Abstract Term, Type Graph, Abstract Domain
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Andy King
Date Deposited: 27 Aug 2009 14:13 UTC
Last Modified: 31 May 2019 08:40 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/22064 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year