<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-20T07:31:52Z</responseDate>
  <request identifier="967" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:967</identifier>
        <datestamp>2024-03-06T11:07:00Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Managing Known Clones:  Issues and Open Questions</dc:title>
          <dc:creator>Kontogiannis, Kostas</dc:creator>
          <dc:subject>Code clone</dc:subject>
          <dc:subject>software evolution</dc:subject>
          <dc:subject>change management</dc:subject>
          <dc:subject>code visualization</dc:subject>
          <dc:subject>redundancy</dc:subject>
          <dc:subject>metamodels</dc:subject>
          <dc:subject>software management environments</dc:subject>
          <dc:description>Many software systems contained cloned code, i.e., segments of code that&#13;
are highly similar to each other, typically because one has been copied&#13;
from the other, and then possibly modified.  In some contexts, clones are&#13;
of interest because they are targets for refactoring.  This paper&#13;
summarizes the results of a working session in which the problems of merely&#13;
managing clones that are already known to exist.  Six key issues in the&#13;
space are briefly reviewed, and open questions raised in the working&#13;
session are listed.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Kostas Kontogiannis</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6301, Duplication, Redundancy, and Similarity in Software (2007)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.06301.9</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-9679</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06301.9</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
