HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Java Programs do not have Bounded Treewidth

Jens Gustedt 1 Ole A. Mæhle Jan Arne Telle
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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$.
Document type :
Reports
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00072784
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:53:27 AM
Last modification on : Friday, February 4, 2022 - 3:31:27 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:22:19 PM

Identifiers

  • HAL Id : inria-00072784, version 1

Collections

Citation

Jens Gustedt, Ole A. Mæhle, Jan Arne Telle. Java Programs do not have Bounded Treewidth. [Research Report] RR-3870, INRIA. 2000, pp.6. ⟨inria-00072784⟩

Share

Metrics

Record views

41

Files downloads

70