Generalizing Abadi & Lamport's method to solve a problem posed by A. Pnueli
By adding a new technique and a simple proof strategy to Abadi & Lamport's 1988 method  for proving refinement between specifications of distributed programs correct, the inherent limitation of their method, occurring when the abstract level of specification features so-called infinite invisible nondeterminism or internal discontinuity, can be sometimes overcome. This technique is applied to the cruel last step of a three step correctness proof for an algorithm for communication between migrating processes within a finite network due to Kleinman, Moscowitz, Pnueli & Shapiro .
KeywordsSafety Property Visible Property Input Buffer Refinement Mapping Observable Part
Unable to display preview. Download preview PDF.
- 1.M. Abadi and L. Lamport. The existence of refinement mappings. In Proceedings 3rd Annual Symposium on Logic in Computer Science, pages 165–175, Edinburgh, 1988.Google Scholar
- 2.K. Engelhardt and W.-P. de Roever. Generalizing Abadi & Lamport's Method to Solve a Problem Posed by A. Pnueli. Technical report, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, 1993.Google Scholar
- 3.B. Jonsson. Simulations between specifications of distributed systems. In J. C. M. Baeten and J. F. Groote, editors, Proceedings CONCUR '91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, volume 527 of LNCS, pages 346–360. Springer, Aug. 1991.Google Scholar
- 4.A. Kleinmann, Y. Moscowitz, A. Pnueli, and E. Shapiro. Communication with directed logical variables. 48 pages, Oct. 1990.Google Scholar
- 5.A. Kleinmann, Y. Moscowitz, A. Pnueli, and E. Shapiro. Communication with directed logical variables. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 221–232. ACM, Jan. 1991.Google Scholar