ANU Computer Science Technical Reports

TR-CS-00-01

Jens Gustedt, Ole A. Maehle, and Jan Arne Telle.
Java programs do not have bounded treewidth.
February 2000.

[POSTSCRIPT (72266 bytes)] [PDF (154043 bytes)] [EPrints archive]

Abstract: We show that the control-flow graphs of Java programs, due to the labelled break and continue statements, have no upper bound on their treewidth. A single Java method containing k labels and a loop nesting deep of k+1 can give a control-flow -graph with treewidth 2k+1.

Technical Reports <Technical-DOT-Reports-AT-cs-DOT-anu.edu.au>

Last modified: Tue May 31 12:56:00 EST 2011