Contact
How to shop
Delivery
Shopping guide
Compositionality, Concurrency, and Partial Correctness
Proof Theories for Networks of Processes, and Their Relationship
English
125 b
Up to 30 days for returns
Customers also purchased
/
Paperback
48.67
€
/
Paperback
13.77
€
/
Paperback
16.99
€
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
29.57
€
/
Hardback
51.38
€
/
Paperback
14.67
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?