Typing communicating component assemblages

ABSTRACT

Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a type-system-based approach to avoid message handling errors when assembling component-based communication systems. Such errors are not captured by classical type systems of host programming languages such as Java or ML. Our approach relies on the definition of a small process calculus that captures the operational essence of our target component-based framework for communication systems, and on the definition of a novel type system that combines row types with process types.

REFERENCES

• 1: Franz Achermann , Oscar Nierstrasz, A calculus for reasoning about software composition, Theoretical Computer Science, v.331 n.2-3, p.367-396, 25 February 2005 [doi>10.1016/j.tcs.2004.09.022]
• 2: Alexander Aiken , Edward L. Wimmers, Type inclusion constraints and type inference, Proceedings of the conference on Functional programming languages and computer architecture, p.31-41, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165188]
• 3: Jonathan Aldrich , Craig Chambers , David Notkin, Architectural Reasoning in ArchJava, Proceedings of the 16th European Conference on Object-Oriented Programming, p.334-367, June 10-14, 2002
• 4: Robert Allen , David Garlan, A formal basis for architectural connection, ACM Transactions on Software Engineering and Methodology (TOSEM), v.6 n.3, p.213-249, July 1997 [doi>10.1145/258077.258078]
• 5: Nina T. Bhatti , Matti A. Hiltunen , Richard D. Schlichting , Wanda Chiu, Coyote: a system for constructing fine-grain configurable communication services, ACM Transactions on Computer Systems (TOCS), v.16 n.4, p.321-366, Nov. 1998 [doi>10.1145/292523.292524]
• 6: Philippe Bidinger , Matthieu Leclercq , Vivien Quéma , Alan Schmitt , Jean-Bernard Stefani, Dream types: a domain specific type system for component-based message-oriented middleware, Proceedings of the 2005 conference on Specification and verification of component-based systems, September 05-06, 2005, Lisbon, Portugal
• 7: Eric Bruneton , Thierry Coupaye , Matthieu Leclercq , Vivien Quéma , Jean-Bernard Stefani, The FRACTAL component model and its support in Java: Experiences with Auto-adaptive and Reconfigurable Systems, Software—Practice & Experience, v.36 n.11-12, p.1257-1284, September 2006 [doi>10.1002/spe.v36:11/12]
• 8: Luca Cardelli , Andrew D. Gordon, Types for mobile ambients, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.79-92, January 20-22, 1999, San Antonio, Texas, United States [doi>10.1145/292540.292550]
• 9: C. Carrez, A. Fantechi, and E. Najm. Behaviour contracts for a sound assembly of components. In FORTE, volume 2767 of Lecture Notes in Computer Science. Springer, 2003.
• 10: Sylvain Conchon , François Pottier, JOIN(X): Constraint-Based Type Inference for the Join-Calculus, Proceedings of the 10th European Symposium on Programming Languages and Systems, p.221-236, April 02-06, 2001
• 11: Karl Crary , Stephanie Weirich , Greg Morrisett, Intensional polymorphism in type-erasure semantics, Proceedings of the third ACM SIGPLAN international conference on Functional programming, p.301-312, September 26-29, 1998, Baltimore, Maryland, United States
• 12: Fritz Henglein, Type inference with polymorphic recursion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.2, p.253-289, April 1993 [doi>10.1145/169701.169692]
• 13: J. Roger Hindley, Basic simple type theory, Cambridge University Press, New York, NY, 1997
• 14: V. Issarny , C. Bidan , T. Saridakis, Achieving Middleware Customization in a Configuration-Based Development Environment: Experience with the Aster Prototype, Proceedings of the International Conference on Configurable Distributed Systems, p.207, March 04-06, 1998
• 15: Ackbar Joolia , Thais Batista , Geoff Coulson , Antonio Tadeu A. Gomes, Mapping ADL Specifications to an Efficient and Reconfigurable Runtime Component Platform, Proceedings of the 5th Working IEEE/IFIP Conference on Software Architecture, p.131-140, November 06-10, 2005 [doi>10.1109/WICSA.2005.42]
• 16: Matthieu Leclercq , Ali Erdem Ozcan , Vivien Quema , Jean-Bernard Stefani, Supporting Heterogeneous Architecture Descriptions in an Extensible Toolset, Proceedings of the 29th international conference on Software Engineering, p.209-219, May 20-26, 2007 [doi>10.1109/ICSE.2007.82]
• 17: Matthieu Leclercq , Vivien Quema , Jean-Bernard Stefani, DREAM: A Component Framework for Constructing Resource-Aware, Configurable Middleware, IEEE Distributed Systems Online, v.6 n.9, p.1, September 2005 [doi>10.1109/MDSO.2005.47]
• 18: Cédric Lhoussaine, Type inference for a distributed π-calculus, Science of Computer Programming, v.50 n.1-3, p.225-251, March 2004 [doi>10.1016/j.scico.2003.12.003]
• 19: M. Lienhardt, A. Schmitt, and J.-B. Stefani. A type system for the DREAM framework, 2007. http://sardes.inrialpes.fr/papers/files/rrdreamtypes.pdf.
• 20: Xiaoming Liu , Christoph Kreitz , Robbert van Renesse , Jason Hickey , Mark Hayden , Kenneth Birman , Robert Constable, Building reliable, high-performance communication systems from components, Proceedings of the seventeenth ACM symposium on Operating systems principles, p.80-92, December 12-15, 1999, Charleston, South Carolina, United States
• 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 π-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: Alexandre Pinto, Appia: A Flexible Protocol Kernel Supporting Multiple Coordinated Channels, Proceedings of the The 21st International Conference on Distributed Computing Systems, p.707, April 16-19, 2001
• 25: Robert Morris , Eddie Kohler , John Jannotti , M. Frans Kaashoek, The Click modular router, Proceedings of the seventeenth ACM symposium on Operating systems principles, p.217-231, December 12-15, 1999, Charleston, South Carolina, United States
• 26: Martin Odersky , Martin Sulzmann , Martin Wehr, Type inference with constrained types, Theory and Practice of Object Systems, v.5 n.1, p.35-55, Jan. 1999 [doi>10.1002/(SICI)1096-9942(199901/03)5:1<35::AID-TAPO4>3.0.CO;2-4]
• 27: Benjamin C. Pierce , David N. Turner, Pict: a programming language based on the Pi-Calculus, Proof, language, and interaction: essays in honour of Robin Milner, MIT Press, Cambridge, MA, 2000
• 28: E. L. Post. A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society, 52:264--268, 1946.
• 29: François Pottier, A 3-Part Type Inference Engine, Proceedings of the 9th European Symposium on Programming Languages and Systems, p.320-335, April 02, 2000
• 30: François Pottier, Simplifying subtyping constraints: a theory, Information and Computation, v.170 n.2, p.153-183, November 1, 2001 [doi>10.1006/inco.2001.2963]
• 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: Alastair Reid , Matthew Flatt , Leigh Stoller , Jay Lepreau , Eric Eide, Knit: component composition for systems software, Proceedings of the 4th conference on Symposium on Operating System Design & Implementation, p.24-24, October 22-25, 2000, San Diego, California
• 33: Didier Rémy, Type inference for records in natural extension of ML, Theoretical aspects of object-oriented programming: types, semantics, and language design, MIT Press, Cambridge, MA, 1994
• 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: Vincent Simonet , François Pottier, A constraint-based approach to guarded algebraic data types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.1, p.1-es, January 2007 [doi>10.1145/1180475.1180476]
• 36: C. Szyperski. Component Software, 2nd edition. Addison-Wesley, 2002.
• 37: Robbert van Renesse , Ken Birman , Mark Hayden , Alexey Vaysburd , David Karr, Building adaptive systems using ensemble, Software—Practice & Experience, v.28 n.9, p.963-979, July 25, 1998 [doi>10.1002/(SICI)1097-024X(19980725)28:9<963::AID-SPE179>3.0.CO;2-9]
• 38: Stephanie Weirich, Higher-Order Intensional Type Analysis, Proceedings of the 11th European Symposium on Programming Languages and Systems, p.98-114, April 08-12, 2002
• 39: Nobuko Yoshida , Matthew Hennessy, Assigning Types to Processes, Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, p.334, June 26-29, 2000
• 40: Nobuko Yoshida , Matthew Hennessy, Assigning types to processes, Information and Computation, v.174 n.2, p.143-179, May 1 2002 [doi>10.1006/inco.2002.3113]
• 41: Nobuko Yoshida , Vasco T. Vasconcelos, Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication, Electronic Notes in Theoretical Computer Science (ENTCS), v.171 n.4, p.73-93, July, 2007 [doi>10.1016/j.entcs.2007.02.056]

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.1 Formal Definitions and Theory
          Subjects: Semantics

General Terms:
Languages, Theory

Keywords:
assemblage error, communication systems, component types, components, process types, type interference, type system