UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at https://www.ucl.ac.uk/finance/research/rs-contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding.
  • Publication Type:
    Conference
  • Authors:
    Mahdavi K, Gold N, Li Z, Harman M
  • Publisher:
    Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany
  • Publication date:
    19/04/2007
  • Published proceedings:
    Duplication, Redundancy, and Similarity in Software
  • Volume:
    06301
  • Series:
    Dagstuhl Seminar Proceedings
  • Editors:
    Koschke R,Merlo E,Walenstein A
  • Name of conference:
    Duplication, Redundancy, and Similarity in Software
  • Conference start date:
    23/07/2006
  • Conference finish date:
    26/07/2006
  • Print ISSN:
    1862-4405
  • Keywords:
    Concept Assignment, Slicing, Clustering, Heuristic Algorithms
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.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by