Sciweavers

1628 search results - page 111 / 326
» Compiler Construction Using Scheme
Sort
View
133
Voted
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 3 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
ICFP
2002
ACM
16 years 2 months ago
Typing dynamic typing
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
Arthur I. Baars, S. Doaitse Swierstra
CCGRID
2001
IEEE
15 years 6 months ago
KelpIO: A Telescope-Ready Domain-Specific I/O Library for Irregular Block-Structured Applications
To ameliorate the need to spend significant programmer time modifying parallel programs to achieve highperformance, while maintaining compact, comprehensible source codes, this pa...
Bradley Broom, Robert J. Fowler, Ken Kennedy
127
Voted
ASPLOS
2006
ACM
15 years 8 months ago
Tartan: evaluating spatial computation for whole program execution
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
Mahim Mishra, Timothy J. Callahan, Tiberiu Chelcea...
143
Voted
AOSD
2008
ACM
15 years 4 months ago
Modularity first: a case for mixing AOP and attribute grammars
We have reimplemented the frontend of the extensible AspectBench Compiler for AspectJ, using the aspect-oriented meta-compiler JastAdd. The original frontend was purely object-ori...
Pavel Avgustinov, Torbjörn Ekman, Julian Tibb...