TLDR: We want to decompile a binary code, into the byte equivalent C code. We look at this from an optimization viewpoint. We have a generated C code(or AST) and we want to optimize it so when we compile it, it is equivalent to the binary code, byte by byte. And I think it’s better to use a population based optimization metaheuristic to do this. Such as Genetic Programming. Requirements to understand this post The idea I’m writing about is very deep. You need to know the current problem we have about companies violating GPL and not releasing the Linux kernel source code used in their devices. Then you need to know what an Algorithm is. What a Heuristic is. And what is the difference between them. And you also need to know what an optimization problem is. And what is our goal in these problems. After that, you need to know in this very specific optimization problem, we are not looking for “good enough” solutions unlike most other optimization problems. We are rather looking for the “perfect” solution, if we can find one.