Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Real-time Euclid: a language for reliable real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
PORTAL language description
Reasoning About Time in Higher-Level Language Software
IEEE Transactions on Software Engineering
The annotated C++ reference manual
The annotated C++ reference manual
Object oriented design with applications
Object oriented design with applications
Calculating the maximum, execution time of real-time programs
Real-Time Systems
Object-oriented real-time language design: constructs for timing constraints
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
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
Discrete loops and worst case performance
Computer Languages
Worst-case space and time complexity of recursive procedures
Real-Time Systems
Real-Time Systems
Symbolic evaluation for parallelizing compilers
ICS '97 Proceedings of the 11th international conference on Supercomputing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Constructing Predictable Real Time Systems
Constructing Predictable Real Time Systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Data-Flow Frameworks for Worst-Case Execution Time Analysis
Real-Time Systems
Symbolic Reaching Definitions Analysis of Ada Programs
Ada-Europe '98 Proceedings of the 1998 Ada-Europe International Conference on Reliable Software Technologies
Data-Flow Frameworks for Worst-Case Execution Time Analysis
Real-Time Systems
Intra-task scenario-aware voltage scheduling
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
| Hi-index | 0.00 |
The purpose of this paper is to show that indirect recursive procedures can be used for implementing real-time applications without harm, if a few conditions are met. These conditions ensure that upper bounds for space and time requirements can be derived at compile time. Moreover they are simple enough such that many important recursive algorithms can be implemented. In addition, our approach allows for concentrating on essential properties of the parameter space during space and time analysis. This is done by morphisms that transfer important properties from the original parameter space to simpler ones, which results in simpler formulas of space and time estimates. 2001 Elsevier Science