Skip to main content
SpringerLink
Log in

The RPC-memory specification problem: UNITY + refinement calculus

  • Conference paper
  • First Online:
Formal Systems Specification

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1169))

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.

The work of Rob Udink was carried out at the Department of Computer Science, Utrecht University. It has been supported by the Foundation for Computer Science in the Netherlands SION under project 612-317-107. Rob Udink is currently working at Philips Research Laboratories, Eindhoven.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.J.R. Back. Refinement calculus, part II: Parallel and reactive programs. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 42–66. Springer-Verlag, 1990.

    Google Scholar 

  2. R. J.R. Back. Refinement calculus, lattices and higher order logic. In M. Broy, editor, Program Design Calculi, volume 118 of Nato ASI Series, Series F, pages 53–72. Springer-Verlag, 1993.

    Google Scholar 

  3. R.-J.R. Back and R. Kurki-Suonio. Decentralization of process nets with centralized control. In 2nd ACM SIGACT-SIGOPS Symp. on Distributed Computing, pages 131–142. ACM, 1983.

    Google Scholar 

  4. R.J.R. Back and K. Sere. Action systems with synchronous communication. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, volume A-56 of IFIP Transactions, pages 107–126. IFIP, Elsevier Science Publishers B.V. (North Holland), June 1994.

    Google Scholar 

  5. K. Mani Chandy and Jayadev Misra. Parallel Program Design — A Foundation. Addison-Wesley Publishing Company, Inc., 1988.

    Google Scholar 

  6. Jan Pachl. A simple proof of a completeness result for leads-to in the UNITY logic. Information Processing Letters, 41:35–38, 1992.

    Article  MathSciNet  Google Scholar 

  7. Beverly A. Sanders. Stepwise refinement of mixed specifications of concurrent programs. In M. Broy and Jones C.B., editors, Proceedings of the IFIP Working Conference on Programming and Methods, pages 1–25. Elsevier Science Publishers B.V. (North Holland), May 1990.

    Google Scholar 

  8. Beverly A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2):189–205, 1991.

    Article  Google Scholar 

  9. Ambuj K. Singh. Program refinement in fair transition systems. Acta Informatica, 30(6):503–535, 1993.

    Article  MathSciNet  Google Scholar 

  10. Rob Udink. Program Refinement in UNITY-like Environments. PhD thesis, Utrecht University, September 1995.

    Google Scholar 

  11. R.T. Udink, T. Herman, and J.N. Kok. Progress for local variables in UNITY. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, volume A-56 of IFIP Transactions, pages 127–146. IFIP, Elseviers Science Publishers B.V. (North Holland), June 1994.

    Google Scholar 

  12. R.T. Udink and J.N. Kok. Two fully abstract models for UNITY. In Eike Best, editor, CONCUR'93, Proceedings of the 4th International Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 339–352. Springer-Verlag, August 1993.

    Google Scholar 

  13. R.T. Udink and J.N. Kok. ImpUNITY: UNITY with procedures and local variables. In Bernhard Möller, editor, Mathematics of Program Construction, volume 947 of Lecture Notes in Computer Science, pages 452–472. Springer-Verlag, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Rob T. Udink & Joost N. Kok

Authors
  1. Rob T. Udink
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joost N. Kok
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Broy Stephan Merz Katharina Spies

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Udink, R.T., Kok, J.N. (1996). The RPC-memory specification problem: UNITY + refinement calculus. 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/BFb0024440

Download citation

  • DOI: https://doi.org/10.1007/BFb0024440

  • 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

Publish with us

Policies and ethics

Search

Navigation