lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Engineering MDA into Compositional Reasoning for Analyzing Middleware-Based Applications
Università degli Studi di L’Aquila, Italy.ORCID iD: 0000-0001-6981-0966
Università degli Studi di L’Aquila, Italy.
Università degli Studi di L’Aquila, Italy.
Università degli Studi di L’Aquila, Italy.
Show others and affiliations
2005 (English)In: Software Architecture: Proceedings of the 2nd European Workshop, EWSA 2005, Pisa, Italy, June 13-14, 2005. / [ed] Morrison, Ron; Oquendo, Flavio, Springer, 2005, Vol. 3527, 130-145 p.Chapter in book (Other academic)
Abstract [en]

Behavioral analysis of middleware-based applications typically requires the analysis of the middleware and the application, in a monolithic way. In terms of model-checking, this is a complex task and may result in the well known “state-explosion” problem. These considerations led us to investigate a compositional verification approach which decomposes the system in accordance with its Software Architecture. The architectural decomposability theorem we defined in previous work decomposes the system into three logical layer: (i) application components, (ii) proxies and, (iii)middleware. This logical separation allows for reducing the global system validation to the verification of local behaviors.

In this paper, we engineer the architectural decomposability theorem to the analysis of middleware-based applications by automatically generating the proxies needed by the components in order to properly interact with each other via the middleware. In particular, following the Model Driven Architecture approach and by making use of the Abstract State Machine formalism, we describe a set of transformation rules that allow for deriving correct proxies for using CORBA. By means of the proposed transformations, the correctness of the proxy behavioral models is guaranteed without the need to validate them with respect to the assumptions posed by the theorem.

Place, publisher, year, edition, pages
Springer, 2005. Vol. 3527, 130-145 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3527
National Category
Computer and Information Science Software Engineering
Research subject
Computer Science, Software Technology
Identifiers
URN: urn:nbn:se:lnu:diva-40939DOI: 10.1007/11494713_9ISBN: 978-3-540-26275-6 (print)OAI: oai:DiVA.org:lnu-40939DiVA: diva2:795984
Available from: 2015-03-17 Created: 2015-03-17 Last updated: 2015-03-19Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Caporuscio, Mauro
Computer and Information ScienceSoftware Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf