Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Calculating the maximum, execution time of real-time programs
Real-Time Systems
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
Abstract debugging of higher-order imperative languages
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Predicting program execution times by analyzing static and dynamic program paths
Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis
Accurate static branch prediction by value range propagation
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Performance analysis of embedded software using implicit path enumeration
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
An overview of RealTimeTalk, a design framework for real-time systems
Journal of Parallel and Distributed Computing - Special issue on object-oriented real-time systems
Discrete loops and worst case performance
Computer Languages
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Smalltalk-80: The Language
Deriving Annotations for Tight Calculation of Execution Time
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Generalized Constant Propagation: A Study in C
CC '96 Proceedings of the 6th International Conference on Compiler Construction
Hi-index | 0.00 |
This paper presents a new method for deriving path and loop annotations automatically for object-oriented real-time programs. Such annotations are necessary when the worst case execution time (WCET) of programs is to be calculated. Normally these annotations must be given manually by the programmer.By automating the the generation of annotations the user is relieved from a task that can be quite difficult and highly critical. If, for example, a programmer gives a too optimistic annotation for a loop, a tool may calculate a too short WCET. This may invalidate subsequent analysis, leading to that a real-time system may violate its real-time properties.The method is based on the notion of abstract interpretation, and is illustrated by showing the analysis of an example in Smalltalk.The paper also discusses alternatives to the semantic analysis used in the method. It is shown that syntactic analysis suffices in some cases, and that it can be used to reduce the calculation cost for loops.