Result: Unifying theories of parallel programming

Title:
Unifying theories of parallel programming
Authors:
WOODCOCK, Jim, HUGHES, Arthur
Source:
Formal methods and software engineering (Shanghai, 21-25 October 2002)Lecture notes in computer science. :24-37
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 13 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, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Calcul raffinement, Refinement calculus, Langage formel, Formal language, Lenguaje formal, Langage programmation, Programming language, Lenguaje programación, Méthode séquentielle, Sequential method, Método secuencial, Programmation parallèle, Parallel programming, Programación paralela, Représentation connaissances, Knowledge representation, Representación conocimientos, Sémantique formelle, Formal semantics, Semántica formal, Sémantique opérationnelle, Operational semantics, Semantica operacional, Théorie programmation, Programming theory, Programmation concurrente
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Kent at Canterbury, United Kingdom
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=14539216
Rights:
Copyright 2003 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.14539216
Database:
PASCAL Archive

Further Information

We are developing a shared-variable refinement calculus in the style of the sequential calculi of Back, Morgan, and Morris. As part of this work, we're studying different theories of shared-variable programming. Using the concepts and notations of Hoare & He's unifying theories of programming (UTP), we give a formal semantics to a programming language that contains sequential composition, conditional statements, while loops, nested parallel composition, and shared variables. We first give a UTP semantics to labelled action systems, and then use this to give the semantics of our programs. Labelled action systems have a unique normal form that allows a simple formalisation and validation of different logics for reasoning about shared-variable programs. In this paper, we demonstrate how this is done for Lamport's Concurrent Hoare Logic.