Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

On the UNITY design decisions

  • Conference paper
  • First Online:
Reasearch Directions in High-Level Parallel Programming Languages (HLPPP 1991)

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

  • 138 Accesses

Abstract

UNITY, a surprisingly simple programming method for parallel programs comprising a program notation, specification language, and proof theory was described by Chandy and Misra [CM88] in their book, which appeared in 1988. Since then it has been applied to a wide variety of problems and has been generalized in several different ways. Further, a fair amount of research on the theoretical foundations has been carried out.

In this paper, we examine some of the original design decisions in light of these experiences and gain insight into the consequences of particular choices and an understanding of some of the ways the theory can be generalized without losing its desirable characteristics.

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.

Similar content being viewed by others

References

  1. K. Birman and T. Joseph. Reliable communication in the presence of failures. ACM Transactions on Computer Systems, 5(1):47–76, February 1987.

    Google Scholar 

  2. K. Mani Chandy and Jayadev Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  3. H. C. Cunningham and G.-C. Roman. A UNITY-style programming logic for shared data-space programs. IEEE Transactions on Parallel and Distributed Systems, 1(3):365–376, July 1990.

    Google Scholar 

  4. Edsger W. Dijkstra and Carel S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, 1990.

    Google Scholar 

  5. R. Gerth and Amir Pnueli. Rooting UNITY. In Proceedings of 5th International Workshop on Software Specification and Design, Pittsburgh, 1989.

    Google Scholar 

  6. Joseph H. Halpern and Ronald Fagin. Modelling knowledge and action in distributed systems. Distributed Computing, 3:159–177, 1989.

    Google Scholar 

  7. Joseph Y. Halpern and Yoram Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549–587, July 1990.

    Google Scholar 

  8. Leslie Lamport and Fred Schneider. Formal foundation for specification and verification. In M. Paul and H. J. Siegert, editors, Distributed Systems: Methods and Tools for Specification, pages 203–286. Springer-Verlag, 1985. Lecture Notes in Computer Science 190.

    Google Scholar 

  9. Simon S. Lam and A. Udaya Shankar. A relational notation for state-transition systems. IEEE Transactions on Software Enginnering, 16(7):755–775, July 1990.

    Google Scholar 

  10. Jayadev Misra. Auxiliary variables. Notes on UNITY: 15–90, 1990.

    Google Scholar 

  11. Jayadev Misra. Soundness of the substitution axiom. Notes on UNITY: 14–90, 1990.

    Google Scholar 

  12. Susan Owicki and David Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(1):319–340, 1976.

    Article  Google Scholar 

  13. Jan Pachl. Three definitions of leads-to for UNITY. Notes on UNITY: 23–90, 1990.

    Google Scholar 

  14. Josyula R. Rao. On a notion of completeness for the leads-to. Notes on UNITY 24–90, 1991.

    Google Scholar 

  15. Josyula R. Rao. Reasoning about probabilistic algorithms. In Proceedings of 9th ACM Symposium on Principles of Distributed Computing, 1991.

    Google Scholar 

  16. G.-C. Roman and H. C. Cunningham. Mixed programming metaphors in a shared data-space model of concurrency. IEEE Transactions on Software Engineering, 16(12):1361–1373, December 1990.

    Google Scholar 

  17. Beverly Sanders. Stepwise refinement of mixed specifications of concurrent programs. In M. Broy and C.B. Jones, editors, Proceedings of the IFIP Working Conference on Programming Concepts and Methods, Israel, 1990. Elsiever Science Publishers.

    Google Scholar 

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

    Google Scholar 

  19. Beverly Sanders. A predicate transformer approach to knowledge and knowledge-based protocols. In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, Montreal, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Computersysteme, Swiss Federal Institute of Technology (ETH Zürich) ETH Zentrum, CH-8092, Zürich, Switzerland

    Beverly Sanders

Authors
  1. Beverly Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean Pierre Banâtre Daniel Le Métayer

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sanders, B. (1992). On the UNITY design decisions. In: Banâtre, J., Le Métayer, D. (eds) Reasearch Directions in High-Level Parallel Programming Languages. HLPPP 1991. Lecture Notes in Computer Science, vol 574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55160-3_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-55160-3_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55160-7

  • Online ISBN: 978-3-540-46762-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation