lnu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • 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.
Visa övriga samt affilieringar
2005 (Engelska)Ingår i: 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, s. 130-145Kapitel i bok, del av antologi (Övrigt vetenskapligt)
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.

Ort, förlag, år, upplaga, sidor
Springer, 2005. Vol. 3527, s. 130-145
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3527
Nationell ämneskategori
Data- och informationsvetenskap Programvaruteknik
Forskningsämne
Datavetenskap, Programvaruteknik
Identifikatorer
URN: urn:nbn:se:lnu:diva-40939DOI: 10.1007/11494713_9ISBN: 978-3-540-26275-6 (tryckt)OAI: oai:DiVA.org:lnu-40939DiVA, id: diva2:795984
Tillgänglig från: 2015-03-17 Skapad: 2015-03-17 Senast uppdaterad: 2018-01-11Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Caporuscio, Mauro

Sök vidare i DiVA

Av författaren/redaktören
Caporuscio, Mauro
Data- och informationsvetenskapProgramvaruteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 79 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf