A strategy for the formal composition of frameworks

Mesquita, W.; Sampaio, Augusto; Melo, Ana Duarte

doi:10.1109/sefm.2005.5

Cited by 5 publications

(19 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Overall, as well as other authors [18,11,27], we have identified the need to evaluate to what extent a final implementation satisfies the initial coordination purpose. In order to accomplish this, we introduce conformance notions that allow us to guarantee these properties both at the coordination design level and in its final implementation.…”

Section: Motivating Example: Coordination Patternsmentioning

confidence: 89%

“…By taking the decision of accepting one and refusing the other, this process might present communication problems after the request for validation. This is a common integration problem [27], called communication deadlock. A solution is to use a more deterministic process CLIENT (such that CLIENT F ⊥ CLIENT ) defined below.…”

Section: Substitutabilitymentioning

confidence: 99%

“…Before applying conformance notions on component coordination, we briefly present a composition strategy we developed in an earlier work [27], which aims to overcome some typical problems during framework integration presented in [6]. Such problems arise when frameworks need to be assembled with each other and with legacy components [45].…”

Section: Application: Formal Framework Compositionmentioning

confidence: 99%

See 2 more Smart Citations

Conformance notions for the coordination of interaction components

Ramos

Sampaio

Mota

2010

Science of Computer Programming

View full text Add to dashboard Cite

a b s t r a c tIn component-based development, software components are taken as units of composition. Nevertheless, to achieve the widely disseminated status of components being plugged together as simple 'Lego Pieces', the integration of components must be carefully designed, systematised and verified; only this can ensure reliable architectures. In this work, we propose some conformance notions to predict the precise nature of some forms of composition, considering coordination patterns used in the integration. These notions are formalised in terms of the denotational semantics of the process algebra CSP, and assist the designer in common activities during integration, such as the substitution of component specifications by implementations, contract adaptations, and system extensions. To support mechanical verifications using FDR (a model-checker for CSP), we derive test characterisations from the denotational definitions of conformance. We illustrate the application of these notions through a systematic composition strategy of software frameworks, and we mechanically verify the preservation of behavioural component properties in these compositions. Moreover, we characterise the well-formedness of a coordination pattern used in this strategy at the design stage, before components are assembled.

show abstract

Section: Motivating Example: Coordination Patternsmentioning

confidence: 89%

Section: Substitutabilitymentioning

confidence: 99%

Section: Application: Formal Framework Compositionmentioning

confidence: 99%

See 1 more Smart Citation

Conformance notions for the coordination of interaction components

Ramos

Sampaio

Mota

2010

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…The last line of Figure 12 captures the assertion that View 1 mapped is refined by View 2 in the failures-divergence model. This mapping strategy is based on a framework composition technique [11]. Here we focus on relating events from different models, while the framework composition strategy aims to accomplish communication between frameworks possibly with different alphabets.…”

Section: Refinement Mappingmentioning

confidence: 99%

Formal Specification Generation from Requirement Documents

Cabral

Sampaio

2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Automatic generation of formal specifications from requirement reduces cost and complexity of formal models creation. Thus, the generated formal model brings the possibility to carry out system property verification. This paper proposes a Controlled Natural Language (CNL, a subset of English), use case specification templates, and a strategy and tool support to generate process algebraic formal models (in CSP notation) from use cases specified using the templates and CNL. We define templates that represent requirement at different levels of abstraction. Moreover, a refinement notion is defined based on events mapping between abstract and concrete models.

show abstract

“…The last line of Figure 12 captures the assertion that View 1 mapped is refined by View 2 in the failuresdivergence model. This mapping strategy is based on a framework composition technique [30]. Here we focus on relating events from different models for refinement purpose, while the framework composition strategy aims to accomplish communication between frameworks possibly with different alphabets.…”

Section: Refinement Mappingmentioning

confidence: 99%