Show simple item record

dc.contributor.advisor Wise, David S en
dc.contributor.author Gomez, Gustavo en
dc.date.accessioned 2010-06-01T21:59:15Z en
dc.date.available 2027-02-01T22:59:15Z en
dc.date.available 2011-04-16T17:01:49Z
dc.date.issued 2010-06-01T21:59:15Z en
dc.date.submitted 2006 en
dc.identifier.uri http://hdl.handle.net/2022/7459 en
dc.description Thesis (PhD) - Indiana University, Computer Sciences, 2006 en
dc.description.abstract 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. en
dc.language.iso EN en
dc.publisher [Bloomington, Ind.] : Indiana University en
dc.rights This work is licensed under the Creative Commons Attribution No Deriviatives 3.0 Unported License. en
dc.rights.uri http://creativecommons.org/licenses/by-nd/3.0/ en
dc.subject worst-case execution time en
dc.subject optimization en
dc.subject static analysis en
dc.subject.classification Computer Science (0984) en
dc.title Automatic Time-Bound Analysis for High-Level Languages en
dc.type Doctoral Dissertation en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search IUScholarWorks


Advanced Search

Browse

My Account

Statistics