Sciweavers

1145 search results - page 3 / 229
» The Correctness of an Optimized Code Generation
Sort
View
SIAMDM
2010
137views more  SIAMDM 2010»
13 years 5 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
TIT
2008
110views more  TIT 2008»
13 years 7 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
PADL
2005
Springer
14 years 29 days ago
Towards Provably Correct Code Generation via Horn Logical Continuation Semantics
Abstract. Provably correct compilation is an important aspect in development of high assurance software systems. In this paper we explore approaches to provably correct code genera...
Qian Wang, Gopal Gupta, Michael Leuschel
ICCL
1992
IEEE
13 years 11 months ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg
ENTCS
2002
166views more  ENTCS 2002»
13 years 7 months ago
Translation and Run-Time Validation of Optimized Code
The paper presents approaches to the validation of optimizing compilers. The emphasis is on aggressive and architecture-targeted optimizations which try to obtain the highest perf...
Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Gol...