Proving correctness and completeness of normal programs – a declarative approach

We advocate a declarative approach to proving properties of logic programs. Total correctness 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....

Full description

Bibliographic Details

Published in:	Theory and practice of logic programming Vol. 5; no. 6; pp. 669 - 711
Main Authors:	DRABENT, WŁODZIMIERZ, MIŁKOWSKA, MIROSŁAWA
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.11.2005
Subjects:	Declarative programming Negation in logic programming Program correctness and completeness Regular Papers Specifications Teaching logic programming TECHNOLOGY TEKNIKVETENSKAP Termination termination declarative programming negation in logic programming teaching logic programming specifications program correctness and completeness
ISSN:	1471-0684, 1475-3081, 1475-3081
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!