Skip to main content
SpringerLink
Log in

An approach to object-orientation in action systems

  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1998)

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

Included in the following conference series:

Abstract

We extend the action system formalism with a notion of objects that can be dynamically created, active and distributed. With this extension we can model class-based systems as action systems. Moreover, as the introduced constructs can be translated into ordinary action systems, we can use the theory developed for action systems, especially the refinement calculus, even for class-based systems. We show how inheritance can be modelled in different ways via class refinement. Refining a class with an other class within the refinement calculus ensures that the original behavior of the class is maintained throughout the refinements. Finally, we show how to reuse refinements and entire class modules in a refinement step.

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. P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Operational semantics of a parallel object-oriented language. In Proceedings of the 13th Annual ACM Symposium on Principles of Programming Languages, pages 194–208, 1986.

    Google Scholar 

  2. P. America, J.W. de Bakker, J.N. Kok, and J.J.M.M. Rutten. Denotational semantics of a parallel object-oriented language. Information and Computation, 83(2):152–205, 1989.

    Article  MathSciNet  Google Scholar 

  3. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.

    Google Scholar 

  4. G. Agha. Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, 1986.

    Google Scholar 

  5. M. Abadi and K.R.M. Leino. A logic of object-oriented programs. In Theory and Practice of Software Development, TAPSOFT'97, volume 1214 of Lecture Notes in Computer Science, Springer-Verlag, 1997.

    Google Scholar 

  6. R.-J.R. Back. Correctness Preserving Program Refinements: Proof Theory and Applications. Volume 131 of Mathematical Centre Tracts. Mathematical Centre, Amsterdam, 1980.

    Google Scholar 

  7. R.J.R. Back. Procedural abstraction in the refinement calculus. Technical Report, åbo Akademi University, Department of Computer Science, Turku, Finland 1987.

    Google Scholar 

  8. 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 67–93, Springer-Verlag, 1990.

    Google Scholar 

  9. R.J.R. Back, M. Büchi, and E. Sekerinski. Action-based concurrence and synchronization for objects. In Proceedings of the 4th AMAST Workshop on Real-Time Systems, Concurrent, and Distributed Software, Ciutad de Mallorca, Springer-Verlag, 1997.

    Google Scholar 

  10. C. Bailes and R. Duke. The Ecology of class refinement. In J.M. Morris and C. Shaw, editors, Proceedings of the 4th Refinement Workshop, January 1991, Cambridge, UK. Workshops in Computing, pp. 185–196, Springer Verlag.

    Google Scholar 

  11. R.J.R. Back and R. Kurki-Suonio. Decentralization of process nets with centralized control. Distributed Computing, 3(2):73–87, 1983.

    Article  Google Scholar 

  12. M.M. Bonsangue and J.N. Kok. The weakest precondition calculus: recursion and duality. Formal Aspects of Computing, 6A:788–800, 1994.

    Article  Google Scholar 

  13. M.H. Brown and M.A. Najork. Distributed active objects. SRC Research Report 141a, DEC Palo Alto CA, 1996.

    Google Scholar 

  14. R.J.R. Back and K. Sere. Superposition refinement of parallel algorithms. In Parker, K.R. and Rose, editors, Proceedings of the IFIP Working Conference on Formal Description Techniques-IV, pages 475–494. North-Holland Publishing Company, 1992.

    Google Scholar 

  15. R.J.R. Back and K. Sere. Action systems with synchronous communication. In E.-R. Olderog, editor, Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi, IFIP Transactions A-56, pages 107–126, North-Holland Publishing Company, 1994.

    Google Scholar 

  16. R.J.R. Back and K. Sere. From action systems to modular systems. Software — Concepts and Tools, 17, Springer Verlag, 1996.

    Google Scholar 

  17. L. Cardelli. A language with distributed scope. Computing Systems 8(1):27–29, 1995.

    Google Scholar 

  18. K.M.Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  19. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall International, 1976.

    Google Scholar 

  20. C. Hewitt. Viewing control structures as patterns of passing messages. Artificial Intelligence 8(3), 1977.

    Google Scholar 

  21. U. Hensel, M. Huisman, B. Jacobs, and H. Tews. Reasoning about classes in object-oriented languages: logical models and tools. To appear in Proceedings of ESOP/ETAPS 1998, Lecture Notes in Computer Science, Springer-Verlag, 1998.

    Google Scholar 

  22. C.A.R. Hoare. Proofs of correctness of data representation. Acta Informatica, 1(4):271–281, 1972.

    Article  MATH  Google Scholar 

  23. H.-M. Järvinen and R. Kurki-Suonio. DisCo specification language: marriage of actions and objects. In Proceedings of the 11th International Conference on Distributed Computing Systems, IEEE Computer Society Press, pages 142–151, 1991.

    Google Scholar 

  24. C.B. Jones. A π-calculus semantics for an object-based design notation. In Proceedings of CONCUR'93, volume 715 of Lecture Notes in Computer Science, Springer-Verlag, 1993.

    Google Scholar 

  25. L. Lamport. The temporal logic of actions. Research report 79, DEC Systems research Center, 1991. To appear in ACM Transactions on Programming Languages and Systems.

    Google Scholar 

  26. K. Lano and H. Haughton. Reasoning and refinement in object-oriented specification languages. In European Conference on Object-Oriented Programming'92, volume 615 of Lecture Notes in Computer Science, Springer-Verlag 1992.

    Google Scholar 

  27. A. Mikhajlova and E. Sekerinski. Class refinement and interface refinement in object-oriented programs. In Proceedings of the Fourth International Formal Methods Europe Symposium (FME'97), volume 1313 of Lecture Notes in Computer Science, Springer-Verlag, 1997.

    Google Scholar 

  28. C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems 10:3, pages 403–419, 1988.

    Article  MATH  Google Scholar 

  29. J.M. Morris. A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming, 9:287–306, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  30. D.A. Naumann. Predicate transformer semantics of an Oberon-like language. In E.-R. Olderog, editor, Proceedings of the IFIP Working Conference on Programming Concepts, Methods and Calculi, IFIP Transactions A-56, North-Holland Publishing Company, 1994.

    Google Scholar 

  31. B. Strulo. How firing conditions help inheritance. In J.P. Bowen and M.G. Hinchey, editors, ZUM'95: The Z Formal Specification Notation, volume 967 of Lecture Notes in Computer Science, Springer-Verlag 1995.

    Google Scholar 

  32. K. Sere and M. Waldén. Data refinement of remote procedures. In M. Abadi and T. Ito, editors, Proceedings of the International Symposium on Theoretical Aspects of Computer Software (TACS'97), Sendai, Japan, volume 1281 of Lecture Notes in Computer Science, pages 267–294, Springer-Verlag, 1997.

    Google Scholar 

  33. R.T. Udink and J.N. Kok. ImpUNITY: UNITY with Procedures and Local Variables. In Proceedings of Mathematics of Program Construction '95, volume 947 of Lecture Notes in Computer Science. Springer-Verlag, 1995.

    Google Scholar 

  34. D.J. Walker. Objects in the π-calculus. Information and Computation, 116(2):253–271, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  35. M. Waldén. Layering distributed algorithms. Technical report No 121, Turku Centre for Computer Science, Turku, Finland, 1997. To appear in Proceedings of the 2nd B conference, France, April 1998.

    Google Scholar 

  36. J. von Wright. The lattice of data refinement. Acta Informatica, 31(2):105–135, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rijks Universiteit Leiden, P.O. Box 9512, NL-2300, RA Leiden, The Netherlands

    Marcello M. Bonsangue & Joost N. Kok

  2. Department of Computer Science, åbo Akademi University Turku Centre for Computer Science, FIN-20520, Turku, Finland

    Kaisa Sere

Authors
  1. Marcello M. Bonsangue
    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

  3. Kaisa Sere
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Johan Jeuring

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonsangue, M.M., Kok, J.N., Sere, K. (1998). An approach to object-orientation in action systems. In: Jeuring, J. (eds) Mathematics of Program Construction. MPC 1998. Lecture Notes in Computer Science, vol 1422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054286

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69345-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation