Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship - Lecture Notes in Computer Science - Zwiers, Job (University of Twente, Enschede, the Netherlands) - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540508458 - February 22, 1989
In case cover and title do not match, the title is correct

Zwiers, Job (University of Twente, Enschede, the Netherlands)
Compositionality, Concurrency, and Partial Correctness: Proof Theories for Networks of Processes, and Their Relationship - Lecture Notes in Computer Science 1989 edition

Price
$ 54.49
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jul 13 - 17

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

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.

276 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released February 22, 1989
ISBN13 9783540508458
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 276
Dimensions 156 × 234 × 15 mm   ·   399 g
Language English  

Mere med samme udgiver

See all of Zwiers, Job (University of Twente, Enschede, the Netherlands) ( e.g. Paperback Book )