License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06301.4
URN: urn:nbn:de:0030-drops-9616
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2007/961/
Go to the corresponding Portal

Mahdavi, Kiarash ; Gold, Nicolas ; Li, Zheng ; Harman, Mark

Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding

pdf-format:
06301.MahdaviKiarash.Paper.961.pdf (0.3 MB)

Abstract

One approach to supporting program comprehension involves
binding concepts to source code. Previously proposed
approaches to concept binding have enforced nonoverlapping
boundaries. However, real-world programs
may contain overlapping concepts. This paper presents
techniques to allow boundary overlap in the binding of
concepts to source code. In order to allow boundaries to
overlap, the concept binding problem is reformulated as a
search problem.
It is shown that the search space of overlapping concept
bindings is exponentially large, indicating the suitability of
sampling-based search algorithms. Hill climbing and genetic
algorithms are introduced for sampling the space. The
paper reports on experiments that apply these algorithms to
21 COBOL II programs taken from the commercial financial
services sector. The results show that the genetic algorithm
produces significantly better solutions than both the
hill climber and random search.

BibTeX - Entry

@InProceedings{mahdavi_et_al:DagSemProc.06301.4,
  author =	{Mahdavi, Kiarash and Gold, Nicolas and Li, Zheng and Harman, Mark},
  title =	{{Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding}},
  booktitle =	{Duplication, Redundancy, and Similarity in Software},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6301},
  editor =	{Rainer Koschke and Ettore Merlo and Andrew Walenstein},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/961},
  URN =		{urn:nbn:de:0030-drops-9616},
  doi =		{10.4230/DagSemProc.06301.4},
  annote =	{Keywords: Concept Assignment, Slicing, Clustering, Heuristic Algorithms}
}

Keywords: Concept Assignment, Slicing, Clustering, Heuristic Algorithms
Collection: 06301 - Duplication, Redundancy, and Similarity in Software
Issue Date: 2007
Date of publication: 19.04.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI