Work

Java Programs do not have Bounded Treewidth

Year: 2000

Type: report

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

Source: ANU Open Research (Australian National University)

Authors: Gustedt, Jens, Maehle, Ole A., Telle, Jan Arne, Institut National de Recherche en Informatique et en Automatique (INRIA), 54 - Villers-les-Nancy (France). Unite de Recherche de Lorraine

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2173178994

FWCI:

Cites: 4

Cited by:

Related to: 10