Sciweavers

82 search results - page 5 / 17
» On the Correctness of Transformations in Compiler Back-Ends
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 7 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
EUROPAR
2004
Springer
14 years 27 days ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
CASES
2001
ACM
13 years 11 months ago
A new method for compiling schizophrenic synchronous programs
Synchronous programming languages have proved to be advantageous for designing software and hardware for embedded systems. Despite their clear semantics, their compilation is rema...
K. Schneider, M. Wenz
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
LCPC
2009
Springer
14 years 2 days ago
Loop Transformation Recipes for Code Generation and Auto-Tuning
Abstract. In this paper, we describe transformation recipes, which provide a high-level interface to the code transformation and code generation capability of a compiler. These rec...
Mary W. Hall, Jacqueline Chame, Chun Chen, Jaewook...