Sciweavers

66 search results - page 6 / 14
» Development of Correct Transformation Schemata for Prolog Pr...
Sort
View
PLDI
2003
ACM
14 years 27 days ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
TSE
2011
107views more  TSE 2011»
13 years 2 months ago
Deriving a Slicing Algorithm via FermaT Transformations
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...
Martin P. Ward, Hussein Zedan
SNPD
2003
13 years 9 months ago
List Homomorphism with Accumulation
This paper introduces accumulation into list homomorphisms for systematic development of both efficient and correct parallel programs. New parallelizable recursive pattern called...
Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi
SAC
2003
ACM
14 years 27 days ago
Validation of Code-Improving Transformations for Embedded Systems
Programmers of embedded systems often develop software in assembly code due to inadequate support from compilers and the need to meet critical speed and/or space constraints. Many...
Robert van Engelen, David B. Whalley, Xin Yuan
GI
2004
Springer
14 years 1 months ago
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
Jan Olaf Blech, Sabine Glesner