论文信息 - A TLA Solution to the RPC-Memory Specification Problem

A TLA Solution to the RPC-Memory Specification Problem

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.

[1] A. Pnueli. The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[2] Manfred Broy,et al. The RPC-Memory Specification Problem - Problem Statement , 1994, Formal Systems Specification.

[3] Lynn Conway,et al. Introduction to VLSI systems , 1978 .

[4] Leslie Lamport,et al. TLA in Pictures , 1995, IEEE Trans. Software Eng..

[5] F. Grund,et al. Wirth, N., Programming in Modula-2. Berlin etc., Springer-Verlag 1985. 3rd corr. ed., IV, 202 pp., 4 figs., DM 49,50. ISBN 3-540-15078-1 (Texts and Monographs in Computer Science) , 1988 .

[6] Stephan Merz,et al. Specifying and Verifying Fault-Tolerant Systems , 1994, FTRTFT.

[7] Ruurd Kuiper,et al. Interface Refinement in Reactive Systems (Extended Abstract) , 1992, CONCUR.

[8] Cliff B. Jones,et al. Specification and Design of (Parallel) Programs , 1983, IFIP Congress.

[9] Leslie Lamport,et al. Hybrid Systems in TLA+ , 1992, Hybrid Systems.

[10] Martín Abadi,et al. An old-fashioned recipe for real time , 1994, TOPL.

[11] Leslie Lamport,et al. The temporal logic of actions , 1994, TOPL.

[12] Martín Abadi,et al. Conjoining specifications , 1995, TOPL.

[13] Martín Abadi,et al. The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[14] A. Leisenring. Mathematical logic and Hilbert's ε-symbol , 1971 .

[15] Leslie Lamport,et al. How to Write a Proof , 1995 .