Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Krzysztof R. Apt; Frank S. de Boer; Ernst-Rüdiger Olderog

ISBN 10: 184882744X / ISBN 13: 9781848827448

Edité par Springer, 2009

A propos de cet article

Hardcover, 3rd edition, xxiii + 502 pages, NOT ex-library. Shipping weight over 1kg. Signs of mild wear, book is clean and bright with unmarked text, free of inscriptions and stamps, firmly bound. Issued without a dust jacket. -- An in-depth exploration of the methodologies and techniques used for verifying the correctness of both sequential and concurrent programs. This comprehensive text delves into the theoretical foundations and practical applications of program verification. The book covers a range of topics, including formal methods, algorithmic analysis, and model checking, making it an essential resource for computer scientists, researchers, and students interested in ensuring software reliability and performance. With its detailed explanations and illustrative examples, the book equips readers with the knowledge needed to address complex verification challenges in modern computing systems.

N° de réf. du vendeur 007578

Détails bibliographiques

• Titre: Verification of Sequential and Concurrent Programs (Texts in Computer Science)
• Éditeur: Springer
• Date de parution: 2009
• Langue: anglais
• ISBN à 10 chiffres: 184882744X
• ISBN à 13 chiffres: 9781848827448
• Reliure: Hardcover
• Édition: 3rd Edition
• État de l'article: Near Fine

A propos de ce titre

Synopsis

HIS BOOK CONTAINS a most comprehensive text that presents syntax-directed and compositional methods for the formal veri?- T cation of programs. The approach is not language-bounded in the sense that it covers a large variety of programming models and features that appear in most modern programming languages. It covers the classes of - quential and parallel, deterministic and non-deterministic, distributed and object-oriented programs. For each of the classes it presents the various c- teria of correctness that are relevant for these classes, such as interference freedom, deadlock freedom, and appropriate notions of liveness for parallel programs. Also, special proof rules appropriate for each class of programs are presented. In spite of this diversity due to the rich program classes cons- ered, there exist a uniform underlying theory of veri?cation which is synt- oriented and promotes compositional approaches to veri?cation, leading to scalability of the methods. The text strikes the proper balance between mathematical rigor and - dactic introduction of increasingly complex rules in an incremental manner, adequately supported by state-of-the-art examples. As a result it can serve as a textbook for a variety of courses on di?erent levels and varying durations. It can also serve as a reference book for researchers in the theory of veri?- tion, in particular since it contains much material that never before appeared in book form. This is specially true for the treatment of object-oriented p- grams which is entirely novel and is strikingly elegant.