Article contents
A simple correctness proof for magic transformation
Published online by Cambridge University Press: 04 March 2011
Abstract
The paper presents a simple and concise proof of correctness of the magic transformation. We believe that 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.
Keywords
- Type
- Regular Papers
- Information
- Copyright
- Copyright © Cambridge University Press 2011
References
- 1
- Cited by