Termination and cost analysis: Complexity and precision issues

Masud, Abu Nase (2012). Termination and cost analysis: Complexity and precision issues. Tesis (Doctoral), Facultad de Informática (UPM) [antigua denominación].

Descripción

Título: Termination and cost analysis: Complexity and precision issues
Autor/es:
  • Masud, Abu Nase
Director/es:
  • Puebla Sánchez, Alvaro Germán
  • Genaim, Samir
Tipo de Documento: Tesis (Doctoral)
Fecha: Noviembre 2012
Materias:
Palabras Clave Informales: Static analysis, Cost analysis, Termination analysis, Recurrence equations, Complexity, An�álisis est�ático de programas, An�álisis de coste, An�álisis de terminaci�ón, Ecuaciones de recurrencia, Complejidad computacional.
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
Pdf - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

The research in this thesis is related to static cost and termination analysis. Cost analysis aims at estimating the amount of resources that a given program consumes during the execution, and termination analysis aims at proving that the execution of a given program will eventually terminate. These analyses are strongly related, indeed cost analysis techniques heavily rely on techniques developed for termination analysis. Precision, scalability, and applicability are essential in static analysis in general. Precision is related to the quality of the inferred results, scalability to the size of programs that can be analyzed, and applicability to the class of programs that can be handled by the analysis (independently from precision and scalability issues). This thesis addresses these aspects in the context of cost and termination analysis, from both practical and theoretical perspectives. For cost analysis, we concentrate on the problem of solving cost relations (a form of recurrence relations) into closed-form upper and lower bounds, which is the heart of most modern cost analyzers, and also where most of the precision and applicability limitations can be found. We develop tools, and their underlying theoretical foundations, for solving cost relations that overcome the limitations of existing approaches, and demonstrate superiority in both precision and applicability. A unique feature of our techniques is the ability to smoothly handle both lower and upper bounds, by reversing the corresponding notions in the underlying theory. For termination analysis, we study the hardness of the problem of deciding termination for a speci�c form of simple loops that arise in the context of cost analysis. This study gives a better understanding of the (theoretical) limits of scalability and applicability for both termination and cost analysis.

Más información

ID de Registro: 14944
Identificador DC: http://oa.upm.es/14944/
Identificador OAI: oai:oa.upm.es:14944
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 23 Abr 2013 07:11
Ultima Modificación: 21 Abr 2016 14: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