Typing communicating component assemblages

GPCE'08: Proceedings of the ACM SIGPLAN 7th International Conference on Generative Programming and Component Engineering

Volumn , Issue , 2008, Pages 125-135

  Lienhardt, Michael ^a   Schmitt, Alan ^b   Stefani, Jean Bernard ^b  

^a UNIV GRENOBLE ALPES   (France)

^b INRIA   (France)

Author keywords

Assemblage errors; Communication systems; Component types; Components; Process types; Type inference; Type system

Indexed keywords

CALCULATIONS; COMMUNICATION SYSTEMS;

BUILDING COMPLEXES; COMMUNICATING COMPONENTS; COMPONENT TYPES; COMPONENTS; MESSAGE HANDLING; TARGET COMPONENT; TYPE INFERENCES; TYPE SYSTEMS;

ERRORS;

EID: 63449141956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1449913.1449933     Document Type: Conference Paper

References (41)

1. F. Achermann and O. Nierstrasz. A calculus for reasoning about software composition. Theor. Comput. Sci., 331(2-3), 2005.
2. A. Aiken and E. L. Wimmers. Type inclusion constraints and type inference. In Functional Programming Languages and Computer Architecture, pages 31-41, 1993.
3. J. Aldrich, C. Chambers, and D. Notkin. Architectural Reasoning in ArchJava. In Proceedings 16th European Conf. on Object-Oriented Programming, 2002.
4. R. Allen and D. Garlan. A Formal Basis for Architectural Connection. In ACM Transactions on Software Engineering and Methodology, Vol. 6, No. 3, pages 213-249, July 1997.
5. N. T. Bhatti, M. A. Hiltunen, R. D. Schlichting, and W. Chiu. Coyote: A system for constructing fine-grain configurable communication services. ACM Trans. Comput. Syst., 16(4), 1998.
6. P. Bidinger, M. Leclercq, V. Quéma, A. Schmitt, and J.B. Stefani. Dream Types - A Domain Specific Type System for Component -Based Message-Oriented Middleware. In 4th Workshop on Specification and Verification of Component-Based Systems (SAVCBS'05), in association with ESEC/FSE'05/, 2005.
7. E. Bruneton, T. Coupaye, M. Leclercq, v. Quema, and J.B. Stefani. The Fractal Component Model and its Support in Java. Software - Practice and Experience, 36(11-12), 2006.
8. L. Cardelli. Types for mobile ambients. In Proceedings 26th Annual ACM Symposium on Principles ofProgramming Languages (POPL), 1999.
9. C. Carrez, A. Fantechi, and E. Najm. Behaviour contracts fora sound assembly of components. In FORTE, volume 2767 of Lecture Notes in Computer Science. Springer, 2003.
10. S. Conchon and F. Pottier. Join(x): Constraint-based type inference for the join-calculus. In 10th European Symposium on Programming Languages and Systems. Springer-verlag, 2001.
11. K. Crary, S. Weirich, and G. Morrisett. Intensional polymorphism in type-erasure semantics. In ICFP '98: Proceedings of the third ACM SIGPLAN international conference on Functional programming, pages 301-312, New York, NY, USA, 1998. ACM.
12. Fritz Henglein. Type inference with polymorphic recursion. ACM Trans. Program. Lang. Syst., 15(2):253-289, 1993.
13. J. Roger Hindley. Basic simple type theory. Cambridge University Press, New York, NY, USA, 1997.
14. V. Issarny, C. Bidan, and T. Saridakis. Achieving Middleware Customization in a Configuration-Based Development Environment: Experience with the Aster Prototype. In 4th Int. Conf. on Configurable Distributed Systems, 1998.
15. A. Joolia, T. Batista, G. Coulson, and A. Gomes. Mapping ADL Specifications to an Efficient and Reconfigurable Runtime Component Platform. In 5th IEEE/IFIP Conference on Software Architecture (WICSA'05). IEEE Computer Society, 2005.
16. M. Leclercq, A. E. Ozcan, V. Quema, and J.B. Stefani. Supporting heterogeneous architecture descriptions in an extensible toolset. In ICSE '07: Proceedings of the 29th International Conference on Software Engineering, pages 209-219, Washington, DC, USA, 2007. IEEE Computer Society.
17. M. Leclercq, V. Quema, and J.B. Stefani. DREAM: a Component Framework for the Construction of Resource-Aware, Configurable MOMs. IEEE Distributed Systems Online, 6(9), 2005.
18. C. Lhoussaine. Type inference for a distributed π-calculus. Sci. Comput. Program., 50(1-3), 2004.
19. M. Lienhardt, A. Schmitt, and J.-B. Stefani. A type system for the DREAM framework, 2007. http://sardes.inrialpes.fr/papers/files/rr- dreamtypes.pdf.
20. X. Liu, C. Kreitz, R. van Renesse, J. Hickey, M. Hayden, K. Birman, and R. Constable. Building Reliable, High-Performance Communication Systems from Components. In ACM Symposium on Operating Systems Principles, 1999.
21. M. Lumpe, F. Achermann, and O. Nierstrasz. A Formal Language for Composition, chapter 4. Cambridge University Press, 2000.
22. Sergio Maffeis. Sequence types for the pi-calculus. In ITRS 04, volume 136 of ENTCS, pages 117-132. Elsevier, 2005.
23. H. Makholm and J. B. Wells. Instant polymorphic type systems for mobile process calculi: Just add reduction rules and close. In 14th European Symposium on Programming, volume 3444 of Lecture Notes in Computer Science. Springer, 2005.
24. H. Miranda, A. S. Pinto, and L. Rodrigues. Appia: A flexible protocol kernel supporting multiple coordinated channels. In 21st International Conference on Distributed Computing Systems (ICDCS 2001). IEEE Computer Society, 2001.
25. R. Morris, E. Kohler, J. Jannotti, and M. F. Kaashoek. The Click Modular Router. In ACM Symposium on Operating Systems Principles, 1999.
26. M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35- 55, 1999.
27. B. Pierce and D. Turner. Pict: A programming language based on the pi-calculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000.
28. E. L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52:264-268, 1946.
29. F. Pottier. A 3-part type inference engine. In Gert Smolka, editor, Proceedings ofthe 2000 European Symposium on Programming (ESOP'00), volume 1782, pages 320-335. Springer Verlag, 2000.
30. F. Pottier. Simplifying subtyping constraints: A theory. INFCTRL: Information and Computation (formerly Information and Control), 170, 2001.
31. F. Pottier and D. Rémy. The Essence of ML Type Inference. In B. Pierce (ed), Advanced Topic in Types and Programming Languages. MIT Press, 2005.
32. A. Reid, M. Flatt, L. Stoller, J. Lepreau, and E. Eide. Knit: Component Composition for Systems Software. In Proceedings of the 4th Symposium on Operating Systems Design and Implementation, 2000.
33. D. Rémy. Type inference for records in a natural extension of ML. In Theoretical Aspects OfObject-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1993.
34. A. Schmitt and J.B. Stefani. The Kell Calculus: A Family of Higher- Order Distributed Process Calculi. In Global Computing, volume 3267 of Lecture Notes in Computer Science. Springer, 2005.
35. v. Simonet and F. Pottier. A constraint-based approach to guarded algebraic data types. ACM Trans. Program. Lang. Syst., 29(1):1, 2007.
36. C. Szyperski. Component Software, 2nd edition. Addison-Wesley, 2002.
37. R. van Renesse, K. Birman, M. Hayden, A. vaysburd, and D. Karr. Building Adaptive Systems Using Ensemble. Software - Practice and Experience, 28(9), 1998.
38. S. Weirich. Higher-order intensional type analysis. In 11th European Symposium on Programming Languages and Systems. Springer- verlag, 2002.
39. N. Yoshida and M. Hennessy. Assigning types to processes. In 15th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 334-345, 2000.
40. N. Yoshida and M. Hennessy. Assigning types to processes. Inf. Comput., 174(2), 2002.
41. N. Yoshida and v. vasconcelos. Language primitives and type discipline for structured communication-based programming revisited: Two systems for higher-order session communication. Electr. Notes Theor. Comput. Sci., 171(4), 2007.