Sciweavers

797 search results - page 81 / 160
» MODULA-2 and Its Compilation
Sort
View
ICFP
1999
ACM
15 years 8 months ago
Transparent Modules with Fully Syntactic Signatures
ML-style modules are valuable in the development and maintenance of large software systems, unfortunately, none of the existing languages support them in a fully satisfactory mann...
Zhong Shao
ICS
1999
Tsinghua U.
15 years 8 months ago
Reducing cache misses using hardware and software page placement
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...
Timothy Sherwood, Brad Calder, Joel S. Emer
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 8 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
ARCS
2006
Springer
15 years 8 months ago
Microcode with Embedded Timing Constraints
: Watchdogs are a well-known and widespread means to increase the safety of microprocessors. The programmer or the compiler must insert instructions to reset the watchdog. If the p...
Bernhard Fechner
CC
2006
Springer
118views System Software» more  CC 2006»
15 years 8 months ago
Lightweight Lexical Closures for Legitimate Execution Stack Access
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
Masahiro Yasugi, Tasuku Hiraishi, Taiichi Yuasa