The digital edition of all books may be viewed on our website before purchase. Excerpt from An Approach to Automating the Verification of Compact Parallel Coordination Programs
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books.
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. This text has been digitally restored from a historical edition. Some errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vos droits au titre de la garantie légale : Chaque consommateur de l'UE bénéficie d'au moins deux ans de protection au titre de la garantie légale pour tout bien de consommation vendu dans l'UE. Voir plus
Vendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. No Jacket. Print on Demand. A practical guide to proving correctness in parallel programs with automated verification.This book presents a concrete approach to verifying compact parallel coordination programs. It introduces how auxiliary state, like counters and control variables, can be used to analyze dynamic behavior and prove properties for arbitrary numbers of processing elements. Through worked examples, the text shows how verification tools describe reachability and correctness for complex parallel systems.- Learn how to model parallel programs with state spaces and metastates- See how reachability descriptions and invariant assertions support proofs- Explore real examples like readers-writers and semaphore-like synchronization- Understand how automated verifiers generate compact proofs that hold for any number of processorsIdeal for readers of formal methods, concurrency theory, and practical verification of parallel software. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. N° de réf. du vendeur 9781528015882_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LX-9781528015882
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LX-9781528015882
Quantité disponible : 15 disponible(s)