1145 search results - page 6 / 229 » The Correctness of an Optimized Code Generation |
MEMOCODE
2003
IEEE
14 years 23 days ago
2003
IEEE
Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation ...
TIT
2010
13 years 2 months ago
2010
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
TIT
2010
13 years 2 months ago
2010
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One peculiarity with deletion-correcting codes is that perfect t-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, becaus...