19 search results - page 1 / 4 » On the Tree Width of Ada Programs |
ADAEUROPE
2004
Springer
13 years 9 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
CPAIOR
2007
Springer
13 years 10 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
ADAEUROPE
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The control flow graph is the basis for many code optimisation and analysis techniques. We introduce a new framework for the construction of powerful CFG-based represent...
CAV
2003
Springer
13 years 9 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
ISPD
1997
ACM
13 years 8 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...