Automated resolution of connector architectures using constraint solving (ARCAS method)

Abstract:

In current software systems, connectors play an important role by encapsulating the communication and coordination logic. Since they share common patterns (elements) depending on characteristics of the connections, the elements can be predefined and reused. A method of connector implementation based on a composition of predefined elements naturally comprises two steps: resolution of the connector architecture, and creation of the actual connector code based on the architecture. However, manual resolution of a connector architecture is very difficult due to the number of factors to be considered. Thus, the challenge is to come up with an automated method, able to address all the important factors. In this paper, we present a method for automated resolution of connector architectures based on constraint solving techniques. We exploit a propositional logic with relational calculus for defining a connector theory, a constraint specification reflecting both the predefined parts and the important resolution factors, and employ a constraint solver to find a suitable connector architecture as a model of the theory. As a proof of the concept, we show how the theory can be captured in the Alloy language and resolved via the Alloy Analyzer.

BibTeX:

@article{keznikl_automated_2014,
    title = {{Automated resolution of connector architectures using constraint solving (ARCAS method)}},
    author = {Keznikl, Jaroslav and Bureš, Tomáš and Plášil, František and Hně tynka, Petr},
    year = {2014},
    journal = {{Software \& Systems Modeling}},
    number = {2},
    doi = {10.1007/s10270-012-0274-8},
    issn = {1619-1374},
    pages = {843--872},
    url = {https://doi.org/10.1007/s10270-012-0274-8},
    volume = {13},
}

Journal article