Detecting duplications in sequence diagrams based on suffix trees

Liu Hui, Ma Zhiyi, Zhang Lu, Shao Weizhong*

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

44 引用 (Scopus)

摘要

With the popularity of UML and MDA, models are replacing source code as core artifacts of software development and maintenance. But duplications in models reduce models' maintainability and reusability. To address the problem, we should detect duplications first. As an initial step to address the problem, we propose an approach to detect duplications in sequence diagrams. With special preprocessing, we convert 2-dimensional sequence diagrams into a 1-dimensional array. Then we construct a suffix tree of the array. We revise the traditional construction algorithm of suffix trees by proposing a special algorithm to detect common prefixes of suffixes. The algorithm ensures that every duplication detected with the suffix tree can be extracted into a separate reusable sequence diagram. With the suffix tree, duplications are found as refactoring candidates. With tool support, the proposed approach has been applied to real industrial projects, and the evaluation results suggest that the approach is effective.

源语言英语
主期刊名Proceedings - APSEC 2006
主期刊副标题Asia-Pacific Software Engineering Conference
269-276
页数8
DOI
出版状态已出版 - 2006
已对外发布
活动APSEC 2006: Asia-Pacific Software Engineering Conference - Bangalore, 印度
期限: 6 12月 20068 12月 2006

出版系列

姓名Proceedings - Asia-Pacific Software Engineering Conference, APSEC
ISSN(印刷版)1530-1362

会议

会议APSEC 2006: Asia-Pacific Software Engineering Conference
国家/地区印度
Bangalore
时期6/12/068/12/06

指纹

探究 'Detecting duplications in sequence diagrams based on suffix trees' 的科研主题。它们共同构成独一无二的指纹。

引用此