105 search results - page 7 / 21 » Proving optimizations correct using parameterized program eq... |
190
click to vote
POPL
2006
ACM
15 years 12 months ago
2006
ACM
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
103
click to vote
TLDI
2009
ACM
15 years 8 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
125
click to vote
MP
2002
14 years 11 months ago
2002
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
ACTA
2007
14 years 11 months ago
2007
We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular ...
113
click to vote
PPDP
2005
Springer
15 years 5 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....