Termination and cost analysis: Complexity and precision issues

Masud, Abu Nase (2012). Termination and cost analysis: Complexity and precision issues. Thesis (Doctoral), Facultad de Informática (UPM). https://doi.org/10.20868/UPM.thesis.14944.


Title: Termination and cost analysis: Complexity and precision issues
  • Masud, Abu Nase
  • Puebla Sánchez, Alvaro Germán
  • Genaim, Samir
Item Type: Thesis (Doctoral)
Read date: November 2012
Freetext Keywords: 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.
Faculty: Facultad de Informática (UPM)
Department: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[thumbnail of ABU_NASER_MASUD.pdf]
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview


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.

More information

Item ID: 14944
DC Identifier: https://oa.upm.es/14944/
OAI Identifier: oai:oa.upm.es:14944
DOI: 10.20868/UPM.thesis.14944
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 23 Apr 2013 07:11
Last Modified: 10 Oct 2022 09:21
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM