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

Johann Blieberger; Bernd Burgstaller; Bernhard Scholz

doi:10.1007/10722060_21

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

Johann Blieberger, Bernd Burgstaller, Bernhard Scholz

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Reliable Software Technologies Ada-Europe 2000 - 5th Ada-Europe International Conference, Proceedings
Editors	Hubert B. Keller, Erhard Plodereder
Publisher	Springer Verlag
Pages	225-237
Number of pages	13
ISBN (Print)	3540676694, 9783540676690
DOIs	https://doi.org/10.1007/10722060_21
Publication status	Published - 2000
Event	5th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2000 - Potsdam, Germany Duration: 2000 Jun 26 → 2000 Jun 30

Publication series

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

Other

Other	5th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2000
Country	Germany
City	Potsdam
Period	00/6/26 → 00/6/30

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/10722060_21

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

Blieberger, Johann ; Burgstaller, Bernd ; Scholz, Bernhard. / Symbolic data flow analysis for detecting dead locks in ada tasking programs. Reliable Software Technologies Ada-Europe 2000 - 5th Ada-Europe International Conference, Proceedings. editor / Hubert B. Keller ; Erhard Plodereder. Springer Verlag, 2000. pp. 225-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d6f59572f8dd4c6a9ce4f00076fa8575,

title = "Symbolic data flow analysis for detecting dead locks in ada tasking programs",

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.",

author = "Johann Blieberger and Bernd Burgstaller and Bernhard Scholz",

year = "2000",

doi = "10.1007/10722060_21",

language = "English",

isbn = "3540676694",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "225--237",

editor = "Keller, {Hubert B.} and Erhard Plodereder",

booktitle = "Reliable Software Technologies Ada-Europe 2000 - 5th Ada-Europe International Conference, Proceedings",

address = "Germany",

note = "5th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2000 ; Conference date: 26-06-2000 Through 30-06-2000",

}

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

Symbolic data flow analysis for detecting dead locks in ada tasking programs. / Blieberger, Johann; Burgstaller, Bernd; Scholz, Bernhard.

Reliable Software Technologies Ada-Europe 2000 - 5th Ada-Europe International Conference, Proceedings. ed. / Hubert B. Keller; Erhard Plodereder. Springer Verlag, 2000. p. 225-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1845).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Blieberger, Johann

AU - Burgstaller, Bernd

AU - Scholz, Bernhard

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84956993041&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956993041&partnerID=8YFLogxK

U2 - 10.1007/10722060_21

DO - 10.1007/10722060_21

M3 - Conference contribution

AN - SCOPUS:84956993041

SN - 3540676694

SN - 9783540676690

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 225

EP - 237

BT - Reliable Software Technologies Ada-Europe 2000 - 5th Ada-Europe International Conference, Proceedings

A2 - Keller, Hubert B.

A2 - Plodereder, Erhard

PB - Springer Verlag

T2 - 5th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2000

Y2 - 26 June 2000 through 30 June 2000

ER -

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