David Gitchell
Abstract
We describe the design and implementation of a program called sim to measure similarity between two C computer programs. It is useful for detecting plagiarism among a large set of homework programs. This software is part of a project to construct tools to assist the teaching of computer science.
- 1 A. AIKEN, Measure of software similarity. URL http://www.cs.berkeley.edu/-aiken/moss.html.Google Scholar
- 2 B. S. BAKER, Parameterized pattern matching: Algorithms and applications, J. Comput. System Sci., 52 (1996), pp. 28- 42. Google ScholarDigital Library
- 3 M. BLUM AND S. KANNAN, Designing programs that check their work, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 86-97. Google ScholarDigital Library
- 4 L. BABAI AND S. MORAN, Arthur-Merlin games: a randomized proof system and hierarchy of complexity classes, Journal of Computer and System Sciences, 36 (1988), pp. 254-276. Google ScholarDigital Library
- 5 S. GOLDWASSER, S. MICALI, AND C. RAGKOFF, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, 18 (1989), pp. 186-208. Google ScholarDigital Library
- 6 X. HUANG, R. C. HARDISON, AND W. MILLER, A spacee~cient algorithm for local similarities, Computer Applications in the Biosciences, 6 (1990), pp. 373-381.Google Scholar
- 7 D. HIRSCHBERG, A linear space algorithm for computing maximal common subsequences, Communications of the ACM, 18 (1975), pp. 341-343. Google ScholarDigital Library
- 8 J. W. HUNT AND M. D. MCILLROY, An algorithm .for differential file comparison, Tech. Report 41, Bell Laboratories, June 1976.Google Scholar
- 9 J. W. HUNT AND T. G. SZYMANSKI, A fast algorithm for computing longest common subsequences, Communications of the ACM, 20 (1977), pp. 350-353. Google ScholarDigital Library
- 10 H. T. JANKOWITZ, Detecting plagiarism in student Pascal programs, Computer Journal, 31 (1988), pp. 1-8. Google ScholarDigital Library
- 11 L. MALMI, M. HENRICHSON, T. KARRAS, J. SAARHEL0, AND S. SAERKILAHTI, Detecting plagiarism in Pascal and C programs, tech. report, Helsinki University of Technology, 1992.Google Scholar
- 12 E. W. MYERS AND W. MILLER, Optimal alignments in linear space, Computer Applications in the Biosciences, 4 (1988), pp. 11-17.Google Scholar
- 13 S. B. NEEDLEMAN AND C. D. WUNSCH, A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of Molecular Biology, 48 (1970), pp. 443-453.Google ScholarCross Ref
- 14 T. F. SMITH AND M. S. WATERMAN, Identification of common molecular subsequences, Journal of Molecular Biology, 147 (1981), pp. 195-197.Google ScholarCross Ref
- 15 L. G. VALIANT, A theory of the learnable, in Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, Washington, D.C., 1984, pp. 436-445. Google ScholarDigital Library
Index Terms
- Sim: a utility for detecting similarity in computer programs
Recommendations
SIM-DLA: A Novel Semantic Similarity Measure for Description Logics Reducing Inter-concept to Inter-instance Similarity
ESWC 2009 Heraklion: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and ApplicationsWhile semantic similarity plays a crucial role for human categorization and reasoning, computational similarity measures have also been applied to fields such as semantics-based information retrieval or ontology engineering. Several measures have been ...
Sim: a utility for detecting similarity in computer programs
SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science educationWe describe the design and implementation of a program called sim to measure similarity between two C computer programs. It is useful for detecting plagiarism among a large set of homework programs. This software is part of a project to construct tools ...
Sim-Watchdog: Leveraging Temporal Similarity for Anomaly Detection in Dynamic Graphs
ICDCS '14: Proceedings of the 2014 IEEE 34th International Conference on Distributed Computing SystemsGraphs are widely used to characterize relationships or information flows among entities in large networks or distributed systems. In this work, we propose a systematic framework that leverages temporal similarity inherent in dynamic graphs for anomaly ...
Comments