105 search results - page 5 / 21 » Proving optimizations correct using parameterized program eq... |
178
click to vote
POPL
2004
ACM
15 years 9 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
92
Voted
FM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
95
Voted
APLAS
2006
ACM
15 years 3 months ago
2006
ACM
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
172
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...