Frama-C-discuss mailing list archives
This page gathers the archives of the old Frama-C-discuss archives, that was hosted by Inria's gforge before its demise at the end of 2020. To search for mails newer than September 2020, please visit the page of the new mailing list on Renater.
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Frama-c-discuss] math vs. bits
- Subject: [Frama-c-discuss] math vs. bits
- From: dmentre at linux-france.org (David MENTRE)
- Date: Fri, 8 Nov 2013 08:23:26 +0100
- In-reply-to: <alpine.DEB.2.02.1311072053040.8733@gamow.cs.utah.edu>
- References: <527C59A7.1040804@cs.utah.edu> <527C5F04.9030109@inria.fr> <alpine.DEB.2.02.1311072053040.8733@gamow.cs.utah.edu>
Hello, 2013/11/8 John Regehr <regehr at cs.utah.edu>: > Is there some way I can provide a bit of additional information here so > these and the n-bit rotate functions verify, or am I stuck with an > interactive proof assistant? I previously used a combination of Value analysis and WP to solve an issue with bitshift operations. The initial issue: http://lists.gforge.inria.fr/pipermail/frama-c-discuss/2013-August/003759.html Dillon Pariente solution: http://lists.gforge.inria.fr/pipermail/frama-c-discuss/2013-August/003764.html The general approach is to use Value to verify a limited set of cases with constant values (which is good at) and let WP generalize that to the generic case (which is good at). I don't know if such approach would work on your case, though. Best regards, david
- References:
- [Frama-c-discuss] math vs. bits
- From: regehr at cs.utah.edu (John Regehr)
- [Frama-c-discuss] math vs. bits
- From: guillaume.melquiond at inria.fr (Guillaume Melquiond)
- [Frama-c-discuss] math vs. bits
- From: regehr at cs.utah.edu (John Regehr)
- [Frama-c-discuss] math vs. bits
- Prev by Date: [Frama-c-discuss] adding new provers to why3
- Next by Date: [Frama-c-discuss] adding new provers to why3
- Previous by thread: [Frama-c-discuss] math vs. bits
- Next by thread: [Frama-c-discuss] math vs. bits
- Index(es):