Efficient Identification of Design Patterns with Bit-vector Algorithm
摘要:
Design patterns are important in software maintenance because they help in designing, in understanding, and in re-engineering programs. The identification of occurrences of a design pattern consists in identifying, in a program, classes which structure and organisation match - strictly or approximately - the structure and organisation of classes as suggested by the design pattern. We express the problem of design pattern identification with operations on finite sets of bit-vectors. We use the inherent parallelism of bit-wise operations to derive an efficient bit-vector algorithm that finds exact and approximate occurrences of design patterns in a program. We apply our algorithm on three small-to-medium size programs, JHotDraw, Juzzle, and QuickUML, with the Abstract Factory and Composite design patterns and compare its performance and results with two existing constraint-based approaches
展开
关键词:
constraint handling object-oriented programming reverse engineering software maintenance systems re-engineering Abstract Factory design pattern Composite design pattern JHotDraw Juzzle QuickUML
会议名称:
European Conference on Software Maintenance & Reengineering
会议时间:
22-24 March 2006
被引量:

































通过文献互助平台发起求助,成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用!