0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming > Programming languages

Buy Now

Compositionality, Concurrency, and Partial Correctness - Proof Theories for Networks of Processes, and Their Relationship (Paperback, 1989 ed.) Loot Price: R1,607
Discovery Miles 16 070
Compositionality, Concurrency, and Partial Correctness - Proof Theories for Networks of Processes, and Their Relationship...

Compositionality, Concurrency, and Partial Correctness - Proof Theories for Networks of Processes, and Their Relationship (Paperback, 1989 ed.)

Job Zwiers

Series: Lecture Notes in Computer Science, 321

 (sign in to rate)
Loot Price R1,607 Discovery Miles 16 070 | Repayment Terms: R151 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, 321
Release date: February 1989
First published: 1989
Authors: Job Zwiers
Dimensions: 235 x 155 x 15mm (L x W x T)
Format: Paperback
Pages: 276
Edition: 1989 ed.
ISBN-13: 978-3-540-50845-8
Categories: Books > Computing & IT > Computer programming > Software engineering
Books > Computing & IT > Computer programming > Programming languages > General
Promotions
LSN: 3-540-50845-7
Barcode: 9783540508458

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Problem Solving with C++ - Global…
Walter Savitch Paperback R2,551 Discovery Miles 25 510
C++ Programming - Program Design…
D. Malik Paperback R1,751 R1,615 Discovery Miles 16 150
C++ How to Program: Horizon Edition
Harvey Deitel, Paul Deitel Paperback R1,917 Discovery Miles 19 170
Dark Silicon and Future On-chip Systems…
Suyel Namasudra, Hamid Sarbazi-Azad Hardcover R4,186 Discovery Miles 41 860
FORTRAN 90 for Scientists and Engineers
Brian Hahn Paperback R1,440 Discovery Miles 14 400
Java How to Program, Late Objects…
Paul Deitel, Harvey Deitel Paperback R900 R750 Discovery Miles 7 500
Advanced Visual Basic 6 - Power…
Matthew Curland, Gary Clarke Paperback R1,349 Discovery Miles 13 490
CSS and HTML for beginners - A Beginners…
Ethan Hall Hardcover R1,115 R950 Discovery Miles 9 500
Basic Python Commands - Learn the Basic…
Manuel Mcfeely Hardcover R847 R730 Discovery Miles 7 300
CSS For Beginners - The Best CSS Guide…
Ethan Hall Hardcover R971 R833 Discovery Miles 8 330
Coding for Kids in Python - Python…
Bob Mather Hardcover R917 Discovery Miles 9 170
A Day in Code - An illustrated story…
Shari Eskenas Hardcover R610 Discovery Miles 6 100

See more

Partners