Symbolic data flow analysis for detecting dead locks in ada tasking programs

Johann Blieberger, Bernd Burgstaller, Bernhard Scholz

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

19 Citations (Scopus)

Abstract

It is well accepted that designing and analyzing concurrent software-components are tedious tasks. Assuring the quality of such software requires formal methods, which can statically detect deadlocks. This paper presents a symbolic data flow analysis framework for detecting deadlocks in Ada programs with tasks. The symbolic data flow framework is based on symbolic evaluation – an advanced technique to statically determine properties of programs. The framework can guarantee the deadlock-freeness for an arbitrary hardware environment. Our approach differs from existing work in that tasks can be dynamically created and completed in the program. Examples are used to illustrate our approach.

Original languageEnglish
Title of host publicationReliable Software Technologies Ada-Europe 2000 - 5th Ada-Europe International Conference, Proceedings
EditorsHubert B. Keller, Erhard Plodereder
PublisherSpringer Verlag
Pages225-237
Number of pages13
ISBN (Print)3540676694, 9783540676690
DOIs
Publication statusPublished - 2000
Event5th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2000 - Potsdam, Germany
Duration: 2000 Jun 262000 Jun 30

Publication series

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

Other

Other5th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2000
CountryGermany
CityPotsdam
Period00/6/2600/6/30

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Symbolic data flow analysis for detecting dead locks in ada tasking programs'. Together they form a unique fingerprint.

  • Cite this

    Blieberger, J., Burgstaller, B., & Scholz, B. (2000). Symbolic data flow analysis for detecting dead locks in ada tasking programs. In H. B. Keller, & E. Plodereder (Eds.), Reliable Software Technologies Ada-Europe 2000 - 5th Ada-Europe International Conference, Proceedings (pp. 225-237). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1845). Springer Verlag. https://doi.org/10.1007/10722060_21