462 search results - page 13 / 93 » Symbolic Bounded Synthesis |
131
click to vote
MEMOCODE
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
108
click to vote
PTS
2010
15 years 7 days ago
2010
We propose a symbolic framework called guarded labeled assignment systems or GLASs and show how GLASs can be used as a foundation for symbolic analysis of various aspects of forma...
116
click to vote
ICCAD
2002
IEEE
15 years 10 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
111
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
103
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...