945 search results - page 23 / 189 » Incremental Branching Programs |
CAV
2001
Springer
13 years 11 months ago
2001
Springer
Compositional model checking is used to verify a processor microarchitecture containing most of the features of a modern microprocessor, including branch prediction, speculative ex...
MICRO
2003
IEEE
14 years 28 days ago
2003
IEEE
Detecting program phase changes accurately is an important aspect of dynamically adaptable systems. Three dynamic program phase detection techniques are compared – using instruc...
ICALP
2003
Springer
14 years 26 days ago
2003
Springer
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
PLDI
1997
ACM
13 years 12 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
ICALP
1997
Springer
13 years 11 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....