Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHayes, I.en
dc.contributor.authorColvin, D.en
dc.contributor.authorHemer, D.en
dc.contributor.authorStrooper, P.en
dc.contributor.authorNickson, R.en
dc.identifier.citationTheory and Practice of Logic Programming, 2002; 2(4-5):425-460en
dc.description.abstractExisting refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and re nement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.en
dc.description.statementofresponsibilityIan Hayes, Robert Colvin, David Hemer, Paul Strooper And Ray Nicksonen
dc.publisherCambridge University Pressen
dc.rightsCopyright © 2002 Cambridge University Pressen
dc.subjectrefinement calculus; logic programmingen
dc.titleA refinement calculus for logic programsen
dc.typeJournal articleen
dc.provenancePublished online by Cambridge University Press 26 Jul 2002en
pubs.library.collectionComputer Science publicationsen
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
Hayes_33978.pdfPublished version260.62 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.