Timeline for How decompilation works? [closed]
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2017 at 19:15 | history | closed |
perror Jongware ixje w s jvoisin |
Needs more focus | |
| Jan 4, 2017 at 19:27 | comment | added | Jongware | The theory is that pseudocode is easier to understand than assembly. (A necessary assumption, then, is that "all assembly can be converted to equivalent-or-easier pseudocode".) That's not what your title asks about, though. | |
| Jan 4, 2017 at 18:46 | vote | accept | lemanb84 | ||
| Jan 4, 2017 at 18:46 | vote | accept | lemanb84 | ||
| Jan 4, 2017 at 18:46 | |||||
| Jan 4, 2017 at 18:46 | vote | accept | lemanb84 | ||
| Jan 4, 2017 at 18:46 | |||||
| Jan 4, 2017 at 18:45 | vote | accept | lemanb84 | ||
| Jan 4, 2017 at 18:46 | |||||
| Jan 4, 2017 at 18:44 | answer | added | julian♦ | timeline score: 5 | |
| Jan 4, 2017 at 14:03 | review | Close votes | |||
| Jan 5, 2017 at 19:15 | |||||
| Jan 4, 2017 at 12:41 | history | asked | lemanb84 | CC BY-SA 3.0 |