A survey of verification techniques for parallel programs
type: Item
instance of: scholarly article
title: A survey of verification techniques for parallel programs
zbMATH Open document ID: 0566.68002
author: Howard Barringer
published in: Lecture Notes in Computer Science
publication date: 1985-01-01T00:00:00Z
review text: This report is an attempt at trying to document some of the many verification methods for parallel and distributed software. Preliminary aims were that the report should highlight common ideas, principles and implications of current verification and specification techniques. Neither this report is meant to be an all embracing survey report. Some of the main approaches in this area are reviewed and studied in grater depth. The following scheme is used for the presentation of each method: Major references, Overview, Examples, Detailed exposition of some examples, General comments and a summary of the proof system. There are two main sections to the report: Shared variable parallelism and Message- based parallelism. In detail the following methods are surveyed: Flon \& Suzuki: Total Correctness of Parallel Programs; Jones: Development of Interfering Programs; Lamport: Verification of Concurrent Programs; Owicki \& Gries: Verification of Parallel Programs; Apt, Francez \& De Roever: Verification of CSP; Barringer \& Mearns: Verification of Ada Tasks; Levin \& Gries: Verification of CSP; Misra \& Chandy: Proofs of Process Networks; Zhou \& Hoare: Correctness of Communicating Processes.
reviewed by: Horst Zeitler
Mathematics Subject Classification ID: 68-02
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3903928
zbMATH Keywords: verification methods for parallel and distributed software
zbMATH Keywords: specification
zbMATH Keywords: parallelism
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3903928