Automatic Correctness Proofs for Logic Program Transformations
From MaRDI portal
Publication:3608667
Recommendations
- Constraint-based correctness proofs for logic program transformations
- Proving theorems by program transformation
- Totally correct logic program transformations via well-founded annotations
- scientific article; zbMATH DE number 3924119
- Synthesis and transformation of logic programs using unfold/fold proofs
Cited in
(14)- Proving the correctness of recursion-based automatic program transformations
- Correctness of program transformations as a termination problem
- scientific article; zbMATH DE number 1538039 (Why is no real title available?)
- Transformational methodology for proving termination of logic programs
- Proving theorems by program transformation
- scientific article; zbMATH DE number 3924119 (Why is no real title available?)
- On inductive proofs by extended unfold/fold transformation rules
- Constraint-based correctness proofs for logic program transformations
- Kima: An automated error correction system for concurrent logic programs
- A simple correctness proof for magic transformation
- Totally correct logic program transformations via well-founded annotations
- Proving the correctness of unfold/fold program transformations using bisimulation
- scientific article; zbMATH DE number 1615257 (Why is no real title available?)
- Proving the correctness of recursion-based automatic program transformations
This page was built for publication: Automatic Correctness Proofs for Logic Program Transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608667)