A technique for recursive invariance detection and selective program specialization

Giannotti, Fosca y Hermenegildo, Manuel V. (1991). A technique for recursive invariance detection and selective program specialization. En: "3rd International Symposium, PLILP '91", August 26-28, 1991, Passau, Germany. ISBN 9783540544449.

Descripción

Título: A technique for recursive invariance detection and selective program specialization
Autor/es:
  • Giannotti, Fosca
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 3rd International Symposium, PLILP '91
Fechas del Evento: August 26-28, 1991
Lugar del Evento: Passau, Germany
Título del Libro: Programming Language Implementation and Logic Programming
Fecha: Agosto 1991
ISBN: 9783540544449
Volumen: 528
Materias:
Palabras Clave Informales: Logic programming, Abstract interpretation, Program transformation, Program specialization, Parallel logic programming, Cycle invariant detection, Compile-time optimization, Programación lógica, Interpretación de resúmenes, Transformación de programas, Especialización de programas, Programación lógica paralela, Detección de circuitos invariables.
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 (942kB) | Vista Previa

Resumen

This paper presents a technique for achieving a class of optimizations related to the reduction of checks within cycles. The technique uses both Program Transformation and Abstract Interpretation. After a ñrst pass of an abstract interpreter which detects simple invariants, program transformation is used to build a hypothetical situation that simpliñes some predicates that should be executed within the cycle. This transformation implements the heuristic hypothesis that once conditional tests hold they may continué doing so recursively. Specialized versions of predicates are generated to detect and exploit those cases in which the invariance may hold. Abstract interpretation is then used again to verify the truth of such hypotheses and conñrm the proposed simpliñcation. This allows optimizations that go beyond those possible with only one pass of the abstract interpreter over the original program, as is normally the case. It also allows selective program specialization using a standard abstract interpreter not speciñcally designed for this purpose, thus simplifying the design of this already complex module of the compiler. In the paper, a class of programs amenable to such optimization is presented, along with some examples and an evaluation of the proposed techniques in some application áreas such as floundering detection and reducing run-time tests in automatic logic program parallelization. The analysis of the examples presented has been performed automatically by an implementation of the technique using existing abstract interpretation and program transformation tools.

Más información

ID de Registro: 14485
Identificador DC: http://oa.upm.es/14485/
Identificador OAI: oai:oa.upm.es:14485
URL Oficial: http://link.springer.com/chapter/10.1007%2F3-540-54444-5_109
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 14 Feb 2013 07:34
Ultima Modificación: 21 Abr 2016 14:11
  • 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