Skip to main content
SpringerLink
Log in

A Class-Based Object Calculus of Dynamic Binding: Reduction and Properties

  • Conference paper
Software Composition (SC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4089))

Included in the following conference series:

  • 303 Accesses

Abstract

To be able to compose and decompose software components at run time, some form of dynamic rebinding between components (or objects) is needed. In this paper, we identify basic properties of dynamic object (re)binding, and propose a class-based object calculus that gives precise meaning to these properties. We also define two example semantic properties that are characteristic for many concurrent programs with low-level bind/unbind operations. Our calculus has a built-in construct atomic that can be used to implement one of the semantic properties.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., Cardelli, L.: An imperative object calculus. In: Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915. Springer, Heidelberg (1995)

    Google Scholar 

  2. Bergel, A., Ducasse, S., Wuyts, R.: Classboxes: A minimal module model supporting local rebinding. In: Böszörményi, L., Schojer, P. (eds.) JMLC 2003. LNCS, vol. 2789, pp. 122–131. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Bierman, G., Hicks, M., Sewell, P., Stoyle, G., Wansbrough, K.: Dynamic rebinding for marshalling and update, with destruct-time lambda. In: Proc. ICFP 2003 (August 2003)

    Google Scholar 

  4. Drossopoulou, S., Lagorio, G., Eisenbach, S.: Flexible models for dynamic linking. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 38–53. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Flanagan, C., Qadeer, S.: A type and effect system for atomicity. In: Proc. PLDI 2003 (June 2003)

    Google Scholar 

  6. Gordon, A.D., Hankin, P.D.: A concurrent object calculus: Reduction and typing. In: Proc. HLCL 1998: the 3rd Int’l Workshop on High-Level Concurrent Languages. ENTCS, vol. 16(3). Elsevier, Amsterdam (1998)

    Google Scholar 

  7. Harris, T., Fraser, K.: Language support for lightweight transactions. In: Proc. OOPSLA 2003 (2003)

    Google Scholar 

  8. Igarashi, A., Pierce, B., Wadler, P.: Featherweight Java: A minimal core calculus for Java and GJ. In: Proc. OOPSLA 1999 (November 1999)

    Google Scholar 

  9. Lee, S.-D., Friedman, D.P.: Quasi-static scoping: Sharing variable bindings across multiple lexical scopes. In: Proc. POPL 1993 (Janurary 1993)

    Google Scholar 

  10. Lowe, G.: Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055. Springer, Heidelberg (1996)

    Google Scholar 

  11. Leifer, J., Peskine, G., Sewell, P., Wansbrough, K.: Global abstraction-safe marshalling with hash types. In: Proc. ICFP 2003 (2003)

    Google Scholar 

  12. MIT. Scheme, http://www.swiss.ai.mit.edu/projects/scheme/

  13. Moreau, L.: A syntactic theory of dynamic binding. Higher-Order and Symbolic Computation 11(3), 233–279 (1998)

    Article  MATH  Google Scholar 

  14. Malabarba, S., Pandey, R., Gragg, J., Barr, E., Barnes, J.F.: Runtime support for type-safe dynamic Java classes. In: Bertino, E. (ed.) ECOOP 2000. LNCS, vol. 1850, p. 337. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Plotkin, G.D.: Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science 1, 125–159 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  16. Rütti, O., Wojciechowski, P.T., Schiper, A.: Service Interface: A new abstraction for implementing and composing protocols. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356. Springer, Heidelberg (2007)

    Google Scholar 

  17. Rütti, O., Wojciechowski, P.T., Schiper, A.: Structural and algorithmic issues of dynamic protocol update. In: Proc. IPDPS 2006: the 20th IEEE Int’l Parallel and Distributed Processing Symposium (April 2006)

    Google Scholar 

  18. Vitek, J., Jagannathan, S., Welc, A., Hosking, A.L.: A semantic framework for designer transactions. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 249–263. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Wojciechowski, P.T.: Isolation-only transactions by typing and versioning. In: Proc. PPDP 2005: the 7th ACM-SIGPLAN Int’l Symposium on Principles and Practice of Declarative Programming (July 2005)

    Google Scholar 

  20. Wojciechowski, P.T., Rütti, O.: On correctness of dynamic protocol update. In: Steffen, M., Zavattaro, G. (eds.) FMOODS 2005. LNCS, vol. 3535, pp. 275–289. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Wojciechowski, P.T., Rütti, O., Schiper, A.: SAMOA: A framework for a synchronisation-augmented microprotocol approach. In: Proc. IPDPS 2004: the 18th IEEE Int’l Parallel and Distributed Processing Symposium (April 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Poznań University of Technology, 60-965, Poznań, Poland

    Paweł T. Wojciechowski

Authors
  1. Paweł T. Wojciechowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Technology Group, MSI, Växjö University, Sweden

    Welf Löwe

  2. EMN-INRIA, LINA, Dépt. Informatique, École des Mines de Nantes, OBASCO project, 4 rue Alfred Kastler, 44307, Nantes cédex 3, France

    Mario Südholt

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wojciechowski, P.T. (2006). A Class-Based Object Calculus of Dynamic Binding: Reduction and Properties. In: Löwe, W., Südholt, M. (eds) Software Composition. SC 2006. Lecture Notes in Computer Science, vol 4089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821946_9

Download citation

  • DOI: https://doi.org/10.1007/11821946_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37657-6

  • Online ISBN: 978-3-540-37659-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation