Citations: Substring matching for clone detection and change tracking

20 citations found. Retrieving documents...

J. H. Johnson, "Substring Matching for Clone Detection and Change Tracking", Proceedings of the International Conference on Software Maintenance (ICSM), pages 120 - 126, 1994.

Home/Search Document Details and Download Summary Related Articles Check

This paper is cited in the following contexts:

Detecting Merging and Splitting Using Origin Analysis - Zou, Godfrey (2003) (Correct)

....the system version in the Beagle repository. 3.1.4 Visualization Beagle supports a variety of visualization tools for browsing the evolutionary history of a software system [12] Among these is a scatter plot viewer, as shown in Figure 8. Scatter plots are well known in clone detection research [2, 6, 9]; the basic idea is that entities of interest (say functions or even lines of code) are lined up along the X and Y axes, and dots or coloured marks are used to indicate the presence of an interesting property (or hit ) usually that there is a nontrivial similarity between two entities. In ....

J. H. Johnson. Substring matching for clone detection and change tracking. In Proc. of the 1994.

Using Textual Redundancy to Understand Change - Johnson (1995) (Correct)

....to the compiler based approaches. Although not a replacement for these approaches, it provides information that is very difficult to obtain using them. This information is useful, in particular, for identifying software clones and understanding how software changes between releases [6,7,8]. As a result of maintenance activity, legacy systems contain repeated text in the form of large and small blocks that appear in more or less the same form in several places. These repetitions define a structure that can contribute information about the development history of the source different ....

....ways. One focus of this paper is a form of analysis referred to as components of redundancy , which that allocates the raw match size to nodes in a conceptual directory structure that corresponds to the users organization of the system complementing the clustering approach described earlier [7,8], which synthesized clusters from raw match data. One conclusion to be drawn from the work described below is that both methods have their strengths but what is really needed is a combination of the two. This will be a focus of future work. A second focus is that this technology can be applied ....

[Article contains additional citation context not shown here]

J. H. Johnson, "Substring Matching for Clone Detection and Change Tracking", Proceedings of the 1994.

Identification of High-Level Concept Clones in Source Code - Marcus, Maletic (2001) (2 citations) (Correct)

....for the English language must be developed. 3. Identifying high level concept clones The method we propose for identifying high level concept clones is based on the semantic similarity measure between source code documents described earlier. These similarity measures are akin to the work by [16, 22, 38]. They compute the similarity between software elements based on structural information, with the purpose of identifying high level concepts in code. In its current form, the approach is an automated assistant to the developer in the identification of clones. To fully automate the process there ....

Johnson, H. J., "Substring matching for clone detection and change tracking", in Proceedings of International Conference on Software Maintenance, 1994, pp. 120-126.

Visualizing Textual Redundancy in Legacy Source - Johnson (1994) (3 citations) (Correct)

....inaccessible to the compiler based approaches. Although not a replacement for these approaches, it provides information that is very difficult to obtain using them. This information is useful, in particular, for identifying software clones and understanding how software changes between releases [6,7]. Section 2 describes the technology used to study textual matches. Following this in Section 3 is an example of this approach that demonstrates its utility. Finally, conclusions and current research directions are outlined in Section 4. 2 Substring Matching in Large Bodies of Source The ....

....information collecting phases, 4) is an information preserving transformation, 5) an aggregation and simplification phase, and (6) the presentation of results in a useful form. Phase (1) provides greater sensitivity for particular types of input. Details of this approach are discussed elsewhere [6,7]. The work presented here focuses on the analysis of complex clusters of files that have been brought together as a result of text matches. Hasse diagrams are used to support the visualization of these complex clusters. 2.1 Calculation and Presentation of Hasse Diagrams A Hasse diagram is a ....

[Article contains additional citation context not shown here]

J. Howard Johnson, "Substring Matching for Clone Detection and Change Tracking", Proceedings of the 1994.

....performance. There are other tools for finding similarities in text or source code, as well. However, tools based on style metrics, such as [7, 19, 25] or data flow graphs [17] would require decompilation of bytecode files in order to be applied. Some other tools based on fingerprints, such as [16, 20, 10], chunks of text [9, 30, 34] or visualization via a graphical user interface [11] may be adaptable to byte code files using the same techniques that we use for siff, dup, and diff. To search for similar files in a large set of bytecode files, we run siff on the encoded disassembled bytecode ....

J. Howard Johnson. Substring matching for clone detection and change tracking. In Proc. International Conf. on Software Maintenance, pages 120--126, 1994.

A Language Independent Approach for Detecting Duplicated Code - Ducasse, Rieger, Demeyer (1999) (26 citations) (Correct)

