A flexible (C)LP-based approach to the analysis of object-oriented programs

Méndez-Lojo, Mario; Navas, J. y Hermenegildo, Manuel V. (2008). A flexible (C)LP-based approach to the analysis of object-oriented programs. En: "17th International Symposium, LOPSTR 2007", August 23-24, 2007, Kongens Lyngby, Denmark. ISBN 978-3-540-78768-6.

Descripción

Título: A flexible (C)LP-based approach to the analysis of object-oriented programs
Autor/es:
  • Méndez-Lojo, Mario
  • Navas, J.
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 17th International Symposium, LOPSTR 2007
Fechas del Evento: August 23-24, 2007
Lugar del Evento: Kongens Lyngby, Denmark
Título del Libro: Logic-Based Program Synthesis and Transformation
Fecha: 2008
ISBN: 978-3-540-78768-6
Volumen: 4915
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 (910kB) | Vista Previa

Resumen

Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of the work involving object-oriented languages and abstract interpretation usually omits the description of that language or just refers to the Control Flow Graph(CFG) it represents. However, this lack of formalization on one hand results in an absence of assurances regarding the correctness of the transformation and on the other it typically strongly couples the analysis to the source language. In this work we present a framework for analysis of object-oriented languages in which in a first phase we transform the input program into a representation based on Horn clauses. This allows on one hand proving the transformation correct attending to a simple condition and on the other being able to apply an existing analyzer for (constraint) logic programming to automatically derive a safe approximation of the semantics of the original program. The approach is flexible in the sense that the first phase decouples the analyzer from most languagedependent features, and correct because the set of Horn clauses returned by the transformation phase safely approximates the standard semantics of the input program. The resulting analysis is also reasonably scalable due to the use of mature, modular (C)LP-based analyzers. The overall approach allows us to report results for medium-sized programs.

Más información

ID de Registro: 14319
Identificador DC: http://oa.upm.es/14319/
Identificador OAI: oai:oa.upm.es:14319
URL Oficial: http://link.springer.com/chapter/10.1007%2F978-3-540-78769-3_11?LI=true
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 19 Ene 2013 13:34
Ultima Modificación: 21 Abr 2016 13:56
  • 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