Abstract
We describe the implementation of a high-level language based on first order logic for expressing synchronization in multi-threaded Java programs. The language allows the programmer to declaratively state the system safety properties as temporal constraints on specific pro- gram points of interest (events). The constraints are enforced by the run- time environment, i.e. the program points of interest are traversed only in the order specified by the constraints. The implementation is based on the incremental and lazy generation of partial orders among events. Although the implementation reported in this paper is concerned only with the synchronization of Java programs, the general underlying syn- chronization model we present is language independent in that it allows the programmer to glue together separate concurrent threads regardless of their implementation language and application code.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Atkinson, C. 1991. Object-Oriented Reuse, Concurrency and Distribution: An Ada-Based Approach. Addison-Wesley.
Van den Bos, J. and Laffra, C. 1989. PROCOL: A parallel object language with protocols. ACM SIGPLAN Notices 24(10):95–112, October 1989. Proc. of OOPSLA’ 89.
Gregory, S. 1987. Parallel Logic Programming in PARLOG, Addison-Wesley.
Gregory, S. and Ramirez, R. 1995. Tempo: a declarative concurrent programming language. Proc. of the ICLP (Tokyo, June), MIT Press, 1995.
Gregory, S. 1995. Derivation of concurrent algorithms in Tempo. In LOPSTR95: Fifth International Workshop on Logic Program Synthesis and Transformation.
Kiczales, G., Lamping, J., Mendhekar, A., Maeda, C., Lopes, C., Loingtier, J.-M. and Irwin, J. 1997. Aspect-oriented programming. In ECOOP’ 97—Object-Oriented Programming, Lecture Notes in Computer Science, number 1241, pp. 220–242, Springer-Verlag.
Kowalski, R.A. and Sergot, M.J. 1986. A logic-based calculus of events. New Generation Computing 4, pp. 67–95.
Krakowiak, S., Meysembourg, M., Nguyen Van, H., Riveill, M., Roisin, C. and Rousset de Pina, X. 1990. Design and implementation of an object-oriented strongly typed language for distributed applications. Journal of Object-Oriented Programming 3(3):11–22.
Pratt, V. 1986. Modeling concurrency with partial orders. International Journal of Parallel Programming 15, 1, pp. 33–71.
Ramirez, R. 1996. A logic-based concurrent object-oriented programming language, PhD thesis, Bristol University.
Ramirez, R., Santosa, A. E. 2000. Declarative concurrency in Java, Proceedings of the 5th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS 2000). Springer-Verlag.
Saraswat, V., and Rinard, M. 1990. Concurrent Constraint Programming. Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages. pp. 232–245.
Ueda, K. and Chikayama, T. 1990. Design of the kernel language for the parallel inference machine. Computer Journal 33,6, pp. 494–500.
De Volder, K. and D’Hondt, T. 1999. Aspect-oriented logic meta programming. In Meta-Level Architectures and Reflection, Lecture Notes in Computer Science number 1616, pp. 250–272. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramirez, R., Santosa, A.E., Hong, L.W. (2000). Implementing Declarative Concurrency in Java. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_97
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_97
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive