{"product_id":"concurrency-verification-introduction-to-compositional-and-non-compositional-methods-paperback-9780521169325","title":"Concurrency Verification; Introduction to Compositional and Non-compositional Methods (Paperback) 9780521169325","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eConcurrency Verification\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eIntroduction to Compositional and Non-compositional Methods\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eAn advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eWillem-Paul de Roever (Author), Frank de Boer (Author), Ulrich Hanneman (Author), Jozef Hooman (Author), Yassine Lakhnech (Author), Mannes Poel (Author), Job Zwiers (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521169325, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback, published 26 January 2012\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e800 pages\u003cbr\u003e22.9 x 15.2 x 4 cm, 1.05 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003eReview of the hardback: 'The present textbook is a highly welcome addition to the existing literature on program verification, particularly valuable for the well-arranged, methodically unified framework for a wealth of material.' Zentralblatt für Mathematik und ihre Grenzgebiete Mathematics Abstracts\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. This 2001 book is self-contained, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface\u003cbr\u003e Part I. Introduction and Overview: 1. Introduction\u003cbr\u003e Part II. The Inductive Assertion Method: 2. Floyd's inductive assertion method for transition diagrams\u003cbr\u003e 3. The inductive assertion method for shared-variable concurrency\u003cbr\u003e 4. The inductive assertion method for synchronous message passing\u003cbr\u003e 5. Expressibility and relative completeness\u003cbr\u003e Part III. Compositional Proof Methods: 6. Introduction to compositional reasoning\u003cbr\u003e 7. Compositional proof methods: synchronous message passing\u003cbr\u003e 8. Compositional proof methods: shared-variable concurrency\u003cbr\u003e Part IV. Hoare Logic: 9. A proof system for sequential programs using Hoare triples\u003cbr\u003e 10. A Hoare logic for shared-variable concurrency\u003cbr\u003e 11. A Hoare logic for synchronous message passing\u003cbr\u003e Part V. Layered Design: 12. Transformational design and Hoare logic\u003cbr\u003e Bibliography\u003cbr\u003e Glossary of symbols\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46006748414232,"sku":"9780521169325","price":70.35,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521169325i_a31c6893-5276-4e53-a262-21971385bbb8.jpg?v=1691372901","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/concurrency-verification-introduction-to-compositional-and-non-compositional-methods-paperback-9780521169325","provider":"Freshly Printed Books","version":"1.0","type":"link"}