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....

Celý popis

Podrobná bibliografie

Vydáno v:	Theory and practice of logic programming Ročník 5; číslo 6; s. 669 - 711
Hlavní autoři:	DRABENT, WŁODZIMIERZ, MIŁKOWSKA, MIROSŁAWA
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cambridge, UK Cambridge University Press 01.11.2005
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!