ACM Home Page
Please provide us with feedback. Feedback
Measurements of program similarity in identical task environments
Full text PdfPdf (677 KB)
Source ACM SIGPLAN Notices archive
Volume 19 ,  Issue 8  (August 1984) table of contents
COLUMN: Technical contributions table of contents
Pages: 65 - 76  
Year of Publication: 1984
ISSN:0362-1340
Authors
H. L. Berghel  University of Nebraska, Lincoln, NE
D. L. Sallach  College of St. Mary, Omaha, NE
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Citation Count: 7
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/988241.988245
What is a DOI?

ABSTRACT

This paper summarizes the results of a study which compared the efficiency of two methods of measuring program similarity in the context of novice programmers trying to reach identical objectives. Both methods look for similarity by comparing 'program profiles'. Such profiles are created by feature extraction routines which map each program onto a tuple <f1, f2,..., fn> where each fi is a count of an occurrence of a particular feature. A comparison routine is then invoked which detects similarities between tuples. The results showed that in this environment the comparison routine based on the Halstead metric failed to perform as well as a conceptually simpler alternative.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Berghel, H. and C. Daly: "A Comparison of Three Approaches Toward Teaching Computer Literacy", <u>Proceedings of the IEEE ED COMPCON-83</u>, IEEE Computer Society, Spring, 1984 (forthcoming).
 
2
Berghel, H. and D. Sallach: "Identifying Program Similarity: the Limits of the Halstead Metric" (forthcoming).
 
3
4
 
5
Bulut N., M. Halstead, and R. Bayer: "Experimental Validation of a Structured Property of FORTRAN Algorithms", Computer Science Department Internal Report CSD-TR 115, Purdue University, (April 1974).
 
6
Cornell, L. and M. Halstead, "Predicting the Number of Bugs Expected in a Program Module", Computer Science Department Internal Report CSD-TR 205, Purdue University, (October, 1976).
7
8
9
 
10
Gordon, R. and M. Halstead, "An Experiment Comparing FORTRAN Programming Time with the Software Physics Hypothesis", <u>Proceedings of the AFIPS National Computer Conference</u>, Vol. 45, AFIPS Press, Montvale, NJ, 1976, pp. 935--937.
11
 
12
Halstead, M.: "A Theoretical Relationship Between Mental Work and Machine Language Programming", Computer Science Department Internal Report CSD-TR 67, Purdue University, (February 1972).
13
14
 
15
Halstead, M.: "Software Physics: Basic Principles", RJ 1582, IBM, Yorktown Heights, N. Y., (1975).
 
16
Halstead, M.: "Using the Methodology of Natural Science to Understand Software", Computer Science Department Internal Report CSD-TR 190, Purdue University, (1976).
 
17
 
18
Hanushek, Eric A. and John E. Jackson: <u>Statistical Methods for Social Scientists</u>, Academic Press, New York, (1977).
19
 
20
Ottenstein, K.: "A Program to Count Operators and Operands for ANSI-FORTRAN Modules", Computer Science Department Internal Report CSD-TR 196, Purdue University, (June 1976).
21
 
22
Shaw, M., A. Jones, P. Kneuven, J. McDermott, P. Miller and D. Notkin: "Cheating Policy in a Computer Science Department", <u>SIGSCE Bulletin</u>, Vol. 12, No. 2, (July 1980), pp. 72--76.

Collaborative Colleagues:
H. L. Berghel: colleagues
D. L. Sallach: colleagues