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] Inductive definition of reachability in an array-implemented list.

  • Subject: [Frama-c-discuss] Inductive definition of reachability in an array-implemented list.
  • From: Pascal.CUOQ at cea.fr (CUOQ Pascal)
  • Date: Fri, 5 Jun 2009 22:34:34 +0200
  • References: <4A28B8BD.5080509@fr.thalesgroup.com><4A290576.5010102@fr.thalesgroup.com><4A293B6E.7010806@insa-lyon.fr> <20090605181021.0b3c566f@is005115>
>>             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