--- layout: fc_discuss_archives title: Message 107 from Frama-C-discuss on November 2013 ---
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Frama-c-discuss] How to make sure the loop invariant or loop assign is complete/sufficient for proving those post-conditions?



Dear all,

As we known, in order to prove the post-conditions of a function with
loop we need to provide loop invariant.

But I am not very clear on :
1. How many or on what extent should the loop invariant provided?
2. How can we make sure that the provided loop invariant is enough for
the verification?
3. What is the main different between loop invariant and loop assign?
since sometimes only provide loop assign is enough for proving some
post-conditions.

Thank you very much.

Regards,
-david