Two efficient representations for set-sharing analysis in logic programs

Trias, Eric; Navas, J.; Ackley, Elena S.; Forrest, Stephanie y Hermenegildo, Manuel V. (2008). Two efficient representations for set-sharing analysis in logic programs. En: "17th Int'l Workshop on Functional and (Constraint) Logic Programming", July 3-4, 2008, Siena, Italy.

Descripción

Título: Two efficient representations for set-sharing analysis in logic programs
Autor/es:
  • Trias, Eric
  • Navas, J.
  • Ackley, Elena S.
  • Forrest, Stephanie
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 17th Int'l Workshop on Functional and (Constraint) Logic Programming
Fechas del Evento: July 3-4, 2008
Lugar del Evento: Siena, Italy
Título del Libro: 17th International Workshop on Functional and (Constraint) Logic Programming, WFLP'08
Fecha: Julio 2008
Materias:
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

Set-Sharing analysis, the classic Jacobs and Langen's domain, has been widely used to infer several interesting properties of programs at compile-time such as occurs-check reduction, automatic parallelization, flnite-tree analysis, etc. However, performing abstract uniflcation over this domain implies the use of a closure operation which makes the number of sharing groups grow exponentially. Much attention has been given in the literature to mitígate this key inefficiency in this otherwise very useful domain. In this paper we present two novel alternative representations for the traditional set-sharing domain, tSH and tNSH. which compress efficiently the number of elements into fewer elements enabling more efficient abstract operations, including abstract uniflcation, without any loss of accuracy. Our experimental evaluation supports that both representations can reduce dramatically the number of sharing groups showing they can be more practical solutions towards scalable set-sharing.

Más información

ID de Registro: 14595
Identificador DC: http://oa.upm.es/14595/
Identificador OAI: oai:oa.upm.es:14595
URL Oficial: http://wflp08.dimi.uniud.it
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 06 Mar 2013 07:33
Ultima Modificación: 21 Abr 2016 14:19
  • 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