Paper Info
Title
Static verification of component composition in contextual composition frameworks
Abstract
Contextual component frameworks, such as Enterprise JavaBeans (EJB), allow for components to specify boundary conditions for the runtime context. These conditions are satisfied at runtime by services of the underlying platform, thus ensuring that the context in which components run exhibits properties that allow them to operate correctly. Depending on how components call each other, it is possible that satisfying such conditions lead to problems such as reduced performance due to redundant service execution, or permanent errors (composition mismatches), due to incompatible boundary conditions. Currently, the semantics of these boundary conditions are expressed in natural language only, making it impossible to incorporate them into an automatic analysis tool. Furthermore, early understanding of how components call each other would be necessary, but it is currently difficult to achieve by means of a tool, as the method dispatch rules in a component system differ from the dispatch rules of the programming language(s) in which they were developed. We have developed a metamodel, $${\mathbb{M}}$$, for describing boundary conditions, an analysis method, $${\mathbb{A}}$$, and a static component-level call graph extraction method for EJB applications, CHA EJB . $${\mathbb{A}}$$ uses $${\mathbb{M}}$$ models to analyze inter-component call graphs, and thus detect problems such as composition mismatches or redundancies, thus allowing for remedial action to take place. We present $${\mathbb{M}},{\mathbb{A}}$$ and CHA EJB in this article, show that $${\mathbb{A}}$$ produces correct results, and describe a prototype analysis tool implementing the three, which we used to validate our approach on two popular EJB applications.
Year
DOI
Venue
2008
10.1007/s10009-007-0061-y
STTT
Keywords
Field
DocType
popular ejb application,boundary condition,static verification,analysis method,component composition,automatic analysis tool,incompatible boundary condition,inter-component call graph,contextual composition framework,ejb application,static analysis,enterprise java,software components,composition mismatches,contextual com- position,cha ejb,static component-level call graph,programming language,satisfiability,call graph,natural language,software component
Graph theory,Boundary value problem,Multigraph,Tree (graph theory),Computer science,Static analysis,Theoretical computer science,Call graph,Enterprise JavaBeans,Component-based software engineering
Journal
Volume
Issue
ISSN
10
3
1433-2787
Citations 
PageRank 
References 
4
0.49
13
Authors
2
Name
Order
Citations
PageRank
Mircea Trofin1152.42
John Murphy27510.07