66 search results - page 6 / 14 » Development of Correct Transformation Schemata for Prolog Pr... |
152
Voted
PLDI
2003
ACM
15 years 9 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
185
click to vote
TSE
2011
14 years 10 months ago
2011
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)...
118
Voted
SNPD
2003
15 years 5 months ago
2003
This paper introduces accumulation into list homomorphisms for systematic development of both efficient and correct parallel programs. New parallelizable recursive pattern called...
129
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
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...
138
Voted
GI
2004
Springer
15 years 9 months ago
2004
Springer
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...