Computer Program Plagiarism Detection: The Limits of the Halstead Metric

Plagiarism detection is an increasingly important issue in educational environments. This article employs two alternative metrics in the identification of program similarity. The first is the Halstead metric drawn from the discipline of software science. The second is an ad hoc metric drawn from program grading experience, and identified by means of factor analysis. The ad hoc metric proves to be more useful in identical-task environments. Possible explanations for, as well as some larger implications of, this result are considered.

[1]  Hal Berghel.  Computer Literacy Programs: The Effects of the Large-Class Setting on Student Performance. , 1986 .

[2]  K. J. Ottenstein.  An algorithmic approach to the detection and prevention of plagiarism , 1976, SGCS.

[3]  R. N. Chanon.  On a measure of program structure , 1974, Symposium on Programming.

[4]  M. H. Halstead,et al.  Natural laws controlling algorithm structure? , 1972, SIGP.

[5]  Norman L. Soong,et al.  A program stability measure , 1977, ACM Annual Conference.

[6]  H. Berghel,et al.  Computer Literacy: The Effects Of Teaching Method On Student Performance By Gender , 1984 .

[7]  Sallie M. Henry,et al.  Software quality metrics based on interconnectivity , 1981, J. Syst. Softw..

[8]  Anas N. Al-Rabadi,et al.  A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[9]  B. H. Yin,et al.  The establishment and use of measures to evaluate the quality of software designs , 1978, SIGMETRICS Perform. Evaluation Rev..

[10]  Daniel Schutzer.  On the specification and quantification of software performance objectives , 1977, ACM '77.

[11]  Karl J. Ottenstein.  A Program to Count Operators and Operands for ANSI—FORTRAN Modules , 1976 .

[12]  Sallie M. Henry,et al.  On the relationships among three software metrics , 1981, SIGMETRICS Perform. Evaluation Rev..

[13]  Sallie M. Henry,et al.  Software Structure Metrics Based on Information Flow , 1981, IEEE Transactions on Software Engineering.

[14]  Linda M. Ottenstein,et al.  Predicting the Number of Bugs Expected in a Program Module , 1976 .

[15]  M. H. Halstead,et al.  Invariant properties of algorithms , 1973, SIGP.

[16]  L. T. Love,et al.  An independent test of the theory of software physics , 1976, SIGP.

[17]  Giuseppe Longo,et al.  Quantitative — Qualitative Measure of Information , 1972, International Centre for Mechanical Sciences.

[18]  M. H. Halstead.  An experimental determination of the "purity" of a trivial algorithm , 1973, PERV.

[19]  Tom Love,et al.  A Review and Evaluation of Software Science , 1978, CSUR.

[20]  Rudolf Bayer,et al.  Experimental validation of a structural property of fortran algorithms , 1974, ACM '74.

[21]  M. H. Halstead,et al.  Using the Methodology of Natural Science to Understand Software , 1975 .

[22]  Samuel L. Grier,et al.  A tool that detects plagiarism in Pascal programs , 1981, SIGCSE '81.

[23]  Neal R. Norrick,et al.  Semiotic principles in semantic theory , 1981 .

[24]  James L. Elshoff,et al.  Measuring commercial PL/I programs using Halstead's criteria , 1976, SIGP.

[25]  Maurice H. Halstead,et al.  An experiment comparing Fortran programming times with the software physics hypothesis , 1899, AFIPS '76.