y
Download:
|
|
by Zohar Manna, Amir Pnueli
ftp://ftp.wisdom.weizmann.ac.il/pub/amir/tools.ps.gz
Add To MetaCart
Abstract:
The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules by analyzing and verifying the properties of a new algorithm for mutual exclusion. 1
Citations
| 300 | Defining liveness – Alpern, Schneider - 1985 |
| 228 | Proving the correctness of multiprocess programs – Lamport - 1977 |
| 138 | Parallel program design – Chandy, Misra - 1988 |
| 72 | Completing the temporal picture – Manna, Pnueli - 1991 |
| 47 | Verification of multiprocess probabilistic protocols – Pnueli, Zuck - 1986 |
| 26 | Adequate proof principles for invariance and liveness properties of concurrent programs – Manna, Pnueli - 1984 |
| 16 | The Anchored Version of the Temporal Framework, Linear Time, Branching Time and – Manna, Pnueli - 1989 |
| 12 | A simple solution to Lamport’s concurrent programming problem with linear wait – Szymanski - 1988 |
| 8 | An Exercise in the Verification of Multi -- Process Programs – Manna, Pnueli - 1990 |
| 5 | Proving precedence properties: the temporal way – Manna, Pnueli - 1983 |
