1994-12-28 - recognizing the essence
Header Data
From: Raph Levien <raph@CS.Berkeley.EDU>
To: cypherpunks@toad.com
Message Hash: c314bc3afe1f3a7bb59987f0e1dd2661bc8f014fea987f9e7d5dfeca03e377a8
Message ID: <199412282004.MAA07069@kiwi.CS.Berkeley.EDU>
Reply To: <199412281820.NAA15426@en.ecn.purdue.edu>
UTC Datetime: 1994-12-28 20:04:24 UTC
Raw Date: Wed, 28 Dec 94 12:04:24 PST
Raw message
From: Raph Levien <raph@CS.Berkeley.EDU>
Date: Wed, 28 Dec 94 12:04:24 PST
To: cypherpunks@toad.com
Subject: recognizing the essence
In-Reply-To: <199412281820.NAA15426@en.ecn.purdue.edu>
Message-ID: <199412282004.MAA07069@kiwi.CS.Berkeley.EDU>
MIME-Version: 1.0
Content-Type: text/plain
The most famous and widely used plagiarism detector here at Berkeley
must be the one John Osterhout wrote. It basically detects
similarities in program structure (call graph, loops, conditionals,
etc.)
It was used in the undergraduate compilers class. I believe the output
of the program is a list of pairs, ordered by decreasing similarity.
The professor spoke to the top two matches, they both ended up
confessing. He didn't check more for lack of time.
I believe the source code _isn't_ publicly available.
Good luck.
Raph
Thread
Return to December 1994
- Return to “cort <cort@ecn.purdue.edu>”
- Return to “Jonathan Cooper <entropy@IntNet.net>”
Return to “Raph Levien <raph@CS.Berkeley.EDU>”
- 1994-12-28 (Wed, 28 Dec 94 10:20:39 PST) - recognizing the essence - cort <cort@ecn.purdue.edu>
- 1994-12-28 (Wed, 28 Dec 94 12:04:24 PST) - recognizing the essence - Raph Levien <raph@CS.Berkeley.EDU>
- 1994-12-28 (Wed, 28 Dec 94 14:04:39 PST) - Re: recognizing the essence - Jonathan Cooper <entropy@IntNet.net>
- 1994-12-28 (Wed, 28 Dec 94 12:04:24 PST) - recognizing the essence - Raph Levien <raph@CS.Berkeley.EDU>