1246 search results - page 219 / 250 » Recursive Timed Automata |
TGC
2005
Springer
14 years 4 months ago
2005
Springer
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
IEEEINTERACT
2003
IEEE
14 years 4 months ago
2003
IEEE
For call intensive programs, function calls are major bottlenecks during program execution since they usually force register contents to be spilled into memory. Such register to m...
ISQED
2003
IEEE
14 years 4 months ago
2003
IEEE
This paper describes the use of integer equations for high level modeling digital circuits for application of formal verification properties at this level. Most formal verificatio...
ADBIS
2003
Springer
14 years 4 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
DATE
2010
IEEE
14 years 4 months ago
2010
IEEE
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...