Verification for Java’s Reentrant Multithreading Concept

  • Erika Ábrahám-Mumm
  • Frank S. de Boer
  • Willem-Paul de Roever
  • Martin Steffen
Conference paper

DOI: 10.1007/3-540-45931-6_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2303)
Cite this paper as:
Ábrahám-Mumm E., de Boer F.S., de Roever WP., Steffen M. (2002) Verification for Java’s Reentrant Multithreading Concept. In: Nielsen M., Engberg U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg

Abstract

Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread-classes, allowing for a multithreaded flow of control. The concurrency model offers coordination via lock-synchronization, and communication by synchronous message passing, including re-entrant method calls, and by instance variables shared amongthreads.

To reason about multithreaded programs, we introduce in this paper an assertional proof method for Java MT (“Multi-Threaded Java”), a small concurrent sublanguage of Java, coveringthe mentioned concurrency issues as well as the object-based core of Java, i.e., object creation, side effects, and aliasing, but leaving aside inheritance and subtyping.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Erika Ábrahám-Mumm
    • 1
  • Frank S. de Boer
    • 2
  • Willem-Paul de Roever
    • 1
  • Martin Steffen
    • 1
  1. 1.Christian-Albrechts-Universität zu KielGermany
  2. 2.Utrecht UniversityThe Netherlands

Personalised recommendations