Abstract
We present a complete solution to the Broy-Lamport specification problem. Our specifications are written in TLA+, a formal language based on TLA. We give the high levels of structured proofs and sketch the lower levels, which will appear in full elsewhere.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Martín Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, May 1991.
Martín Abadi and Leslie Lamport. An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems, 16(5):1543–1571, September 1994.
Martín Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534, May 1995.
Martín Abadi, Leslie Lamport, and Stephan Merz. The Dagstuhl example—a TLA solution. World Wide Web page at http://www.research. digital.com/SRC/dagstuhl/dagstuhl.html. It can also be found by searching the Web for the 26-letter string formed by concatenating uid and lamportdagstuhlspecprob.
Manfred Broy and Leslie Lamport. The RPC-memory specification problem. In this volume. Also available on [4].
Nissim Francez. Fairness. Texts and Monographs in Computer Science. Springer-Verlag, New York, Berlin, Heidelberg, Tokyo, 1986.
Rob Gerth, Ruurd Kuiper, and John Segers. Interface refinement in reactive systems. In W. R. Cleaveland, editor, 3rd International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 77–93, Berlin, Heidelberg, 1992. Springer-Verlag.
Cliff B. Jones. Specification and design of (parallel) programs. In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 321–332, Amsterdam, September 1983. IFIP, North-Holland.
Leslie Lamport. TLA—temporal logic of actions. At URL http://www.research. digital. com/SRC/tla/ on the World Wide Web. It can also be found by searching the Web for the 21-letter string formed by concatenating uid and lamporttlahomepage.
Leslie Lamport. How to write a proof. American Mathematical Monthly, 102(7):600–608, August–September 1993.
Leslie Lamport. Hybrid systems in TLA+. In Robert L. Grossman, Anil Nerode, Anders P. Ravn, and Hans Rischel, editors, Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 77–102, Berlin, Heidelberg, 1993. Springer-Verlag.
Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.
Leslie Lamport. TLA in pictures. IEEE Transactions on Software Engineering, 21(9):768–775, September 1995.
Leslie Lamport and Stephan Merz. Specifying and verifying fault-tolerant systems. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 41–76. Springer-Verlag, September 1994.
A. C. Leisenring. Mathematical Logic and Hilbert's ε-Symbol. Gordon and Breach, New York, 1969.
Carver Mead and Lynn Conway. Introduction to VLSI Systems, chapter 7. Addison-Wesley, Reading, Massachusetts, 1980.
Amir Pnueli. The temporal semantics of concurrent programs. In Gilles Kahn, editor, Semantics of Concurrent Computation, volume 70 of Lecture Notes in Computer Science, pages 1–20. Springer-Verlag, July 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abadi, M., Lamport, L., Merz, S. (1996). A TLA solution to the RPC-memory specification problem. In: Broy, M., Merz, S., Spies, K. (eds) Formal Systems Specification. Lecture Notes in Computer Science, vol 1169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024426
Download citation
DOI: https://doi.org/10.1007/BFb0024426
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61984-0
Online ISBN: 978-3-540-49573-4
eBook Packages: Springer Book Archive