Skip to main content
SpringerLink
Log in

Compositionality, Concurrency, and Partial Correctness

Proof Theories for Networks of Processes, and Their Relationship

  • Book
  • © 1989

Overview

Authors:
  1. Job Zwiers
    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 321)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-39

  3. The languages DNP and TNP

    Pages 41-54

  4. The semantics for TNP

    Pages 55-98

  5. Correctness formulae

    Pages 99-146

  6. Proof systems for TNP

    Pages 147-195

  7. Completeness

    Pages 197-225

  8. The Hoare and Invariant systems

    Pages 227-265

  9. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs. The impact of this principle of program decomposition on the specification and verification of parallel executed programs is the subject of this monograph. Two important yardsticks for verification methods, those of compositionality and modularity, are made precise. The problem of reusing software is addressed by the introduction of the notion of specification adaptation. Within this context, different methods for specifying the observable behavior with respect to partial correctness of communicating processes are considered, and in particular the contrast between the "programs are predicates" and the "programs are predicate transformers" paradigms is shown. The associated formal proof systems are proven sound and complete in various senses with respect to the denotational semantics of the programming language, and they are related to each other to give an in-depth comparison between the different styles of program verification. The programming language TNP used here is near to actual languages like Occam. It combines CCS/CSP style communication based programming with state based programming, and allows dynamically expanding and shrinking networks of processes.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation