A 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.
Ideal for readers of formal methods, parallel computing, and verification techniques.
"synopsis" may belong to another edition of this title.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780484720557
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780484720557
Quantity: 15 available