earticle

논문검색

Design Patterns Mining using Subgraph somorphism : Relational View

초록

영어

Design Pattern Detection is a part of many solutions to Software Engineering difficulties. The usage of design patterns leads to benefits for new and young developers by enabling them to reuse the knowledge of their experienced colleagues. Mining of design pattern instances is important for program understanding and software maintenance. Hence a reliable design pattern mining is required. Here we are using the relational view of subgraph isomorphism to detect design patterns in the source code.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Representation of System Design and Design Patterns
 4. Relational View of Subgraph Isomorphism
  4.1. Design Pattern Detection as Façade Design Pattern (Full Match)
  4.2. Design Pattern Detection as Composite Design Pattern (Partial Match)
  4.3 Particular Design Pattern may or may not exist
 9. Conclusion
 References

저자정보

  • Manjari Gupta DST- Centre for Interdisciplinary Mathematical Sciences Department of Computer Science, Banaras Hindu University
  • Akshara Pande DST- Centre for Interdisciplinary Mathematical Sciences Department of Computer Science, Banaras Hindu University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.