*Result*: Java Programs do not have Bounded Treewidth
Title:
Java Programs do not have Bounded Treewidth
Authors:
Contributors:
Software Tools for Telecommunications and Distributed Systems (RESEDAS), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), INRIA
Source:
https://hal.inria.fr/inria-00072784 ; [Research Report] RR-3870, INRIA. 2000, pp.6.
Publisher Information:
HAL CCSD
Publication Year:
2000
Collection:
Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe)
Subject Terms:
Document Type:
*Report*
report
Language:
English
Relation:
Report N°: RR-3870; inria-00072784; https://hal.inria.fr/inria-00072784; https://hal.inria.fr/inria-00072784/document; https://hal.inria.fr/inria-00072784/file/RR-3870.pdf
Availability:
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edsbas.C746B57F
Database:
BASE
*Further Information*
*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$.*