Skip to main content

Heap-Abstraction for an Object-Oriented Calculus with Thread Classes

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3988))

Abstract

This paper formalizes an open semantics for a calculus featuring thread classes, where the environment, consisting in particular of an overapproximation of the heap topology, is abstractly represented.

We extend our prior work not only by adding thread classes, but also in that thread names may be communicated, which means that the semantics needs to account explicitly for the possible acquaintance of objects with threads. We show soundness of the abstraction.

Part of this work has been financially supported by the NWO/DFG project Mobi-J (RO 1122/9-4) and by the DFG project AVACS (SFB/TR-14-AVACS).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ábrahám, E., Bonsangue, M.M., de Boer, F.S., Steffen, M.: Object connectivity and full abstraction for a concurrent calculus of classes. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 37–51. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Ábrahám, E., de Boer, F.S., Bonsangue, M.M., Grüner, A., Steffen, M.: Observability, connectivity, and replay in a sequential calculus of classes. In: Bosangue, et al. [4], pp. 296–316

    Google Scholar 

  3. Ábrahám, E., Grüner, A., Steffen, M.: Dynamic heap-abstraction for open, objectoriented systems with thread classes. Technical Report 0601, Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel (January 2006)

    Google Scholar 

  4. Bonsangue, M., de Boer, F.S., de Roever, W.-P., Graf, S.: FMCO 2004. LNCS, vol. 3657. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  5. de Boer, F.S., Bonsangue, M., Steffen, M., Ábrahám, E.: A fully abstract trace semantics for UML components. In: Bosangue, et al. [4], pp. 49–69

    Google Scholar 

  6. Jeffrey, A., Rathke, J.: A fully abstract may testing semantics for concurrent objects. In: Proceedings of LICS 2002, July 2002. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  7. Jeffrey, A., Rathke, J.: Java JR: Fully Abstract Trace Semantics for a Core Java Language. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 423–438. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Smith, G.P.: An Object-Oriented Approach to Formal Specification. Ph.D thesis, Department of Computer Science. University of Queensland (October 1992)

    Google Scholar 

  9. Viswanathan, R.: Full abstraction for first-order objects with recursive types and subtyping. In: Proceedings of LICS 1998, July 1998. IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ábrahám, E., Grüner, A., Steffen, M. (2006). Heap-Abstraction for an Object-Oriented Calculus with Thread Classes. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_1

Download citation

  • DOI: https://doi.org/10.1007/11780342_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics