Sciweavers

145 search results - page 14 / 29
» A compiled implementation of strong reduction
Sort
View
DATE
2007
IEEE
157views Hardware» more  DATE 2007»
14 years 3 months ago
Energy evaluation of software implementations of block ciphers under memory constraints
Software implementations of modern block ciphers often require large lookup tables along with code size increasing optimizations like loop unrolling to reach peak performance on g...
Johann Großschädl, Stefan Tillich, Chri...
ESOP
2001
Springer
14 years 1 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
ML
2006
ACM
14 years 2 months ago
Seminal: searching for ML type-error messages
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
Benjamin S. Lerner, Dan Grossman, Craig Chambers
POPL
2005
ACM
14 years 9 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
JUCS
2011
97views more  JUCS 2011»
13 years 3 months ago
An OCR Free Method for Word Spotting in Printed Documents: the Evaluation of Different Feature Sets
: An OCR free word spotting method is developed and evaluated under a strong experimental protocol. Different feature sets are evaluated under the same experimental conditions. In ...
Israel Rios, Alceu de Souza Britto Jr., Alessandro...