Save 40% on select Business & Management books + FREE shipping or 50% on Physics eBooks!

Lecture Notes in Computer Science
cover

Compositionality, Concurrency, and Partial Correctness

Proof Theories for Networks of Processes, and Their Relationship

Authors: Zwiers, Job

Buy this book

eBook $74.99
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-46101-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-50845-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
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.

Table of contents (7 chapters)

Table of contents (7 chapters)
  • Introduction

    Pages 1-39

  • The languages DNP and TNP

    Pages 41-54

  • The semantics for TNP

    Pages 55-98

  • Correctness formulae

    Pages 99-146

  • Proof systems for TNP

    Pages 147-195

Buy this book

eBook $74.99
price for USA in USD (gross)
  • The eBook version of this title will be available soon
  • ISBN 978-3-540-46101-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA in USD
  • ISBN 978-3-540-50845-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Compositionality, Concurrency, and Partial Correctness
Book Subtitle
Proof Theories for Networks of Processes, and Their Relationship
Authors
Series Title
Lecture Notes in Computer Science
Series Volume
321
Copyright
1989
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-46101-2
DOI
10.1007/BFb0020836
Softcover ISBN
978-3-540-50845-8
Series ISSN
0302-9743
Edition Number
1
Number of Pages
VIII, 276
Topics