News for hackers. Stuff that matters.
Re:Formal CHERI: rigorous engineering and design-time proof ... by pizlonator on Wednesday August 28, 2024 @03:28PM (#41383264)
No, I won’t have checks on every dereference. The monotonicity of Fil-C’s capabilities makes it possible to do a lot of redundant check elimination.

That’s what I’m working on now. Should have some early results soon.

Re:Formal CHERI: rigorous engineering and design-time proof ... by pitaj on Wednesday August 28, 2024 @03:31PM (#41383296)
Obviously, removing repeated/redundant bounds checks is a basic optimization. That's not what I meant. My point still stands.
Re:Formal CHERI: rigorous engineering and design-time proof ... by pizlonator on Wednesday August 28, 2024 @04:06PM (#41383680)
I think that check on every access is a lot different than check on some accesses.

That plateau might not be any different than the CHERI plateau, since at the microarch level, CHERI will have more checks since it cannot benefit from a compiler’s static reasoning about redundant check elimination.