Mart'in Abadi, Leslie Lamport, and Stephan Merz. A TLA solution to the RPC-Memory specification problem. In Manfred Broy, Stephan Merz, and Katharina Spies, editors, Formal System Specification: The RPC-Memory Specification Case Study, volume 1169 of Lecture Notes in Computer Science, pages 21--66. Springer-Verlag, Berlin, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....(about the environment) Within formal developments there are applications (domains) where one wants (or has) to consider an indefinite number of processes or even processes that are created and deleted dynamically. Apart from well known examples like the RPC memory specification problem [3] analysed and specified by Martin Abadi, Leslie Lamport and Stephan Merz, our main interest in this paper is in modeling dynamic processes in a uniform and generic way. It is obvious that in this context dynamic processes corresponding to domains in Rushby s approach, are a necessary ....

Lamport L. Abadi M. and Merz S. A tla solution to the rpc-memory specification problem. In Katharina Spies, Manfred Broy, and Stephan Merz, editors, Formal Systems Specification: The RPC-Memory Specification Case Study, pages 21--66. SpringerVerlag, December 1996.

....reader is familiar with it. The workshop s main intention was to compare different formalisms by applying them to this example, in order to understand the similarities and differences of the various approaches, as well as their strengths and weaknesses. The problem has been solved completely in [1, 5, 6, 9, 12, 13, 22]. Other papers on this topic are [2, 3, 4, 8, 10, 11, 23] which only solve the untimed part, and [20] which simplifies the problem to a situation with only one sender and one receiver. This paper is the result of a successful attempt to model and verify the RPCMemory problem with the I O automata ....

....however, can do this an arbitrary (but finite ) number of times. The proof for the implementation relation is simplified substantially if one assumes that the memory component can perform an arbitrary number of internal read actions instead of at most one. The solution of Abadi, Lamport Merz [1] uses such a more convenient memory component, and thus implicitly assumes that the two memory components are observationally equivalent. We prove formally that this assumption is correct, which requires a backward simulation proof of about four pages. In the solution of Hooman [9] the correctness ....

M. Abadi, L. Lamport, and S. Merz. A TLA solution to the RPC-Memory specification problem, 1996. This volume.

No context found.

Mart'in Abadi, Leslie Lamport, and Stephan Merz. A TLA solution to the RPC-Memory specification problem. In Manfred Broy, Stephan Merz, and Katharina Spies, editors, Formal System Specification: The RPC-Memory Specification Case Study, volume 1169 of Lecture Notes in Computer Science, pages 21--66. Springer-Verlag, Berlin, 1996.

....when designing multithreaded programs. TLA assumes an underlying formalism for ordinary mathematics . TLA embodies TLA in a formal language that includes first order logic and ZermeloFr ankel set theory along with support for writing large, modular specifications. TLA is described in [ALM96], but with an obsolete syntax; more recent information can be found in [Lam] Any language that satisfies our needs will be too expressive to allow all specifications to be model checked. TLC can handle a subclass of TLA specifications that we believe includes most specifications of actual ....

Martn Abadi, Leslie Lamport, and Stephan Merz. A TLA solution to the RPC-memory specification problem. In Manfred Broy, Stephan Merz, and Katharina Spies, editors, Formal Systems Specification: The RPC-Memory Specification Case Study, volume 1169 of Lecture Notes in Computer Science, pages 21--66, Berlin, 1996. Springer-Verlag.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC