Dynamic term size computation in logic programs via program transformation

López García, Pedro y Hermenegildo, Manuel V. (1993). Dynamic term size computation in logic programs via program transformation. Monografía (Informe Técnico). Facultad de Informática (UPM) [antigua denominación], Madrid, Spain.

Descripción

Título: Dynamic term size computation in logic programs via program transformation
Autor/es:
  • López García, Pedro
  • Hermenegildo, Manuel V.
Tipo de Documento: Monográfico (Informes, Documentos de trabajo, etc.) (Informe Técnico)
Fecha: Abril 1993
Materias:
Palabras Clave Informales: Term size computation, Granularity analysis, Parallelism, Cálculo del tamaño de los términos, Análisis de la granularidad, Paralelismo.
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 15289
Identificador DC: http://oa.upm.es/15289/
Identificador OAI: oai:oa.upm.es:15289
URL Oficial: ftp://clip.dia.fi.upm.es/pub/papers/PARFORCE
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 14 May 2013 05:27
Ultima Modificación: 21 Abr 2016 15:20
  • GEO_UP4
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • InvestigaM
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM