Abstract
Constraint-based synchronization pioneered by (concurrent) logic and concurrent constraint programming is a powerful mechanism for elegantly synchronizing concurrent and distributed computations. It supports a declarative model of concurrency that avoids explicitly suspending and resuming computations. This extended abstract briefly outlines (1) a new model for high-level concurrent and distributed programming based on constraint entailment, (2) its implementation (for both uniprocessors and distributed systems) as an extension to the Java programming language, and (3) how model-based verification methods can be directly applied to programs in the resulting language.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Carriero, N., Gelernter, D.: How to write parallel programs: A first course. MIT Press, Cambridge (1991)
McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
Ramirez, R., Santosa, A.E., Yap, R.: Concurrent programming made easy. In: IEEE International Conference on Engineering of Complex Computer Systems, IEEE Press, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ramirez, R., Martinez, J. (2004). Constraint-Based Synchronization and Verification of Distributed Java Programs. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive