--- layout: fc_discuss_archives title: Message 18 from Frama-C-discuss on July 2020 ---
Hi, I have a question / thought to bounce off. I've been recently trying to prove a few properties on some trivial functions in a small project of mine (https://github.com/yrashk/clam). I ran into an interesting aspect where I needed to do extensive checks on certain counters not hitting UINTPTR_MAX. I have managed to simplify that with a rather trivial axiom: https://github.com/yrashk/clam/commit/e84af3bf8d72ebdcec392589e189952d560ba28a (obviously, I would have preferred an actual prove, but I am but a novice) I am wondering if any thought has been previously given on such cases where, for example `strlen` axioms are bound by \forall ⤠which is admittedly wider than pointers would allow? Is my approach anywhere close to reasonable? Should Frama-C axiomatics include more consideration for the [limited] pointer integer universe? I apologize if this is something obvious I haven't figured out yet :) Thanks! -- Y. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.gforge.inria.fr/pipermail/frama-c-discuss/attachments/20200730/1eb5786b/attachment.html>