407 search results - page 1 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
POPL
2004
ACM
14 years 5 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...
POPL
2005
ACM
14 years 5 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
SAS
2009
Springer
14 years 5 months ago
2009
Springer
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...