@INPROCEEDINGS{Kaczor06-CSMR-EfficientIdentification,
   AUTHOR       = {Olivier Kaczor and Yann-Ga�l Gu�h�neuc and Sylvie Hamel},
   BOOKTITLE    = {Proceedings of the 10<sup>th</sup> Conference on Software Maintenance and Reengineering (CSMR)},
   TITLE        = {Efficient Identification of Design Patterns with 
      Bit-vector Algorithm},
   YEAR         = {2006},
   OPTADDRESS   = {},
   OPTCROSSREF  = {},
   EDITOR       = {di Lucca, Giuseppe Antonio and Nicolas Gold},
   MONTH        = {March},
   NOTE         = {10 pages.},
   OPTNUMBER    = {},
   OPTORGANIZATION = {},
   PAGES        = {173--182},
   PUBLISHER    = {IEEE CS Press},
   OPTSERIES    = {},
   OPTVOLUME    = {},
   KEYWORDS     = {Topic: <b>Design patterns</b>, Venue: <c>CSMR</c>},
   URL          = {http://www.ptidej.net/publications/documents/CSMR06a.doc.pdf},
   PDF          = {http://www.ptidej.net/publications/documents/CSMR06a.ppt.pdf},
   ABSTRACT     = {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{}, \ygg@product{Juzzle}, and 
      \ygg@product{QuickUML}, with the \ygg@pattern{Abstract Factory} and 
      \ygg@pattern{Composite} design patterns and compare its performance 
      and results with two existing constraint-based approaches.}
}

{"_id":"RHzQe25tamMmApo7i","bibbaseid":"kaczor-guhneuc-hamel-efficientidentificationofdesignpatternswithbitvectoralgorithm-2006","downloads":0,"creationDate":"2018-01-17T20:29:42.563Z","title":"Efficient Identification of Design Patterns with Bit-vector Algorithm","author_short":["Kaczor, O.","Gu�h�neuc, Y.","Hamel, S."],"year":2006,"bibtype":"inproceedings","biburl":"http://www.yann-gael.gueheneuc.net/Work/Publications/Biblio/complete-bibliography.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Olivier"],"propositions":[],"lastnames":["Kaczor"],"suffixes":[]},{"firstnames":["Yann-Ga�l"],"propositions":[],"lastnames":["Gu�h�neuc"],"suffixes":[]},{"firstnames":["Sylvie"],"propositions":[],"lastnames":["Hamel"],"suffixes":[]}],"booktitle":"Proceedings of the 10^th Conference on Software Maintenance and Reengineering (CSMR)","title":"Efficient Identification of Design Patterns with Bit-vector Algorithm","year":"2006","optaddress":"","optcrossref":"","editor":[{"propositions":["di"],"lastnames":["Lucca"],"firstnames":["Giuseppe","Antonio"],"suffixes":[]},{"firstnames":["Nicolas"],"propositions":[],"lastnames":["Gold"],"suffixes":[]}],"month":"March","note":"10 pages.","optnumber":"","optorganization":"","pages":"173–182","publisher":"IEEE CS Press","optseries":"","optvolume":"","keywords":"Topic: <b>Design patterns</b>, Venue: <c>CSMR</c>","url":"http://www.ptidej.net/publications/documents/CSMR06a.doc.pdf","pdf":"http://www.ptidej.net/publications/documents/CSMR06a.ppt.pdf","abstract":"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, \\ygg@productJuzzle, and \\ygg@productQuickUML, with the \\ygg@patternAbstract Factory and \\ygg@patternComposite design patterns and compare its performance and results with two existing constraint-based approaches.","bibtex":"@INPROCEEDINGS{Kaczor06-CSMR-EfficientIdentification,\r\n AUTHOR = {Olivier Kaczor and Yann-Ga�l Gu�h�neuc and Sylvie Hamel},\r\n BOOKTITLE = {Proceedings of the 10^th Conference on Software Maintenance and Reengineering (CSMR)},\r\n TITLE = {Efficient Identification of Design Patterns with \r\n Bit-vector Algorithm},\r\n YEAR = {2006},\r\n OPTADDRESS = {},\r\n OPTCROSSREF = {},\r\n EDITOR = {di Lucca, Giuseppe Antonio and Nicolas Gold},\r\n MONTH = {March},\r\n NOTE = {10 pages.},\r\n OPTNUMBER = {},\r\n OPTORGANIZATION = {},\r\n PAGES = {173--182},\r\n PUBLISHER = {IEEE CS Press},\r\n OPTSERIES = {},\r\n OPTVOLUME = {},\r\n KEYWORDS = {Topic: <b>Design patterns</b>, Venue: <c>CSMR</c>},\r\n URL = {http://www.ptidej.net/publications/documents/CSMR06a.doc.pdf},\r\n PDF = {http://www.ptidej.net/publications/documents/CSMR06a.ppt.pdf},\r\n ABSTRACT = {Design patterns are important in software maintenance \r\n because they help in designing, in understanding, and in \r\n re-engineering programs. The identification of occurrences of a \r\n design pattern consists in identifying, in a program, classes which \r\n structure and organisation match---strictly or approximately---the \r\n structure and organisation of classes as suggested by the design \r\n pattern. We express the problem of design pattern identification with \r\n operations on finite sets of bit-vectors. We use the inherent \r\n parallelism of bit-wise operations to derive an efficient bit-vector \r\n algorithm that finds exact and approximate occurrences of design \r\n patterns in a program. We apply our algorithm on three \r\n small-to-medium size programs, \\JHotDraw{}, \\ygg@product{Juzzle}, and \r\n \\ygg@product{QuickUML}, with the \\ygg@pattern{Abstract Factory} and \r\n \\ygg@pattern{Composite} design patterns and compare its performance \r\n and results with two existing constraint-based approaches.}\r\n}\r\n\r\n","author_short":["Kaczor, O.","Gu�h�neuc, Y.","Hamel, S."],"editor_short":["di Lucca, G. A.","Gold, N."],"key":"Kaczor06-CSMR-EfficientIdentification","id":"Kaczor06-CSMR-EfficientIdentification","bibbaseid":"kaczor-guhneuc-hamel-efficientidentificationofdesignpatternswithbitvectoralgorithm-2006","role":"author","urls":{"Paper":"http://www.ptidej.net/publications/documents/CSMR06a.doc.pdf"},"keyword":["Topic: <b>Design patterns</b>","Venue: <c>CSMR</c>"],"metadata":{"authorlinks":{"gu�h�neuc, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.yann-gael.gueheneuc.net%2FWork%2FPublications%2FBiblio%2Fcomplete-bibliography.bib&msg=embed","guéhéneuc, y":"http://www.yann-gael.gueheneuc.net/"}}},"search_terms":["efficient","identification","design","patterns","bit","vector","algorithm","kaczor","gu�h�neuc","hamel"],"keywords":["topic: <b>design patterns</b>","venue: <c>csmr</c>"],"authorIDs":["AfJhKcg96muyPdu7S","xkviMnkrGBneANvMr"],"dataSources":["Sed98LbBeGaXxenrM","8vn5MSGYWB4fAx9Z4"]}