Timeline for How does BinDiff work?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Apr 9, 2013 at 14:26 | history | suggested | 0xC0000022L♦ | CC BY-SA 3.0 |
spelling etc
|
| Apr 9, 2013 at 1:17 | review | Suggested edits | |||
| S Apr 9, 2013 at 14:26 | |||||
| S Apr 2, 2013 at 14:05 | history | suggested | perror | CC BY-SA 3.0 |
A few spell-checking on the text (I probably did miss some).
|
| Apr 2, 2013 at 11:34 | review | Suggested edits | |||
| S Apr 2, 2013 at 14:05 | |||||
| Apr 2, 2013 at 11:31 | comment | added | perror | The original article on the algorithm of graph homomorphism is a good start. More recently, some tools have been proposed (see this paper and this poster). But, this Reddit thread suggests that some improvements have been made on BinDiff. | |
| Apr 2, 2013 at 10:47 | history | answered | fasmotol | CC BY-SA 3.0 |