Code Similarity on High Level Programs

Simple item page
dc.creatorBernal, M. Miron
dc.creatorEstrada, H. Coyote
dc.creatorNazuno, J. Figueroa
dc.date2007-10-29
dc.date.accessioned2026-07-07T08:39:25Z
dc.date.available2026-07-07T08:39:25Z
dc.descriptionThis paper presents a new approach for code similarity on High Level programs. Our technique is based on Fast Dynamic Time Warping, that builds a warp path or points relation with local restrictions. The source code is represented into Time Series using the operators inside programming languages that makes possible the comparison. This makes possible subsequence detection that represent similar code instructions. In contrast with other code similarity algorithms, we do not make features extraction. The experiments show that two source codes are similar when their respective Time Series are similar.
dc.descriptionProceedings of the 18th Autumn Meeting on Communications, Computers, Electronics and Industrial Exposition. (IEEE - ROCC07). Acapulco, Guerrero, Mexico. 2007
dc.identifierhttps://arxiv.org/abs/0710.5547
dc.identifierhttp://arxiv.org/abs/0710.5547
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141065
dc.subjectComputer Vision and Pattern Recognition
dc.subjectData Structures and Algorithms
dc.subjectI.5.2
dc.titleCode Similarity on High Level Programs
dc.typetext

Files

Collections

arXiv