Sim: A utility for detecting similarity in computer programs

SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)

Volumn 31, Issue 1, 1999, Pages 266-270

  Gitchell, David ^a   Tran, Nicholas ^a  

^a Wichita State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1442344984     PISSN: 00978418     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384266.299783     Document Type: Article

References (15)

1. A. AIKEN, Measure of software similarity. URL http://www.cs.berkeley.edu/~aiken/moss.html.
2. B. S. BAKER, Parameterized pattern matching: Algorithms and applications, J. Comput. System Sci., 52 (1996), pp. 28-42.
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.
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.
5. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, 18 (1989), pp. 186-208.
6. X. HUANG, R. C. HARDISON, AND W. MILLER, A space-efficient algorithm for local similarities, Computer Applications in the Biosciences, 6 (1990), pp. 373-381.
7. D. HIRSCHBERG, A linear space algorithm for computing maximal common subsequences, Communications of the ACM, 18 (1975), pp. 341-343.
8. J. W. HUNT AND M. D. MCILLROY, An algorithm for differential file comparison, Tech. Report 41, Bell Laboratories, June 1976.
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.
10. H. T. JANKOWITZ, Detecting plagiarism in student Pascal programs, Computer Journal, 31 (1988), pp. 1-8.
11. L. MALMI, M. HENRICHSON, T. KARRAS, J. SAARHELO, AND S. SAERKILAHTI, Detecting plagiarism in Pascal and C programs, tech. report, Helsinki University of Technology, 1992.
12. E. W. MYERS AND W. MILLER, Optimal alignments in linear space, Computer Applications in the Biosciences, 4 (1988), pp. 11-17.
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.
14. T. F. SMITH AND M. S. WATERMAN, Identification of common molecular subsequences, Journal of Molecular Biology, 147 (1981), pp. 195-197.
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.