Talks and Poster Presentations (with Proceedings-Entry):

J. Blieberger, B. Burgstaller, B. Scholz:
"Busy Wait Analysis";
Talk: Reliable Software Technologies - Ada-Europe, Toulouse, France; 2003-06-16 - 2003-06-20; in: "Lecture Notes in Computer Science - Ada-Europe", Springer-Verlag, 2655 (2003), ISBN: 3-540-40376-0; 142 - 152.

English abstract:
A busy wait loop is a loop which repeatedly checks whether an event
occurs. Busy wait loops for process synchronization and
communication are considered bad practice because (1) system
failures may occur due to race conditions and (2) system resources
are wasted by busy wait loops. In general finding a busy wait loop
is an undecidable problem. To get a handle on the problem, we
introduce a decidable predicate for loops that will spot most
important classes of busy waiting although false alarms may occur.
The loop predicate for detecting busy wait loops is based on control
flow graph properties (such as loops) and program analysis

Online library catalogue of the TU Vienna:

Electronic version of the publication:

Created from the Publication Database of the Vienna University of Technology.