Identifying Similar Code with Program Dependence Graphs

@inproceedings{Krinke2001IdentifyingSC,
  title={Identifying Similar Code with Program Dependence Graphs},
  author={Jens Krinke},
  booktitle={WCRE},
  year={2001}
}
We present an approach to identify similar code in programs based on finding similar subgraphs in attributed directed graphs. This approach is used on program dependence graphs and therefore considers not only the syntactic structure of programs but also the data flow within (as an abstraction of the semantics). As a result, there is no tradeoff between precision and recall—our approach is very good in both. An evaluation of our prototype implementation shows that our approach is feasible and… CONTINUE READING
Highly Influential
This paper has highly influenced 33 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 589 citations. REVIEW CITATIONS
397 Citations
20 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 397 extracted citations

589 Citations

0204060'99'03'08'13'18
Citations per Year
Semantic Scholar estimates that this publication has 589 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

M

  • I. D. Baxter, A. Yahin, L. Moura
  • Sant’Anna, and L. Bier. Clone detection using…
  • 1998
Highly Influential
4 Excerpts

On finding duplication and nearduplicationn large software systems

  • B. S. Baker.
  • Erkennung isomorpher Subgraphen und deren…
  • 2000

and A

  • R. C. Holt, A. Winter
  • Scḧ urr. GXL: Towards a standard exchange format…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…