Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CORR
2010
Springer

favoriteEmaildiscussreport

96views Education» more CORR 2010»

A Simple Correctness Proof for Magic Transformation

13 years 1 months ago

A Simple Correctness Proof for Magic Transformation

Download www.ipipan.waw.pl

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 correctness property concerns the declarative semantics. The proof, however, refers to the operational semantics (LD-resolution) of the source programs. Its conciseness is due to applying a suitable proof method.

Wlodzimierz Drabent

Real-time Traffic

Concise Proof | CORR 2010 | Correctness | Education | Suitable Proof Method |

claim paper

Related Content

» Magic Sets vs SLDResolution

» Simple relational correctness proofs for static analyses and program transformations

» The Correctness of the Fast Fourier Transform A Structured Proof in ACL2

» Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2

» A Case Study on Proving Transformations Correct DataParallel Conversion

» Mechanized semantics

» A Formal Correctness Proof for Code Generation from SSA Form in IsabelleHOL

» Proof Theory Transformations and Logic Programming for Debugging Security Protocols

» Total Correctness by Local Improvement in Program Transformation

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Wlodzimierz Drabent

Comments (0)