Predicting program execution times by analyzing static and dynamic program pathsopen access
- Authors
- Park, C.Y.
- Issue Date
- Mar-1993
- Publisher
- Kluwer Academic Publishers
- Citation
- Real-Time Systems, v.5, no.1, pp 31 - 62
- Pages
- 32
- Journal Title
- Real-Time Systems
- Volume
- 5
- Number
- 1
- Start Page
- 31
- End Page
- 62
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60674
- DOI
- 10.1007/BF01088696
- ISSN
- 0922-6443
1573-1383
- Abstract
- This paper describes a method to predict guaranteed and tight deterministic execution time bounds of a sequential program. The basic prediction technique is a static analysis based on simple timing schema for source-level language constructs, which gives accurate predictions in many cases. Using powerful user-provided information, dynamic path analysis refines looser predictions by eliminating infeasible paths and decomposing the possible execution behaviors in a pathwise manner. Overall prediction cost is scalable with respect to desired precision, controlling the amount of information provided. We introduce a formal path model for dynamic path analysis, where user execution information is represented by a set of program paths. With a well-defined practical high-level interface language, user information can be used in an easy and efficient way. We also introduce a method to verify given user information with known program verification techniques. Initial experiments with a timing tool show that safe and tight predictions are possible for a wide range of programs. The tool can also provide predictions for interesting subsets of program executions.
- Files in This Item
-
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60674)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.