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

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10124724" target="_blank" >RIV/00216208:11320/14:10124724 - isvavai.cz</a>

Výsledek na webu

<a href="http://link.springer.com/article/10.1007%2Fs10270-012-0274-8" target="_blank" >http://link.springer.com/article/10.1007%2Fs10270-012-0274-8</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10270-012-0274-8" target="_blank" >10.1007/s10270-012-0274-8</a>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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 amethod 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 showhowthe theory can be captured in the Alloy language and resolved via the Alloy Analyzer.

Název v anglickém jazyce

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

Popis výsledku anglicky

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 amethod 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 showhowthe theory can be captured in the Alloy language and resolved via the Alloy Analyzer.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Software and Systems Modeling

ISSN

1619-1366

e-ISSN

—

Svazek periodika

13

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

30

Strana od-do

843-872

Kód UT WoS článku

000335236300019

EID výsledku v databázi Scopus

—