On the tree width of ada programs

Bernd Burgstaller, Johann Blieberger, Bernhard Scholz

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

8 Citations (Scopus)

Abstract

The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if the underlying graph structure is restricted to one of fixed tree width. In this paper we prove that the tree width of goto-free Ada programs without labeled loops is ≤ 6. In addition we show that both the use of gotos and the use of labeled loops can result in unbounded tree widths of Ada programs. The latter result suggested to study the tree width of actual Ada programs. We implemented a tool capable of calculating tight upper bounds of the tree width of a given Ada program efficiently. The results show that most existing Ada code has small tree width and thus allows efficient automatic static analysis for many well-known problems and – as a by-product – most Ada programs are very close to series-parallel programs.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsAlfred Strohmeier, Albert Llamosi
PublisherSpringer Verlag
Pages78-90
Number of pages13
ISBN (Print)3540220119
DOIs
Publication statusPublished - 2004
Event9th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2004 - Palma de Mallorca, Spain
Duration: 2004 Jun 142004 Jun 18

Publication series

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

Other

Other9th Ada-Europe International Conference on Reliable Software Technologies, Ada-Europe 2004
CountrySpain
CityPalma de Mallorca
Period04/6/1404/6/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the tree width of ada programs'. Together they form a unique fingerprint.

  • Cite this

    Burgstaller, B., Blieberger, J., & Scholz, B. (2004). On the tree width of ada programs. In A. Strohmeier, & A. Llamosi (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 78-90). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3063). Springer Verlag. https://doi.org/10.1007/978-3-540-24841-5_6