Sim: A utility for detecting similarity in computer programs

被引：61

作者：

Gitchell, D ^{[1
]}

Tran, N ^{[1
]}

机构：

[1] Wichita State Univ, Dept Comp Sci, Wichita, KS 67060 USA

来源：

PROCEEDINGS OF THE THIRTIETH SIGCSE TECHNICAL SYMPOSIUM ON COMPUTER SCIENCE EDUCATION | 1999年

关键词：

D O I：

10.1145/299649.299783

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：266 / 270

页数：5

共 15 条

[1]

AIKEN A, MEASURE SOFTWARE SIM

[2]

[Anonymous], 1976, 41 BELL LAB

[3] ARTHUR-MERLIN GAMES - A RANDOMIZED PROOF SYSTEM, AND A HIERARCHY OF COMPLEXITY CLASSES [J].

BABAI, L ;

MORAN, S .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 36 (02) :254-276

[4] Parameterized pattern matching: Algorithms and applications [J].

Baker, BS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 52 (01) :28-42

[5]

Blum M., 1989, Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, P86, DOI 10.1145/73007.73015

[6] THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS [J].

GOLDWASSER, S ;

MICALI, S ;

RACKOFF, C .

SIAM JOURNAL ON COMPUTING, 1989, 18 (01) :186-208

[7] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J].

HIRSCHBERG, DS .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :341-343

[8]

HUANG XQ, 1990, COMPUT APPL BIOSCI, V6, P373

[9] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES [J].

HUNT, JW ;

SZYMANSKI, TG .

COMMUNICATIONS OF THE ACM, 1977, 20 (05) :350-353

[10] DETECTING PLAGIARISM IN STUDENT PASCAL PROGRAMS [J].

JANKOWITZ, HT .

COMPUTER JOURNAL, 1988, 31 (01) :1-8

← 1 2 →