Java Programs do not have bounded treewidth

Gustedt, Jens; Maehle, Ole; Telle, Jan Arne

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Java Programs do not have bounded treewidth

Date

2000

Authors

Gustedt, Jens

Maehle, Ole

Telle, Jan Arne

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 depth of k+1 can give a control-flow-graph with treewidth 2k+1.