Static detection of livelocks in ada multitasking programs

Johann Blieberger, Bernd Burgstaller, Robert Mittermayr

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationReliable Software Technologies - Ada-Europe 2007 - 12th Ada-Europe International Conference on Reliable Software Technologies, Proceedings
Pages69-83
Number of pages15
Publication statusPublished - 2007 Dec 1
Event12th Ada-Europe International Conference on Reliable Software Technologies - Geneva, Switzerland
Duration: 2007 Jun 252007 Jun 29

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4498 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th Ada-Europe International Conference on Reliable Software Technologies
CountrySwitzerland
CityGeneva
Period07/6/2507/6/29

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Blieberger, J., Burgstaller, B., & Mittermayr, R. (2007). Static detection of livelocks in ada multitasking programs. In Reliable Software Technologies - Ada-Europe 2007 - 12th Ada-Europe International Conference on Reliable Software Technologies, Proceedings (pp. 69-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4498 LNCS).