Dailydave mailing list archives
Re: Problems to solve
From: Blue Boar <BlueBoar () thievco com>
Date: Fri, 11 Aug 2006 14:19:30 -0700
Halvar Flake wrote:
Concerning serializing the path: This can be done by starting at a root function, computing basicblock iso's, then taking the n-th subfunction call in the given basicblock and iterate. But at that point one might as well calculate a full BinDiff -- it is reasonably cheap even for large executables these days.
OK, I guess I was thinking of the path as a "name" of sorts. How do you name the function, so two people can refer to it? By the 3-tuple? Do you have some way to hash the internal logic flow of a function down to a string? Apologies in advance if I'm asking a dumb question, I've not actually used bindiff live, my experience with it is from your movies and presentations. BB _______________________________________________ Dailydave mailing list Dailydave () lists immunitysec com http://lists.immunitysec.com/mailman/listinfo/dailydave
Current thread:
- Problems to solve Dave Aitel (Aug 10)
- Re: Problems to solve Chris Eagle (Aug 10)
- Re: Problems to solve CIRT.DK (Aug 10)
- Re: Problems to solve Nicolas RUFF (Aug 14)
- Re: Problems to solve Matt Oh (Aug 15)
- Re: Problems to solve Matt Oh (Aug 15)
- Re: Problems to solve Nicolas RUFF (Aug 15)
- Re: Problems to solve Matt Oh (Aug 15)
- Re: Problems to solve Matt Oh (Aug 15)
- Re: Problems to solve CIRT.DK (Aug 10)
- Re: Problems to solve Chris Eagle (Aug 10)
- Re: Problems to solve Blue Boar (Aug 14)
- <Possible follow-ups>
- Re: Problems to solve Ferguson, Justin (IARC) (Aug 10)