📖
Checking Component Composability
Christian Attiogbé, Pascal André, Gilles Ardourel

Checking Component Composability

Science & Mathematics Published 2006 Verification Pending

Overview & Synopsis

Component-Based Software Engineering (CBSE) is one of the approaches to master the development of large scale software. In this setting, the verification concern is still a challenge. The current work addresses the composability of components and their services. A component model (Kmelia) is introduced; an associated formalism, simple but expressive is introduced; it describes the services as extended LTSs and their structuring as components. The composability of components is defined on the basis of the composability of services. To ensure the correctness of component composition, we check that an assembly is possible via the checking of the composability of the linked services, and their behavioural compatibility. In order to mechanize our approach, the services and the components are translated into the \Lotos formalism. Finally the Lotos CADP toolbox is used to perform

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Checking Component Composability
Author / Organization Christian Attiogbé, Pascal André, Gilles Ardourel
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2006
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-193223
Original Source Link Visit Source Page on hal.science »