Automatic Time-Bound Analysis for High-Level Languages

Analysis of program running time is important for reactive systems, interactive environments, compiler optimizations, performance evaluation, and many other computer applications. Automatic and efficient prediction of accurate time bounds is particularly important, and being able to do so for high-level languages is particularly desirable. This dissertation presents a general approach for automatic and accurate time-bound analysis for high-level languages, combining methods and techniques studied in theory, languages, and systems. The approach consists of transformations for building time-bound functions in the presence of partially known input structures, symbolic evaluation of the time-bound function based on input parameters, optimizations to make the analysis efficient as well as accurate, and measurements of primitive parameters, all at the source-language level. We describe analysis and transformation algorithms and explain how they work. We have implemented this approach and performed a large number of experiments analyzing Scheme programs. The measured worst-case times are closely bounded by the calculated bounds. We describe our prototype system, ALPA, as well as the analysis and measurement results.

Grantor dc:publisher

[Bloomington, Ind.] : Indiana University

Year dc:date.issued

2010

Author dc:creator

• Gomez, Gustavo

Advisor dc:contributor.advisor

• Wise, David S

• worst-case execution time
• optimization
• static analysis

Statement dc:rights

• This work is licensed under the Creative Commons Attribution No Deriviatives 3.0 Unported License.

Licence dc:rights.uri

• http://creativecommons.org/licenses/by-nd/3.0/

Language dc:language.iso

EN

Handle dc:identifier.uri

https://hdl.handle.net/2022/7459

OAI identifier oai:identifier

oai:scholarworks.iu.edu:2022/7459