Treffer: A tutorial introduction to designs in Unifying Theories of Programming
Title:
A tutorial introduction to designs in Unifying Theories of Programming
Authors:
Source:
IFM 2004 : integrated formal methods (Canterbury, 4-7 April 2004)Lecture notes in computer science. :40-66
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Génie logiciel, Software engineering, Algèbre relationnelle, Relational algebra, Algebra relacional, Calcul raffinement, Refinement calculus, Contrat, Contract, Contrato, Didacticiel, Educational software program, Programa didactico, Développement logiciel, Software development, Desarrollo logicial, Méthode formelle, Formal method, Método formal, Paradigme, Paradigm, Paradigma, Programmation logique, Logical programming, Programación lógica, Sémantique dénotationnelle, Denotational semantics, Semántica denotacional, Théorie programmation, Programming theory, Logique Hoare, Hoare logic, Lógica Hoare
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Kent, Computing Laboratory, Canterbury, United Kingdom
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15758166
Database:
PASCAL Archive
Weitere Informationen
In their Unifying Theories of Programming (UTP), Hoare & He use the alphabetised relational calculus to give denotational semantics to a wide variety of constructs taken from different programming paradigms. A key concept in their programme is the design: the familiar precondition-postcondition pair that describes the contract between a programmer and a client. We give a tutorial introduction to the theory of alphabetised relations, and its sub-theory of designs. We illustrate the ideas by applying them to theories of imperative programming, including Hoare logic, weakest preconditions, and the refinement calculus.