skip to main content
10.1145/355045.355049acmconferencesArticle/Chapter ViewAbstractPublication PagesfseConference Proceedingsconference-collections
Article
Free Access

The universe model: an approach for improving the modularity and reliability of concurrent programs

Authors Info & Claims
Published:01 November 2000Publication History

ABSTRACT

We present the universe model, a new approach to concurrency management that isolates concurrency concerns and represents them in the modular interface of a component. This approach improves program comprehension, module composition, and reliability for concurrent systems. The model is founded on designer-specified invariant properties, which declare a component's dependencies on other concurrent components. Process scheduling is then automatically derived from these invariants. We illustrate the advantages of this approach by applying it to a real-world example.

References

  1. 1.E Arbab and G. A. Papadopoulos. Coordination Models and Languages. In The Engineering of Large Systems. Advances in Computers. Academic Press, 1998.Google ScholarGoogle Scholar
  2. 2.R. Behrends and R. E. K. Stirewalt. A High-Level Approach to Concurrency. Tech. Rep. MSU-CSE-00-6 (March 2000), Department of Computer Science and Engineering, Michigan State University.Google ScholarGoogle Scholar
  3. 3.M. Ben-Aft. Principles of Concurrent and Distributed Programming. Prentice Hall, New York, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.T. Bolognesi and E. Brinksma. Introduction to the ISO Specification Language Lotos. Comp. Netw. ISDN Sys. 14 (1) (1987). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.E Brinch Hansen. Java's Insecure Parallelism. ACM SIGPLAN Notices 34 (4), 38-45 (1999). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.N. Carriero and D. Gelernter. Coordination languages and their significance. Communications of the ACM 35 (2), 97-107 (1992). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.C. M. Fleiner and M. Philippsen. Fair Multi-Branch Locking of Several Locks. In International Conference on Parallel and Distributed Computing and Systems, pages 537-545, Washington D.C., October 1997.Google ScholarGoogle Scholar
  8. 8.G. Agha and S. Fr~lund. A Language Framework for Multi-Object Coordination. In O. Nierstrasz, Proceedings of the ECOOP '93 European Conference on Object-oriented Programming, pages 346-360. LNCS 707. Springer-Verlag, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.C.A.R. Hoare. Hints on Programming Language Design. In C. J. Bunyan (Ed.), State of the Art Report 20: Computer Systems Reliability, pages 505-534. Pergamon/infotech Publishing, 1974.Google ScholarGoogle Scholar
  10. 10.C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.R. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.S. Letovsky and E. Soloway. Delocalized Plans and Program Comprehension. IEEE Softw. 3 (3) (1986).Google ScholarGoogle Scholar
  13. 13.S. Matsuoka and A. Yonezawa. Analysis of Inheritance Anomaly in Object-Oriented Concurrent Programming Languages. In G. Agha and E Wegner and A. Yonezawa, Research Directions in Concurrent Object-Oriented Programming, pages 107-150. MIT Press, Cambridge, MA, 1993. Google ScholarGoogle Scholar
  14. 14.B. Meyer. Object-Oriented Software Construction. Prentice- Hall, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.S. M. Omohundro. The Sather Language. Tech. Rep. (1991), International Computer Science Institute, 1947 Center Street, Suite 600, Berkely, California 94704.Google ScholarGoogle Scholar
  16. 16.C. Rich and R. C. Waters. The Programmer's Apprentice. Addison Wesley, 1990. Google ScholarGoogle Scholar
  17. 17.S. Rugaber and R. E. K. Stirewalt and L. Wills. Understanding Interleaved Code. Journal of Automated Software Engineering 3 (1) (1996).Google ScholarGoogle Scholar
  18. 18.S. Rugaber and R. E. K. Stirewalt and L. Wills. The Interleaving Problem in Program Understanding. In Proceedings of the IEEE Second Working Conference on Reverse Engineering, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  19. 19.A. Shah. State of the Art: JavaSpace, Java Report: The Source for Java Development 2 (5), 16 (1997).Google ScholarGoogle Scholar
  20. 20.A. S. Tanenbaum. Modern Operating Systems. Prentice Hall, New Jersey, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.E Zave. A Compositional Approach to Multiparadigm Programming. IEEE Software 6 (5) (1989). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.P. Zave and M. Jackson. Conjunction as Composition. ACM STrans. Softw. Eng. Meth. 2 (4), 371-411 (1993). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The universe model: an approach for improving the modularity and reliability of concurrent programs

                    Recommendations

                    Comments

                    Login options

                    Check if you have access through your login credentials or your institution to get full access on this article.

                    Sign in
                    • Published in

                      cover image ACM Conferences
                      SIGSOFT '00/FSE-8: Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
                      November 2000
                      170 pages
                      ISBN:1581132050
                      DOI:10.1145/355045

                      Copyright © 2000 ACM

                      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                      Publisher

                      Association for Computing Machinery

                      New York, NY, United States

                      Publication History

                      • Published: 1 November 2000

                      Permissions

                      Request permissions about this article.

                      Request Permissions

                      Check for updates

                      Qualifiers

                      • Article

                      Acceptance Rates

                      Overall Acceptance Rate17of128submissions,13%

                      Upcoming Conference

                      FSE '24

                    PDF Format

                    View or Download as a PDF file.

                    PDF

                    eReader

                    View online with eReader.

                    eReader