(Enter summary)
Abstract: . The purpose of this paper is to show that 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, for
example Mergesort or recursive tree-traversal algorithms.
In addition, our approach allows for concentrating on essential... (Update)
Context of citations to this paper: More
.... can be used in real time programming languages (cf. Bli94] and that recursion can be employed without harm in real time systems (cf. BL96, Bli00] the concept of schedulability analysis, which is also introduced in [HS91] is still very important for real time applications....
.... arises, and it is theoretically 3 challenging: optimizing the cost bound function to a closed form in terms of the input size [50, 10, 26, 41, 17, 7]. Although much progress has been made in this area, closed forms are known only for subclasses of functions. Thus, such...
Cited by: More
Checking and Bounding the Solutions - Of Some Recurrence
(Correct)
Real-Time Recursive Procedures - Biteberger Lieger Technical
(Correct)
Automatic Accurate Cost-Bound Analysis for High-Level Languages - Liu, Gómez (2001)
(Correct)
Similar documents (at the sentence level):
33.0%: Real-Time Systems, , 1-32 0 - Worst-Case Space And
(Correct)
25.9%: Real-Time Properties of Indirect Recursive Procedures - Blieberger (2000)
(Correct)
19.5%: Real-Time Properties of Indirect Recursive - Johann Blieberger Institut
(Correct)
Active bibliography (related documents): More All
0.0: VERTAF:An Object-Oriented Application Framework for.. - Hsiung, Lee, See, Fu.. (2002)
(Correct)
0.0: Semantics for a Real-Time Object-Oriented Programming Language - Satoh, Tokoro (1994)
(Correct)
0.0: Program Representation and Translation for Predictable Real-Time.. - Niehaus (1991)
(Correct)
Similar documents based on text: More All
0.8: Multi-Staged Discrete Loops - For Real-Time Systems
(Correct)
0.7: Discrete Loops and Worst Case Performance - Blieberger (1994)
(Correct)
0.4: On the Tree Width of Ada Programs - Burgstaller, Blieberger, Scholz
(Correct)
Related documents from co-citation: More All
4: Calculating the maximum execution times of realtime programs (context) - Puschner, Koza - 1989
4: Real-Time Concurrent C: A Language for Programming Dynamic Real-Time Systems (context) - Gehani, Ramamritham - 1991
4: Constructing Predictable Real-Time Systems (context) - Halang, Stoyenko - 1991
BibTeX entry: (Update)
Blieberger, J. and R. Lieger: 1996, `Worst-Case Space and Time Complexity of Recursive Procedures'. Real-Time Systems 11(2), 115--144. http://citeseer.ist.psu.edu/blieberger96worstcase.html More
@article{ blieberger96worstcase,
author = "Johann Blieberger and Roland Lieger",
title = "Worst-Case Space and Time Complexity of Recursive Procedures",
journal = "Real-Time Systems",
volume = "11",
number = "2",
pages = "115-144",
year = "1996",
url = "citeseer.ist.psu.edu/blieberger96worstcase.html" }
Citations (may not include all citations):
57
Object-oriented real-time language design: Constructs for ti.. (context) - Ishikawa, Tokuda et al. - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.auto.tuwien.ac.at/~blieb/papers.html): More
Multi-Staged Discrete Loops for Real-Time Systems - Lieger, Blieberger
(Correct)
Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999)
(Correct)
Symbolic Pointer Analysis for Detecting Memory Leaks - Scholz, Blieberger, Fahringer (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC