Excerpt from Verification of Several Parallel, Vol. 36: Coordination Programs Based on Descriptions of Their Reachability Sets
In 3 a similar approach was applied to analyse a parallel program, however the reachability set was developed only for 2 pes.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Excerpt from Verification of Several Parallel, Vol. 36: Coordination Programs Based on Descriptions of Their Reachability Sets
In 3 a similar approach was applied to analyse a parallel program, however the reachability set was developed only for 2 pes.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
Excerpt from Verification of Several Parallel, Vol. 36: Coordination Programs Based on Descriptions of Their Reachability Sets
Abstract - A method for verifying parallel programs is applied to several examples (PV-semaphore, "busy-wait" synchronization, "cessation of activity" synchronization, "readers-writers" ). The graph of all program states and state transitions is represented in a special compact form independent of the number N of processing elements. This representation aids in verifying certain correctness properties that can not be easily expressed in the form "predicate(state)". In each of the above mentioned examples a special "reachability tree" is developed whose nodes are some subsets of the set of all reachable states. The root is the initial state and moving down the tree corresponds to some processors advancing their execution. In the presented examples the size of this tree is independent of N. The notion of compact program is introduced: roughly speaking a parallel program is compact if there exists a boundary, independent of N, on time required to reach any state. Examples of non-compact programs are represented.
Index Terms- correctness proof, program verification, concurrent processes, synchronization, semaphore, liveness property, mutual exclusion, deadlock.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Sus derechos de garantía legal: Todos los consumidores de la UE se benefician de al menos dos años de protección de garantía legal para cualquier bien de consumo que se venda en la UE. Ver más
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: New. No Jacket. Print on Demand. Hook lineA practical guide to verifying parallel programs using reachability sets and graph analysis. It explains how to detect race conditions and design robust synchronization.The work presents a formal approach to abstract programs that model many processing elements (PEs). Readers learn how to describe program states with graphs, counters, and replacing functions, then use these models to verify correctness properties.With clear steps and concrete examples, the book shows how to convert code behavior into a verification problem, including techniques to handle indivisibility and to identify critical conditions that lead to bugs in parallel systems. Model abstract programs as graphs with positions, counters, and directing rules. Apply procedures to generate reachability sets and detect race conditions. Understand how to reason about synchronization and liveness in parallel environments. Explore how formal methods can aid automatic verification for arbitrary numbers of processing elements.Ideal for readers of formal methods, parallel computing, and verification techniques. 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 ref. del artículo: 9781332209255_0
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332209255
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332209255
Cantidad disponible: 15 disponibles