Analysis of concurrent constraint logic programs with a fixed scheduling rule

Bueno Carrillo, Francisco y Hermenegildo, Manuel V. (1995). Analysis of concurrent constraint logic programs with a fixed scheduling rule. En: "ICLP95 WS on Abstract Interpretation of Logic Languages", June, 1995, Japan.

Descripción

Título: Analysis of concurrent constraint logic programs with a fixed scheduling rule
Autor/es:
  • Bueno Carrillo, Francisco
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: ICLP95 WS on Abstract Interpretation of Logic Languages
Fechas del Evento: June, 1995
Lugar del Evento: Japan
Título del Libro: ICLP95 WS on Abstract Interpretation of Logic Languages
Fecha: 1995
Materias:
Palabras Clave Informales: Concurrent constraint programming, Program analysis, Abstract interpretation, Andorra model, Programación restringida concurrente, Análisis de programas, Interpretación de resúmenes, Modelo de Andorra.
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 (577kB) | Vista Previa

Resumen

The analysis of concurrent constraint programs is a challenge due to the inherently concurrent behaviour of its computational model. However, most implementations of the concurrent paradigm can be viewed as a computation with a fixed scheduling rule which suspends some goals so that their execution is postponed until some condition awakens them. For a certain kind of properties, an analysis defined in these terms is correct. Furthermore, it is much more tractable, and in addition can make use of existing analysis technology for the underlying fixed computation rule. We show how this can be done when the starting point is a framework for the analysis of sequential programs. The resulting analysis, which incorporates suspensions, is adequate for concurrent models where concurrency is localized, e.g. the Andorra model. We refine the analysis for this particular case. Another model in which concurrency is preferably encapsulated, and thus suspensions are local to parts of the computation, is that of CIAO. Nonetheless, the analysis scheme can be generalized to models with global concurrency. We also sketch how this could be done, and we show how the resulting analysis framework could be used for analyzing typical properties, such as suspensión freeness.

Más información

ID de Registro: 14685
Identificador DC: http://oa.upm.es/14685/
Identificador OAI: oai:oa.upm.es:14685
URL Oficial: http://clip.dia.fi.upm.es/clippubsbyyear/node20.html
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 26 Mar 2013 09:41
Ultima Modificación: 21 Abr 2016 14:27
  • 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