Abstract

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

Citations

2570	Scheduling algorithms for multiprogramming in a hard-real-time environment - Liu, Layland - 1973
2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
248	Calculating the maximum execution time of real-time programs - Puschner, Ch - 1989
198	and Bjarne Stroustrup. The Annotated C++ Reference Manual - Ellis - 1990
156	Reasoning about time in higher level language software - Shaw - 1989
150	Distributed fault-tolerant real-time systems: the MARS approach - KOPETZ, DAMM, et al. - 1989
118	Predicting program execution times by analyzing static and dynamic program paths - Park - 1993
109	Real-time Euclid: A language for reliable real-time systems - Kligerman, Stoyenko - 1986
80	High integrity Ada: the Spark approach - Barnes - 1997
57	Object-Oriented Real-Time Language Design: Constructs for Timing Constraints - Ishikawa, Tokuda, et al. - 1990
44	Evaluating Tight Execution Time Bounds of Programs by Annotations - Mok - 1989
42	Multi dimensional searching and computational geometry, volume 3 of Data structures and algorithms - Mehlhorn - 1984
33	Constructing predictable real time systems - Halang, Stoyenko - 1991
30	Symbolic evaluation and the analysis of programs - Cheatham, Holloway, et al. - 1979
28	1984], Graph algorithms and NPcompleteness - Mehlhorn
23	The design of real-time programming systems based on process models - Mok - 1984
21	Symbolic evaluation for parallelizing compilers - Fahringer, Scholz - 1997
20	95 Reference Manual - ISOIEC - 1995
14	Discrete loops and worst case performance - Blieberger - 1994
11	Data-flow frameworks for worst-case execution time analysis - Blieberger
9	Worst-case space and time complexity of recursive procedures - Blieberger, Lieger - 1996
5	Symbolic Reaching Definitions Analysis of Ada Programs - Blieberger, Burgstaller - 1998
4	Using the worst-case execution analyser - Forsyth - 1993
3	A semantic model for the analysis and verification of programs in general higher-level languages - Ploedereder - 1980
2	Java for real-time, Real-Time Systems 11 - Nilsen - 1996
2	Symbolische Verifikation von Echtzeitprogrammen, Diploma thesis - Scholz - 1996
1	66 253, Teil 2, Beuth - DIN - 1982
1	Gehani and Krithi Ramamritham, Real-time Concurrent C: A language for programming dynamic real-time systems - Narain - 1991
1	Mehlhorn, Sorting and searching - Kurt - 1984
1	The desi#n and analysis of computer al#orithms - Aho, Hopcroft, et al. - 1974
1	Hi#h Inte#rity Ada - The SPARK Approach - Barnes - 1997
1	Symbolic reachin# definitions analysis of Ada pro#rams - Blieberger, Burgstaller - 1998
1	Symbolische Verifikation yon Echtzeitprogrammen, Diploma thesis - Scholz - 1996