Verifying Concurrent Processes Using Temporal Logic (repost)
Verifying Concurrent Processes Using Temporal Logic By B. T. Hailpern
Publisher: Sp..rin..ger 1982 | 208 Pages | ISBN: 3540112057 , 0387112057 | DJVU | 2 MB
Publisher: Sp..rin..ger 1982 | 208 Pages | ISBN: 3540112057 , 0387112057 | DJVU | 2 MB
Concurrent processes can exhibit extremely complicated behavior, and neither informal reasoning nor testing is reliable enough to establish their correctness. In this thesis, we develop a new technique for the verification of parallel programs. The technique is stated in terms of axioms and inference rules, and it is used to prove safety and liveness properties of parallel programs.
Safety properties are assertions that must be satisfied by the system state at all times; they are analogous to partial correctness. Liveness properties refer to events that will occur in the future, such as program termination or the eventual receipt of a message. In addition to the formal proof rules, we present several heuristics to aid in the preparation of correctness proofs.