Re: [SC-L] Provably correct microkerne

2009-10-05 Thread karger
an EAL7 Common Criteria evaluation of it in a real system context, and to determine what new requirements could be met in a future EAL8 evaluation. Paul Karger ___ Secure Coding mailing list (SC-L) SC-L@securecoding.org List information, subscriptions

Re: [SC-L] GCC and pointer overflows

2008-05-06 Thread karger
] GCC and pointer overflows [LWN.net] Ken, a good example. For those of you who want to reach much further back, Paul Karger told me of a similar problem in the compiler (I don't remember the language) used for compiling the A1 VAX VMM kernel, that optimized out a check in the Mandatory Access

Re: [SC-L] SC-L Digest, Vol 3, Issue 197

2007-12-02 Thread karger
[EMAIL PROTECTED] writes Extended criteria to the above would involve designs/code that are formally specified or verified (using formal methods/logic). Think Orange Book (TCSEC, ITSEC, Common Criteria, et al) and you'll know what I mean by this. The interesting thing about Orange Book is

Re: [SC-L] Segments, eh Smithers?

2006-04-04 Thread karger
My comments are interleaved below: Crispin Cowan writes: PGN cites many of the things that Multics did right and history did not follow. Most of these issues are sufficiently entrenched in legacy hardware and software that there is little chance to change them any time soon. Of particular

[SC-L] upwards growing stacks

2006-03-31 Thread karger
Steve Bellovin [EMAIL PROTECTED] writes: I've heard that claim before; I've always thought it overrated. In an upward-growing stack, if you overflow a parameter passed to a subroutine it will overwrite the subroutine's return address. Since many buffer overflows happen as a result of library

[SC-L] Multics history

2006-03-30 Thread karger
of memory - only yourself. Note - that is not to say that Multics was free of all security vulnerabilities. It certainly was not, but it was dramatically better than almost anything in widespread use today. The paper to look at is: Karger, P.A. and R.R. Schell. Thirty Years Later: Lessons from

Re: [SC-L] Theoretical question about vulnerabilities

2005-04-12 Thread karger
Pascal Meunier [EMAIL PROTECTED] writes Do you think it is possible to enumerate all the ways all vulnerabilities can be created? Is the set of all possible exploitable programming mistakes bounded? I believe that one can make a Turing machine halting argument to show that this is impossible.