Discrete Loops and Worst Case Performance

Discrete Loops and Worst Case Performance (1994)

by Johann Blieberger

Venue:	Computer Languages
Citations:	14 - 7 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Discrete Loops and Worst Case Performance	INFERENCE
AUTHOR NAME	Johann Blieberger	SVM HeaderParse 0.1
AUTHOR AFFIL	; DEPARTMENT OF AUTOMATION (183/1); A-1040 VIENNA	SVM HeaderParse 0.2
AUTHOR ADDR	; AUSTRIA	SVM HeaderParse 0.1
ABSTRACT	In this paper so-called discrete loops are introduced which narrow the gap between general loops (e.g. while- or repeat-loops) and for-loops. Alt- hough discrete loops can be used for applications that would otherwise require general loops, discrete loops are known to complete in any case. Furthermore it is possible to determine the number of iterations of a discrete loop, while this is trivial to do for for-loops and extremely difficult for general loops. Thus discrete loops form an ideal frame-work for determining the worst case timing behavior of a program and they are especially useful in implementing real-time systems and proving such systems correct.	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	Computer Languages	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	193--212	INFERENCE
VOLUME	20	INFERENCE
CITATIONS	21 found	ParsCit 1.0