Sciweavers

32 search results - page 6 / 7
» Proof Obligations Preserving Compilation
Sort
View
ENTCS
2007
100views more  ENTCS 2007»
13 years 8 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
ENTCS
2002
166views more  ENTCS 2002»
13 years 8 months ago
Translation and Run-Time Validation of Optimized Code
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Gol...
PLDI
2003
ACM
14 years 1 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
POPL
2001
ACM
14 years 8 months ago
Type-preserving garbage collectors
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
Daniel C. Wang, Andrew W. Appel
AOSD
2007
ACM
14 years 17 days ago
A flexible architecture for pointcut-advice language implementations
Current implementations for aspect-oriented programming languages map the aspect-oriented concepts of source programs to object-oriented bytecode. This hinders execution environme...
Christoph Bockisch, Mira Mezini