Static Detection of Design Patterns in Class Diagrams

Abstract

Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement: https://www.ou.nl/taverne-agreement

Detecting Design Patterns As Described By An Explicit Specification (S)

“…The earlier detection tool utilized exact subgraph matching and relied solely on the names of the participating classes and their relationships. Consequently, it could only detect design patterns that were entirely defined by these elements, providing static decidability [3]. For instance, the Adapter pattern could be detected using this algorithm as it was defined entirely by the names of its participating classes and their relationships.…”

“…The Java sources are parsed by a parser generated by cup 2 because of the produced parser's speed [11], and the availability of a grammar of Java 3 . The Java parser generates information about the classes, interfaces, and their relationships.…”