Incremental analysis of constraint logic programs

Hermenegildo, Manuel V.; Marriott, K.; Puebla Sánchez, Alvaro Germán y Stuckey, P.J. (2000). Incremental analysis of constraint logic programs. "ACM transactions on programming languages and systems", v. 22 (n. 2); pp. 187-223. ISSN 0164-0925. https://doi.org/10.1145/349214.349216.

Descripción

Título: Incremental analysis of constraint logic programs
Autor/es:
  • Hermenegildo, Manuel V.
  • Marriott, K.
  • Puebla Sánchez, Alvaro Germán
  • Stuckey, P.J.
Tipo de Documento: Artículo
Título de Revista/Publicación: ACM transactions on programming languages and systems
Fecha: Marzo 2000
Volumen: 22
Materias:
Palabras Clave Informales: Abstract interpretation, Constraint logic programming, Incremental computation, Static analysis, Programación lógica por restricciones, Análisis estático
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 (2MB) | Vista Previa

Resumen

Global analyzers traditionally read and analyze the entire program at once, in a nonincremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a program which has already been analyzed. In these cases, it appears inecient to perform the analysis of the program again from scratch, as needs to be done with current systems. We describe how the xed-point algorithms used in current generic analysis engines for (constraint) logic programming languages can be extended to support incremental analysis. The possible changes to a program are classied into three types: addition, deletion, and arbitrary change. For each one of these, we provide one or more algorithms for identifying the parts of the analysis that must be recomputed and for performing the actual recomputation. The potential benets and drawbacks of these algorithms are discussed. Finally, we present some experimental results obtained with an implementation of the algorithms in the PLAI generic abstract interpretation framework. The results show signicant benets when using the proposed incremental analysis algorithms.

Más información

ID de Registro: 13472
Identificador DC: http://oa.upm.es/13472/
Identificador OAI: oai:oa.upm.es:13472
Identificador DOI: 10.1145/349214.349216
URL Oficial: http://dl.acm.org/citation.cfm?id=349214&CFID=167368878&CFTOKEN=84858823
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 03 Oct 2012 06:37
Ultima Modificación: 21 Abr 2016 12:47
  • 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
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM