Automatic Correctness Proofs for Logic Program Transformations
From MaRDI portal
Publication:3608667
DOI10.1007/978-3-540-74610-2_25zbMATH Open1213.68207OpenAlexW1944291887MaRDI QIDQ3608667FDOQ3608667
Authors: Alberto Pettorossi, Maurizio Proietti, Valerio Senni
Publication date: 5 March 2009
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2108/40167
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
Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cited In (14)
- Correctness of program transformations as a termination problem
- Title not available (Why is that?)
- Transformational methodology for proving termination of logic programs
- Proving theorems by program transformation
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Proving the correctness of recursion-based automatic program transformations
- 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)