A static binary rewriter that does not use heuristics
1–10 of 17 posts
Re: A static binary rewriter that does not use heuristics
#2Re: A static binary rewriter that does not use heuristics
#3Re: A static binary rewriter that does not use heuristics
#4I read the readme. I still don't know what is "rewriting" a binary or why one would want to do it. Can someone explain?
Therefore it seems the rewriter can modify already existing binaries corresponding to some rules in Python files by inserting additional instructions.
Re: A static binary rewriter that does not use heuristics
#5Could this tool be used to produce eg a statically-linked version of `curl` that would work the same on any Linux, without needing to build curl from sources?
Re: A static binary rewriter that does not use heuristics
#6Re: A static binary rewriter that does not use heuristics
#7Could this tool be used to produce eg a statically-linked version of `curl` that would work the same on any Linux, without needing to build curl from sources?
Re: A static binary rewriter that does not use heuristics
#8Could this tool be used to produce eg a statically-linked version of `curl` that would work the same on any Linux, without needing to build curl from sources?
It does not appear that "static binary rewriter" in this context means that it turns dynamically linked binaries into statically linked binaries, so probably not.
Re: A static binary rewriter that does not use heuristics
#9I read the readme. I still don't know what is "rewriting" a binary or why one would want to do it. Can someone explain?
Re: A static binary rewriter that does not use heuristics
#10Earlier quoted context omitted.
It does not appear that "static binary rewriter" in this context means that it turns dynamically linked binaries into statically linked binaries, so probably not.
So, what does the word “static” mean in this context, that the binary’s behavior does not change?