Proving Correctness and Completeness of Normal Programs - a Declarative Approach

@article{Drabent2001ProvingCA,
  title={Proving Correctness and Completeness of Normal Programs - a Declarative Approach},
  author={Wlodzimierz Drabent and Miroslawa Milkowska},
  journal={TPLP},
  year={2001},
  volume={5},
  pages={669-711}
}
We advocate a declarative approach to proving properties of logic programs. Total cor-rectness can be separated into correctness, completeness and clean termination; the latter includes non-floundering. Only clean termination depends on the operational semantics, in particular on the selection rule. We show how to deal with correctness and completeness in a declarative way, treating programs only from the logical point of view. Specifications used in this approach are interpretations (or… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS