Typed Connector Families

• Type: Article in International Conference Proceedings Book
• Date: 2015

Authors

Proença, Jose (Author) Other; Clarke, Dave (Author) Other

Conference proceedings International

Title: Formal Aspects of Component Software - 12th International Conference, FACS 2015, Niterói, Brazil, October 14-16, 2015, Revised Selected Papers

Pages: 294-311

12th International Conference on Formal Aspects of Component Software, FACS 2015

14 October 2015 through 16 October 2015

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 2 Citations

Other information

Authenticus ID: P-00K-5ZA

DOI: 10.1007/978-3-319-28934-2_16

Abstract (EN): Typed models of connector/component composition specify interfaces describing ports of components and connectors. Typing ensures that these ports are plugged together appropriately, so that data can flow out of each output port and into an input port. These interfaces typically consider the direction of data flow and the type of values flowing. Components, connectors, and systems are often parameterised in such a way that the parameters affect the interfaces. Typing such connector families is challenging. This paper takes a first step towards addressing this problem by presenting a calculus of connector families with integer and boolean parameters. The calculus is based on monoidal categories, with a dependent type system that describes the parameterised interfaces of these connectors. As an example, we demonstrate how to define n-ary Reo connectors in the calculus. The paper focusses on the structure of connectors¿well-connectedness¿and less on their behaviour, making it easily applicable to a wide range of coordination and componentbased models. A type-checking algorithm based on constraints is used to analyse connector families, supported by a proof-of-concept implementation. © Springer International Publishing Switzerland 2016.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 18