Java Programs do not have bounded treewidth
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 depth of k+1 can give a control-flow-graph with treewidth 2k+1.
|Collections||ANU Research Publications|
|TR-CS-00-01.pdf||150.43 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.