Automatic Accurate Time-Bound Analysis for High-Level Languages (1998)
Cached
Download Links
- [www.cs.indiana.edu]
- [ftp.cs.indiana.edu]
- [www.cs.indiana.edu]
- [www.cs.indiana.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems, volume 1474 of Lecture Notes in Computer Science |
| Citations: | 36 - 9 self |
BibTeX
@INPROCEEDINGS{Liu98automaticaccurate,
author = {Yanhong Liu and Gustavo Gomez},
title = {Automatic Accurate Time-Bound Analysis for High-Level Languages},
booktitle = {In Proceedings of the ACM SIGPLAN 1998 Workshop on Languages, Compilers, and Tools for Embedded Systems, volume 1474 of Lecture Notes in Computer Science},
year = {1998},
pages = {31--40},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes a general approach for automatic and accurate time-bound analysis. 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 overall analysis efficient as well as accurate, and measurements of primitive parameters, all at the source-language level. We have implemented this approach and performed a number of experiments for analyzing Scheme programs. The measured worst-case times are closely bounded by the calculated bounds. 1 Introduction Analysis of program running time is important for real-time systems, interactive environments, compiler optimizations, performance evaluation, and many other computer applications. It has been extensively studied in many fields of computer science: algorithms [20, 12, 13, 41], programming languages [38, 21, 30, 33], and systems [35, 28, 32, 31]. It is particularl...
