Re: [Lit.] Buffer overruns
From: Mok-Kong Shen (mok-kong.shen_at_t-online.de)
Date: 01/16/05
- Next message: BRG: "Re: [Lit.] Buffer overruns"
- Previous message: Mok-Kong Shen: "Re: [Lit.] Buffer overruns"
- In reply to: Paul Rubin: "Re: [Lit.] Buffer overruns"
- Next in thread: infobahn: "Re: [Lit.] Buffer overruns"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sun, 16 Jan 2005 16:38:34 +0100
Paul Rubin wrote:
> daw@taverner.cs.berkeley.edu (David Wagner) writes:
>
>>But if your system of reasoning is "sound", then if you know something
>>for certain, it has to be true. I suggest only using systems of reasoning
>>that are sound. In this case, you don't need the revision suggested above.
>
>
> But the best way to know if reasoning is really sound, is to check it
> by computer. If the compiler can verify that the bounds check is not
> needed, then it should certainly be omitted.
I think that modern compilers are smart enough to avoid
many sorts of uncessary computations. But this depends
also on the PL. Of course, the capability of a compiler
to optimize is inherently limited. However, for example,
in ADA the programmer could explicitly suppress certain
checks in selected regions of his programs.
M. K. Shen
- Next message: BRG: "Re: [Lit.] Buffer overruns"
- Previous message: Mok-Kong Shen: "Re: [Lit.] Buffer overruns"
- In reply to: Paul Rubin: "Re: [Lit.] Buffer overruns"
- Next in thread: infobahn: "Re: [Lit.] Buffer overruns"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|