The treewidth of Java programs
From MaRDI portal
Recommendations
Cited in
(10)- Pushdown reachability with constant treewidth
- Faster algorithms for quantitative verification in bounded treewidth graphs
- The tree-width of C
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- The complexity of register allocation
- Fixed-parameter tractability of treewidth and pathwidth
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Tree-decompositions of small pathwidth
- Efficient interprocedural data-flow analysis using treedepth and treewidth
- Witnessing subsystems for probabilistic systems with low tree width
This page was built for publication: The treewidth of Java programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4707790)