....ranging from 256 K up to 13Mb of source code size. Keywords: Software maintenance, code duplication detection, code visualization 1. Code Duplication Detection Duplicated code is a phenomenon that occurs frequently in large systems. The reasons why programmers duplicate code are manifold (see [9, 2] for a thorough discussion) and include the following reasons: a) Making a copy of a code fragment is simpler and faster than writing the code from scratch. In addition, the fragment may already be tested so the introduction of a bug seems less likely. b) Evaluating the performance of a ....

....or missing procedural abstraction. In turn, such a lack of abstraction hampers the addition of functionality. Techniques and tools for detecting duplicated code are thus a highly desired commodity especially in the software maintenance community and research has proposed a number of approaches ([1, 9, 14, 10, 2]) with promising results. However, the application of these techniques in an industrial context is hindered by one major obstacle: the need for parsing. This is clearly stated in the following quote: Parsing the program suite of interest requires a parser for the language dialect of interest. ....

[Article contains additional citation context not shown here]

J. H. Johnson. Substring Matching for Clone Detection and Change Tracking. In Proceedings of the International Conference on Software Maintence (ICSM), pages 120--126, 1994.

Change and Adaptive Maintenance Detection in Java.. - Rayside, Kerr.. (1998) (8 citations) (Correct)

....a system (SCRUPLE) in which regular expressions are used to locate programming patterns in a large software system. Pattern matching is performed by testing if a code fragment is accepted by the automaton that is constructed by a regular expression provided by the user, as a query. Johnson, [Johnson94] uses a similar text based approach where fingerprints in source files are computed using a hashing mechanism. Fingerprints are compared to identify an overall similarity between two texts. In [Jankowitz88] McCabe90] Konto97] statistical measurements and software metrics are applied in order ....

Johnson, H., "Substring Matching for Clone Detection and Change Tracking", International Conference on Software Maintenance 1994, Victoria BC, 21-23 September, 1994, pp.120-126.

Code Migration Through Transformations: An Experience.. - Kontogiannis, Martin.. (1998) (6 citations) (Correct)

....uses parameterized pattern matching techniques based on a variation of the Boyer Moore algorithm to identify duplication within a string. Paul ( Paul94] proposes a system (SCRUPLE) in which regular expressions are used to locate programming patterns in a large software system. Likewise, Johnson ([Johnson94]) identifies text level patterns in source code by computing fingerprints using a hashing mechanism. These are then compared to identify similarities between two texts corresponding to code fragments. Finally, other approaches, originally developed for the area of syntax based editing, include ....

Johnson, H., "Substring Matching for Clon e Detection and Change Tracking", International

Investigating the Maintenance Implications of the Replication of .. - Burd, al. (1997) (Correct)

....will investigate instances of replicated code within programs and across program suites. The maintenance implications of code replication will be reviewed and the examples will be analysed to investigate their potential as reuse candidates. Similar work in this area has been approached by Johnson [3]. 2. The Scenario The work described within this paper was carried out as an extension to the IDENT project. The IDENT project is based on existing work being carried out at Durham on the RE 2 [5, 6, 7, 8] project and the RECAST (Reverse Engineering into CASE Technology) project [9, 10] The ....

Johnson J,H., 'Substring MAtching for Clone Detection and Change Tracking', Proceedings of the Internation Conference on Software Maintenance', IEEE Press, 1996

On Finding Duplication and Near-Duplication in Large Software.. - Baker (1995) (51 citations) (Correct)

....for maintenance and reengineering of large systems. Other researchers have taken different approaches to finding commonality in code. These approaches have included finding common style or complexity measures [5, 8, 14, 12] common parse trees [10] common data flow [1, 7] fingerprints for files [9, 13], the UNIX diff command [11] data compression [17, 19] and graphical user interfaces (GUIs) 6] These methods have been deficient for various reasons. Approaches based on common style or complexity characteristics have no guarantees about exactly how the code is related. The parse tree method ....

J. Howard Johnson. Substring matching for clone detection and change tracking. In Proc. International Conf. on Software Maintenance, pages 120--126, 1994.

Architecture, Evolution, and Cloning of Linux Device Drivers: - Case Study Davor (Correct)

No context found.

J. H. Johnson, "Substring Matching for Clone Detection and Change Tracking", Proceedings of the International Conference on Software Maintenance (ICSM), pages 120 - 126, 1994.

Journal Of Software Maintenance And Evolution: Research And.. - Softw Maint Evol (Correct)

No context found.

Johnson J H. Substring matching for clone detection and change tracking. Proceedings of the International Conference on Software Maintanence, Sept. 1994. IEEE Computer Society: Victoria, BC, Canada, 1994; 120--126.

Clone Detection: How accurate is your data set? - Cory Kapser And (Correct)