1 Search Results for "Gold, Nicolas"


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

Authors: Kiarash Mahdavi, Nicolas Gold, Zheng Li, and Mark Harman

Published in: Dagstuhl Seminar Proceedings, Volume 6301, Duplication, Redundancy, and Similarity in Software (2007)


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.

Cite as

Kiarash Mahdavi, Nicolas Gold, Zheng Li, and Mark Harman. Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding. In Duplication, Redundancy, and Similarity in Software. Dagstuhl Seminar Proceedings, Volume 6301, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06301.4},
  URN =		{urn:nbn:de:0030-drops-9616},
  doi =		{10.4230/DagSemProc.06301.4},
  annote =	{Keywords: Concept Assignment, Slicing, Clustering, Heuristic Algorithms}
}
  • Refine by Author
  • 1 Gold, Nicolas
  • 1 Harman, Mark
  • 1 Li, Zheng
  • 1 Mahdavi, Kiarash

  • Refine by Classification

  • Refine by Keyword
  • 1 Clustering
  • 1 Concept Assignment
  • 1 Heuristic Algorithms
  • 1 Slicing

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2007

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail