Time: 10:00-12:00, April 1st, 2009
Place: Seminar Room 1 (2006), 20F, National Institute of Informatics
(map)
Fee: Free
You need to register your name, affiliation and e-mail address in
advance. Please send a mail titled “18th Grace Seminar” including
the information to event-info@grace-center.jp.
Details:
Title: Celadon: A Framework and Tool Support for Change Impact Analysis of
Aspect-Oriented Programs
Speaker: Jianjun Zhao, Shanghai Jiao Tong University
Abstract:
Change impact analysis is a useful technique for software evolution.
It determines the effects of a source editing session and provides valuable feedbacks to the programmers for making correct decisions. Recently, many techniques have been proposed to support change impact analysis of procedural or object-oriented software, but seldom effort has been made for aspect-oriented software. In this talk, we propose a new change impact analysis technique for AspectJ programs.
At the core of our approach is the atomic change representation which can precisely capture semantic ifferences between two versions of an AspectJ program. We also present a change impact analysis model, based on static AsepctJ call graph construction, to determine the impacted program parts, affected tests and their responsible affecting changes. The proposed techniques
have been implemented in Celadon, a change impact analysis framework for Aspect J programs.
We also integrate automated debugging support and call graph incremental reanalysis technique into Celadon. To evaluate the effectiveness and efficiency
of our proposed techniques, we performed an experimental evaluation on 24 versions of 8 AspectJ benchmarks. The results show that our proposed technique can effectively perform change impact analysis, reduce the automated
debugging and call graph analysis overhead significantly.
—————————————————————–
Title: Beanbag: Facilitating Model Inconsistency Fixing
Speaker: Yingfei Xiong, University of Tokyo
Abstract:
Modern development environments often involve models with complex
consistency relations. Some of the relations can be automatically
established through “fixing procedures”. When users update some parts
of the model and cause inconsistency, a fixing procedure dynamically propagates the update to other parts to fix the inconsistency.
Currently, fixing procedures are manually implemented, which requires a lot
of efforts and the correctness of a fixing procedure is not guaranteed.
In this talk I will introduce Beanbag, a new language to support the
development of fixing procedures. A Beanbag program defines a consistency
relation in OCL-like syntax, but the program can be executed in two modes.
The checking mode checks whether a model satisfies the relation. The fixing
mode takes user updates on the model and produces new updates to make the
model satisfy the consistency relation. In this way Beanbag significantly
eases the development of fixing procedures. In addition, a Beanbag program
is also guaranteed to be correct with respect to three correctness
properties we define.
