--- layout: fc_discuss_archives title: Message 8 from Frama-C-discuss on March 2015 ---
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>