Sciweavers

151 search results - page 14 / 31
» Tactic-Based Optimized Compilation of Functional Programs
Sort
View
POPL
2009
ACM
14 years 8 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, an...
Peter A. Jonsson, Johan Nordlander
LCTRTS
2000
Springer
13 years 11 months ago
Automatic Validation of Code-Improving Transformations
This paper presents a general approach to automatically validate code-improving transformations on low-level program representations. The approach ensures the correctness of compi...
Robert van Engelen, David B. Whalley, Xin Yuan
APLAS
2004
ACM
14 years 28 days ago
A MATLAB-Based Code Generator for Sparse Matrix Computations
Abstract. We present a matrix language compiler CMC which translates annotated MATLAB scripts into Fortran 90 programs. Distinguishing features of CMC include its applicability to ...
Hideyuki Kawabata, Mutsumi Suzuki, Toshiaki Kitamu...
PLDI
2012
ACM
11 years 10 months ago
Parcae: a system for flexible parallel execution
Workload, platform, and available resources constitute a parallel program’s execution environment. Most parallelization efforts statically target an anticipated range of environ...
Arun Raman, Ayal Zaks, Jae W. Lee, David I. August
ACNS
2009
Springer
123views Cryptology» more  ACNS 2009»
14 years 2 months ago
Practical Secure Evaluation of Semi-private Functions
Abstract. Two-party Secure Function Evaluation (SFE) is a very useful cryptographic tool which allows two parties to evaluate a function known to both parties on their private (sec...
Annika Paus, Ahmad-Reza Sadeghi, Thomas Schneider