462 search results - page 43 / 93 » Symbolic Bounded Synthesis |
162
click to vote
ICST
2009
IEEE
15 years 1 months ago
2009
IEEE
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
112
click to vote
TIT
2011
14 years 10 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
111
click to vote
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper describes two techniques to quantify energy consumption of burst-modeasynchronous(clock-less)controlcircuits. The circuit specifications consideredare extended burst-m...
173
click to vote
ISPAN
2002
IEEE
15 years 8 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
163
click to vote
ICDCS
1995
IEEE
15 years 7 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...