The RPC-Memory Specification Problem: UNITY + Refinement Calculus
Download:
|
|
by Rob T. Udink, Joost N. Kok
http://www.wi.leidenuniv.nl/home/joost/spies.ps.gz
Add To MetaCart
Abstract:
Abstract. We use the ImpUNITY framework to solve the "RPC-Memory Specification problem " of the Dagstuhl Workshop on reactive systems. ImpUNITY supports the development of parallel and distributed programs from specification to implementation in a stepwise manner. It is an extension of UNITY, as introduced by Chandy and Misra, with features of the Action System formalism of Back and Kurki-Suonio. Due to this extension, the ImpUNITY framework is also suitable for the implementation phase of the development process. It supports local variables and (remote) procedure calls and it has a UNITY like temporal logic. 1
Citations
| 175 | Chandy and Jayadev Misra. Parallel Program Design: A Foundation – Mani - 1988 |
| 125 | Decentralization of process nets with centralized control – Back, Kurki-Suonio - 1983 |
| 113 | Refinement calculus, part II: Parallel and reactive programs – Back - 1990 |
| 47 | Eliminating the substitution axiom from UNITY logic – Sanders - 1991 |
| 22 | Action Systems with Synchronous Communication. Programming Concepts, Methods and Calculi – Back, Sere - 1994 |
| 19 | A simple proof of a completeness result for leads-to – Pachl - 1992 |
| 13 | Stepwise refinement of mixed specifications of concurrent programs – Sanders - 1990 |
| 11 | Program Refinement in Unity-like Environments – Udink - 1995 |
| 10 | Program refinement in fair transition systems – Singh - 1993 |
| 8 | Refinement calculus, lattices and higher order logic – Back - 1993 |
| 7 | ImpUNITY: UNITY with procedures and local variables – Udink, Kok - 1995 |
| 6 | Two fully abstract models for UNITY – Udink, Kok - 1993 |
| 5 | Progress for local variables in UNITY – Udink, Herman, et al. - 1994 |
