Reverse engineering of sequence diagrams by merging call trees

초록

A software system is continuously changing even after development. Thus, most of documents which are written at the end of development phase cannot reflect the current software system. It is a very tedious work for maintainers to understand how the software is implemented by reviewing source code. So, several reverse engineering techniques and tools have been introduced to generate sequence diagrams from source code or behaviors of the software at runtime. However, the legacy techniques have limits not to provide sufficient coverage and readability with the generated sequence diagrams. We propose a method to merge call trees from static and dynamic analysis results to enhance the coverage of reversed sequence diagrams. This paper introduces five rules for merging call trees. The evaluation result explains how our rules effectively generate compact and understandable sequence diagrams without any loss of control flows which are implemented in source code. © © 2013 by Knowledge Systems Institute Graduate School.

키워드