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] fact proof
- Subject: [Frama-c-discuss] fact proof
- From: fritjof at alokat.org (Fritjof Bornebusch)
- Date: Sun, 15 Mar 2015 20:23:58 +0100
Hi, I have a question about the proof of recursion functions, like this one: https://bts.frama-c.com/dokuwiki/doku.php?id=mantis:frama-c:frequently_asked_questions#how_do_i_verify_a_recursive_function As far as I understand this correct, the values of the inductive proof are: a = 1 b = n n = \result But 3! is 6 and not (b*n) = 2 * 6 = 12 Or do I missunderstand the proof? Regards, fritjof -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 819 bytes Desc: not available URL: <http://lists.gforge.inria.fr/pipermail/frama-c-discuss/attachments/20150315/04de6dc2/attachment.sig>
- Follow-Ups:
- [Frama-c-discuss] fact proof
- From: dmentre at linux-france.org (David MENTRÉ)
- [Frama-c-discuss] fact proof
- Prev by Date: [Frama-c-discuss] Verification of linked list
- Next by Date: [Frama-c-discuss] WP and type casting
- Previous by thread: [Frama-c-discuss] Frama-c-discuss Digest, Vol 82, Issue 1
- Next by thread: [Frama-c-discuss] fact proof
- Index(es):