Efficient top-down set-sharing analysis using cliques

Navas, J.; Bueno Carrillo, Francisco y Hermenegildo, Manuel V. (2006). Efficient top-down set-sharing analysis using cliques. En: "8th International Symposium, PADL 2006", January 9-10, 2006, Charleston, SC, USA. ISBN 978-3-540-30947-5.

Descripción

Título: Efficient top-down set-sharing analysis using cliques
Autor/es:
  • Navas, J.
  • Bueno Carrillo, Francisco
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 8th International Symposium, PADL 2006
Fechas del Evento: January 9-10, 2006
Lugar del Evento: Charleston, SC, USA
Título del Libro: Practical Aspects of Declarative Languages
Fecha: 2006
ISBN: 978-3-540-30947-5
Volumen: 3819
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 (955kB) | Vista Previa

Resumen

Abstract. We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case of inferring pair-sharing. We use the clique-set representation for (1) inferring actual set-sharing information, and (2) analysis within a top-down framework. In particular, we define the new abstract functions required by standard top-down analyses, both for sharing alone and also for the case of including freeness in addition to sharing. We use cliques both as an alternative representation and as widening, defining several widening operators. Our experimental evaluation supports the conclusión that, for inferring set-sharing, as it was the case for inferring pair-sharing, precisión losses are limited, while useful efficieney gains are obtained. We also derive useful conclusions regarding the interactions between thresholds, precisión, efficieney and cost of widening. At the limit, the clique-set representation allowed analyzing some programs that exceeded memory capacity using classical sharing representations.

Más información

ID de Registro: 14356
Identificador DC: http://oa.upm.es/14356/
Identificador OAI: oai:oa.upm.es:14356
URL Oficial: http://link.springer.com/chapter/10.1007%2F11603023_13
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 25 Ene 2013 08:46
Ultima Modificación: 21 Abr 2016 13:59
  • 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