462 search results - page 7 / 93 » Symbolic Bounded Synthesis |
PLDI
2000
ACM
15 years 1 months ago
2000
ACM
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
CAV
2010
Springer
15 years 1 months ago
2010
Springer
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. We present Comfusy, a tool that extends the compiler for the gener...
77
Voted
ADT
2005
14 years 9 months ago
2005
For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the ove...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...