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] Jessie+Why 2.23+Gappa 0.12.3 unable to prove many binary_search VCs
- Subject: [Frama-c-discuss] Jessie+Why 2.23+Gappa 0.12.3 unable to prove many binary_search VCs
- From: guillaume.melquiond at inria.fr (Guillaume Melquiond)
- Date: Thu, 07 Jan 2010 07:07:55 +0100
- In-reply-to: <E1NScxy-0006lZ-Ty@fenris.runbox.com>
- References: <E1NScxy-0006lZ-Ty@fenris.runbox.com>
David A. Wheeler a ?crit : > Gappa 0.12.3 cannot handle most of the VCs. Seeing that there isn't even a single floating-point number in your code, the contrary would have been surprising. (In fact, it comes as a good surprise to me that Gappa is able to prove 30% of the VCs on your example.) Gappa is not a generic (SMT) prover like Alt-Ergo, CVC3, Z3, Simplify, etc. It is a specialized prover dedicated to proving properties on floating-point expressions, as they are usually out of reach of the above tools. It comes as a complement to the other tools, not as a replacement. Best regards, Guillaume
- References:
- [Frama-c-discuss] Jessie+Why 2.23+Gappa 0.12.3 unable to prove many binary_search VCs
- From: dwheeler at dwheeler.com (David A. Wheeler)
- [Frama-c-discuss] Jessie+Why 2.23+Gappa 0.12.3 unable to prove many binary_search VCs
- Prev by Date: [Frama-c-discuss] Jessie+Why 2.23+Gappa 0.12.3 unable to prove many binary_search VCs
- Next by Date: [Frama-c-discuss] GWhy not working with Coq.
- Previous by thread: [Frama-c-discuss] Jessie+Why 2.23+Gappa 0.12.3 unable to prove many binary_search VCs
- Next by thread: [Frama-c-discuss] bug with output to Alt-Ergo and CVC3
- Index(es):