Java Programs do not have Bounded Treewidth - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

Java Programs do not have Bounded Treewidth

Ole A. Mæhle
  • Function : Author
Jan Arne Telle
  • Function : Author
  • PersonId : 889063


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


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3870.pdf (72.92 Ko) Télécharger le fichier

Dates and versions

inria-00072784 , version 1 (24-05-2006)


  • HAL Id : inria-00072784 , version 1


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⟩
44 View
83 Download


Gmail Facebook Twitter LinkedIn More