Sciweavers

351 search results - page 20 / 71
» Logic Programs with Compiled Preferences
Sort
View
POPL
2010
ACM
14 years 6 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
PADL
2005
Springer
14 years 2 months 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
MICRO
2000
IEEE
133views Hardware» more  MICRO 2000»
14 years 1 months ago
Compiler controlled value prediction using branch predictor based confidence
Value prediction breaks data dependencies in a program thereby creating instruction level parallelism that can increase program performance. Hardware based value prediction techni...
Eric Larson, Todd M. Austin
EATCS
2000
108views more  EATCS 2000»
13 years 8 months ago
The Underlying Logic of Hoare Logic
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
Andreas Blass, Yuri Gurevich
BIRTHDAY
2000
Springer
14 years 29 days ago
Prioritizing Default Logic
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Gerhard Brewka, Thomas Eiter