Abstract
Based on the impς-calculus, ASP (Asynchronous Sequential Processes) defines distributed applications behaving determinical. This article extends ASP by building hierarchical and asynchronous distributed components. Components are hierarchical— a composite can be built from other components, and distributed— a composite can span over several machines. This article also shows how the asynchronous component model can be used to statically assert component determinism.
Please use the following format when citing this chapter: Caromel, D., Henrio, L., 2006, in International Federation for Information Processing, Volume 209, Fourth IFIP International Conference on Theoretical Computer Science-TCS 2006, eds. Navarro, G., Bertossi, L., Kohayakwa, Y., (Boston: Springer), pp. 165–183.
Chapter PDF
Similar content being viewed by others
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
Icse’ 79: Proceedings of the 4th international conference on software engineering, 1979. Chairman-F. L. Bauer and Chairman-Leon G. Stucki and Chairman-M. M. Lehman.
Martíin Abadi and Luca Cardelli. A Theory of Objects. Springer-Verlag, New York, 1996.
Robert Allen and David Garlan. A formal basis for architectural connection. ACM Transactions on Sofware Engineering and Methodology, July 1997.
Mark Astley and Gul A. Agha. Customization and composition of distributed objects: Middleware abstractions for policy management. In Proceedings of the ACM SIGSOFT 6th International Symposium on Foundations of Software Engineering (FSE), 1998.
Françoise Baude, Denis Caromel, and Matthieu Morel. From distributed objects to hierarchical grid components. In International Symposium on Distributed Objects and Applications (DOA), Catania, Sicily, Italy, 3–7 November, LNCS. Springer Verlag, Berlin, Heidelberg, 2003.
Philippe Bidinger and Jean-Bernard Stefani. The kell calculus: operational semantics and type system. In Proceedings 6th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS 03), Paris, France, 2003.
Eric Bruneton, Thierry Coupaye, Matthieu Leclerc, Vivien Quema, and Jean-Bernard Stefani. An open component model and its support in java. In Ivica Crnkovic, Judith A. Stafford, Heinz W. Schmidt, and Kurt C. Wallnau, editors, CBSE, volume 3054 of Lecture Notes in Computer Science. Springer, 2004.
Luca Cardelli and Andrew D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):17–213, 2000. An extended abstract appeared in Proceedings of FoSSaCS’98, pages 140—155.
Denis Caromel and Ludovic Henrio. A Theory of Distributed Objects. Springer-Verlag New York, Inc., 2005. To appear.
Denis Caromel, Ludovic Henrio, and Bernard Paul Serpette. Asynchronous and deterministic objects. In Proceedings of the 31st ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 123–134. ACM Press, 2004.
Denis Caromel, Wilfried Klauser, and Julien Vayssière. Towards seamless computing and metacomputing in Java. Concurrency: Practice and Experience, 10(11–13):1043–1061, 1998. ProActive available at http://www.inria.fr/oasis/ proactive.
Bruneton E., Coupaye T., and Stefani J.B. Recursive and dynamic software composition with sharing. In Proceedings of the 7th ECOOP International Workshop on Component-Oriented Programming (WCOP’02), 2002.
Cormac Flanagan and Matthias Felleisen. The semantics of future and an application. Journal of Functional Programming, 9(1):1–31, 1999.
Dimitra Giannakopoulou, Jeff Kramer, and Shing Chi Cheung. Behaviour analysis of distributed systems using the tracta approach. Automated Software Engg, 6(1), 1999.
Andrew D. Gordon, Paul D. Hankin, and Sren B. Lassen. Compilation and equivalence of imperative objects. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 17:74–87, 1997.
Robert H. Halstead, Jr. Multilisp: A language for concurrent symbolic computation. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(4):501–538, 1985.
Gilles Kahn. The semantics of a simple language for parallel programming. In J. L. Rosenfeld, editor, Information Processing ’7: Proceedings of the IFIP Congress, pages 471–475. North-Holland, New York, 1974.
Uwe Nestmann and Martin Steffen. Typing confluence. In Stefania Gnesi and Diego Latella, editors, Proceedings of FMICS’97, pages 77–101. Consiglio Nazionale Ricerche di Pisa, 1997. Also available as report ERCIM-10/97-R052, European Research Consortium for Informatics and Mathematics, 1997.
Thomas Parks and David Roberts. Distributed Process Networks in Java. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS2003), Nice, France, April 2003.
Alan Schmitt and Jean-Bernard Stefani. The kel] calculus: A family of higher-order distributed process calculi. Lecture Notes in Computer Science, 3267, Feb 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Caromel, D., Henrio, L. (2006). Asynchonous Distributed Components: Concurrency and Determinacy. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds) Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006. IFIP International Federation for Information Processing, vol 209. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34735-6_16
Download citation
DOI: https://doi.org/10.1007/978-0-387-34735-6_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34633-5
Online ISBN: 978-0-387-34735-6
eBook Packages: Computer ScienceComputer Science (R0)