Sciweavers

Share
ADAEUROPE
2007
Springer

Static Detection of Livelocks in Ada Multitasking Programs

9 years 6 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they can be expected to run in polynomial time. Since the problem is strongly connected to finding infinite loops, which is undecidable in general, our algorithms compute only an approximation to the real solution of the problem. As a consequence our algorithms may compute false positives.
Johann Blieberger, Bernd Burgstaller, Robert Mitte
Added 06 Jun 2010
Updated 06 Jun 2010
Type Conference
Year 2007
Where ADAEUROPE
Authors Johann Blieberger, Bernd Burgstaller, Robert Mittermayr
Comments (0)
books