uu.seUppsala universitets publikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Typed Connector Families
INESC TEC, HASLab, Braga, Portugal.;Univ Minho, Braga, Portugal.;Katholieke Univ Leuven, Dept Comp Sci, IMinds DistriNet, Louvain, Belgium..
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
2016 (Engelska)Ingår i: Formal Aspects Of Component Software, Springer, 2016, s. 294-311Konferensbidrag, Publicerat paper (Refereegranskat)
Resurstyp
Text
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 component-based models. A type-checking algorithm based on constraints is used to analyse connector families, supported by a proof-of-concept implementation.

Ort, förlag, år, upplaga, sidor
Springer, 2016. s. 294-311
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9539
Nationell ämneskategori
Datorteknik
Identifikatorer
URN: urn:nbn:se:uu:diva-299662DOI: 10.1007/978-3-319-28934-2_16ISI: 000375378500016ISBN: 9783319289342; 9783319289335 (tryckt)OAI: oai:DiVA.org:uu-299662DiVA, id: diva2:949902
Konferens
12th International Conference on Formal Aspects of Component Software (FACS), OCT 14-16, 2015, Univ Fed Fluminense, Niteroi, BRAZIL
Tillgänglig från: 2016-07-25 Skapad: 2016-07-25 Senast uppdaterad: 2018-01-10Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Clarke, Dave

Sök vidare i DiVA

Av författaren/redaktören
Clarke, Dave
Av organisationen
Datalogi
Datorteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 197 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf