Synthesis and transformation of logic programs using unfold/fold proofs
From MaRDI portal
Publication:4939537
DOI10.1016/S0743-1066(99)00029-1zbMath0944.68024WikidataQ127087544 ScholiaQ127087544MaRDI QIDQ4939537
Alberto Pettorossi, Maurizio Proietti
Publication date: 6 February 2000
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (9)
Synthesis of positive logic programs for checking a class of definitions with infinite quantification ⋮ Horn Clause Solvers for Program Verification ⋮ Constraint-based correctness proofs for logic program transformations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Assertion based Inductive Verification Methods for Logic Programs ⋮ Logic programs as specifications in the inductive verification of logic programs ⋮ Totally correct logic program transformations via well-founded annotations ⋮ Program development schemata as derived rules
This page was built for publication: Synthesis and transformation of logic programs using unfold/fold proofs
