Towards dynamic term size computation via program transformation

López García, Pedro and Hermenegildo, Manuel V. (1993). Towards dynamic term size computation via program transformation. In: "Second Spanish Conference on Declarative Programming", September 1993.

Description

Title: Towards dynamic term size computation via program transformation
Author/s:
  • López García, Pedro
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: Second Spanish Conference on Declarative Programming
Event Dates: September 1993
Title of Book: Second Spanish Conference on Declarative Programming
Date: September 1993
Subjects:
Freetext Keywords: Term size computation, Granularity analysis, Parallelism, Cálculo del tamaño de plazo, Análisis de granularidad, Paralelismo.
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (976kB) | Preview

Abstract

Knowing the size of the terms to which program variables are bound at run-time in logic programs is required in a class of applications related to program optimization such as, for example, recursion elimination and granularity analysis. Such size is difficult to even approximate at compile time and is thus generally computed at run-time by using (possibly predefined) predicates which traverse the terms involved. We propose a technique based on program transformation which has the potential of performing this computation much more efficiently. The technique is based on finding program procedures which are called before those in which knowledge regarding term sizes is needed and which traverse the terms whose size is to be determined, and transforming such procedures so that they compute term sizes "on the fly". We present a systematic way of determining whether a given program can be transformed in order to compute a given term size at a given program point without additional term traversal. Also, if several such transformations are possible our approach allows finding minimal transformations under certain criteria. We also discuss the advantages and present some applications of our technique.

More information

Item ID: 14676
DC Identifier: http://oa.upm.es/14676/
OAI Identifier: oai:oa.upm.es:14676
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 22 Mar 2013 07:49
Last Modified: 21 Apr 2016 14:27
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM