Sciweavers

1114 search results - page 93 / 223
» Validating optimizations of concurrent C C programs
Sort
View
PLDI
2003
ACM
14 years 3 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
ICFP
2002
ACM
14 years 10 months ago
Compiling scheme to JVM bytecode: : a performance study
We have added a Java virtual machine (henceforth JVM) bytecode generator to the optimizing Scheme-to-C compiler Bigloo. We named this new compiler BiglooJVM. We have used this new...
Bernard P. Serpette, Manuel Serrano
FUIN
2006
97views more  FUIN 2006»
13 years 10 months ago
Thread Algebra with Multi-Level Strategies
In a previous paper, we developed an algebraic theory about threads and multi-threading based on the assumption that a deterministic interleaving strategy determines how threads ar...
Jan A. Bergstra, C. A. Middelburg
PLDI
1996
ACM
14 years 2 months ago
Realistic Compilation by Partial Evaluation
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
Michael Sperber, Peter Thiemann
ASPLOS
2004
ACM
14 years 3 months ago
Programming with transactional coherence and consistency (TCC)
Transactional Coherence and Consistency (TCC) offers a way to simplify parallel programming by executing all code within transactions. In TCC systems, transactions serve as the fu...
Lance Hammond, Brian D. Carlstrom, Vicky Wong, Ben...