Jump label

Service navigation

Main navigation

You are here:

Main content


ArchiType is a type-based framework for software connector synthesis in distributed C&C-architectures, relying on a repository of connector building blocks. Using an extendable taxonomy of concepts which describe connectors, each building block has to be specified in the underlying type language. The framework is based on Microsoft™ F#/C# and is a plugin to Visual Studio 2012 Ultimate.

  • Building blocks and concepts for the following features for the Windows Communication Foundation (WCF) are currently supported:
    • Different communication systems (WS-SOAP, REST, Pipes, etc.)
    • Composable security model (Message security, authentication, etc.)
    • Transactions
    • Reliable messaging via message queue server (e.g. RabbitMQ)
    • Application caches (memcached, CouchDB, etc.)
    • Data services (OData, etc.)
  • Using type inhabitation, ArchiType synthesizes compositions of building blocks to satisfy a given goal specification of a desired connector. If several compositions satisfying the goal specification have been synthesized, ArchiType allows the architect (user) to choose an appropriate solution. From such compositions ArchiType generates suitable UML2-component diagrams describing the connectors. This synthesis and generation step may be initiated from whithin UML2-component diagrams in Visual Studio which are completed by the synthesized diagrams. Finally, ArchiType uses the completed UML2-component diagram to generate compilable code (e.g., C#, VB.Net, XML) for the synthesized connectors which can then be used to distribute the underlying C&C-architecture. The following screenshot depicts a generated UML2-component diagram describing a connector supporting transactions, Kerberos, and message security: UML Component Diagram
  • Publications (type theoretic foundation):
    • Peer-reviewed papers
      • Bounded Combinatory Logic (B. Düdder, M. Martens, J. Rehof, and P. Urzyczyn) in CSL Computer Science Logic, 2012.
      • Using Inhabitation in Bounded Combinatory Logic with Intersection Types for GUI Synthesis (B. Düdder, O.Garbe, M. Martens, J. Rehof, and P. Urzyczyn) in ITRS Intersection Types and Related Systems, 2012.
      • The Complexity of Inhabitation with Explicit Intersection (J. Rehof and P. Urzyczyn) in R.L. Constable and A. Silva (Eds.): Logic and Program Semantics. Essays Dedicated to Dexter Kozen. Lecture Notes in Computer Science 7230, 2012.
      • Finite Combinatory Logic with Intersection Types (J. Rehof and P. Urzyczyn) in TLCA 2011, Typed Lambda Calculi and Applications, Lecture Notes in Computer Science 6690.
    • Technical Reports
  • Contact