TY - GEN
T1 - Static detection of livelocks in ada multitasking programs
AU - Blieberger, Johann
AU - Burgstaller, Bernd
AU - Mittermayr, Robert
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=37849032748&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=37849032748&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-73230-3_6
DO - 10.1007/978-3-540-73230-3_6
M3 - Conference contribution
AN - SCOPUS:37849032748
SN - 9783540732297
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 69
EP - 83
BT - Reliable Software Technologies - Ada-Europe 2007 - 12th Ada-Europe International Conference on Reliable Software Technologies, Proceedings
PB - Springer Verlag
T2 - 12th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2007
Y2 - 25 June 2007 through 29 June 2007
ER -