Author: Omid David Tabibi
Date: 14:44:49 03/17/03
Go up one level in this thread
On March 17, 2003 at 17:39:41, Sally Weltrop wrote: >> >>It will only be useful when you have the source code of both programs (and of >>course Deep <9> didn't have any published source code). > >yeah,it just hit me when after I made my post Writing a program which extracts the strings from two binaries and compares the similarity shouldn't be of any problem. I will try to write such a program tonight if I get the time. >> >>Many CS undergrads tend to plagiarize others' source codes instead of doing >>their own programming. It is unbelievably easy to beat the traditional >>plagiarism detectors (e.g., MOSS from Berkeley), so I wrote this handy program >>which is fairly hard to beat. >> >>I received many complaints from lecturers all over the world criticizing me for >>making the program available publicly so that the students can use it also. But >>I believe that the time they will spend to beat this analyzer will be more than >>that of doing the program by themselves at first place.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.