--- layout: fc_discuss_archives title: Message 25 from Frama-C-discuss on June 2009 ---
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Frama-c-discuss] Inductive definition of reachability in an array-implemented list.



>>             if not : same player play again, but without exact option.
>> 
>> I don't know how to verify this second point. 
>If you have a complete application, the value analyzer can take care of
>that: it will emit an alarm each time it can't ensure that no overflow
>occurs.

The value analysis *could* take care of that and emit an alarm
each time it can't ensure that no overflow occurs. Currently,
it assumes that all overflows are desired overflows that are part
of the program's logic, and it continues the analysis with a
correct superset of the values that can actually be obtained
at run-time, assuming 2's complement arithmetic and proper
configuration of the characteristics of the target architecture.

Pascal