Code Matching Algorithm

Question

I have two Java source files that do the same, give the same result. They are slightly different from the code they contain, as in the example below. I need an algorithm that measures the speed of similarity (identity) between these two java code files.

Example

/* First file */
public int inc (int n) {
    return ++n;
}

/* Second file */
public int inc (int n) {
    return (n+1);
}

Is there an algorithm that shows that these two files do the same?

Thanks in advance

Answer 1

As Alan Turing proved almost a century ago, there is no general algorithm that could even determine if a function estimate will complete in a finite time (see Halting problem).

, , , . , , , , , , - , .

Answer 2

. .

1: , . , .

2. , , , , . .

3. . , .

, , , .

, , , , , .

Answer 3

, .

? .: https://www.cs.rochester.edu/~nelson/courses/csc_173/computability/undecidable.html

" "

, , , .

Answer 4

, , Turnitin.

, . , .

• "" /. x++ x+=1, x=x+1, ++x . , x++ ++x . , 100% , .

• "" , .

, , .

: x++ x=(x+2)-1, , , , .

3. If you program not only verification of codes, but also essays and journals. You can do text analysis when writing patterns. (For example, using the frequency of counting the word length). Some authors may prefer to use shorter words, while some prefer longer words.

4. There are many other tests you can do to make your program dynamic. Despite the fact that there is no such algorithm, but, of course, you can write such programs to detect plagiarism.