Subject: Re: Volunteers to test some kernel code...
To: Simon J. Gerraty <firstname.lastname@example.org>
From: Michael Graff <email@example.com>
Date: 06/14/1999 14:17:59
"Simon J. Gerraty" <firstname.lastname@example.org> writes:
> Since we are talking clued bad guys... open(2) detects text busy but
> is that infallible? Is there no way that they can update pages of a
> running binary? If the answer to either is not provably "yes", then
> in the presence of demand paging, you'd really need to compute
> (and re-compute) the hash of each page as (and when ever) you paged it in,
> otherwise how do you know that your cached hash is still valid?
How about the additional requirement that hashed binaries are