Hello. I've been reading a lot about how to find memory address and it's value. I had lot of trouble, cause the address used to change later and I had no any idea about how to go with the base memory and offset.
Happily, there is a very simple solution and it's working for me well.
Apparently, those dynamic addresses, if they crush, they just run on a different version of those addresses and as you collect another addresses, you can place a code, before they are check.
ex.
this when the program starts
and that, when the value is going to be check
So as opportunate a crush, the program is going to check the criteria, for the value and if they are wrong, go with another version of those values. And it works without bunch of stuff necessary to find the base memory and offset.
Happily, there is a very simple solution and it's working for me well.
Apparently, those dynamic addresses, if they crush, they just run on a different version of those addresses and as you collect another addresses, you can place a code, before they are check.
ex.
this when the program starts
and that, when the value is going to be check
So as opportunate a crush, the program is going to check the criteria, for the value and if they are wrong, go with another version of those values. And it works without bunch of stuff necessary to find the base memory and offset.