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] Verification of integer and pointer programs

  • Subject: [Frama-c-discuss] Verification of integer and pointer programs
  • From: Boris.Hollas at de.bosch.com (Hollas Boris (CR/AEY1))
  • Date: Thu, 14 Jan 2010 16:02:46 +0100
Hello and happy new year everyone!

I had a look at Yannik Moy's thesis to find out how integer and pointer programs are verified. However, some things are not yet clear to me.

- Suppose there's a pointer expression *(expr) in a statement, where expr evaluates to a memory location. Is then an implicit precondition \valid(expr) generated?
- For an assignment x=e to an int x, is an implicit precondition min_int <= e <= max_int generated?
- In this case, are the rules for the wp-calculus changed accordingly? Eg, for a variable x and an expression e containing pointer expressions, is

  wp(x=e, Q) = Q[ x -> e] \cup \bigcup_p {\valid(p)} \cup {min_int <= e <= max_int}

  the rule for assignment, where p ranges over all pointer expressions *(expr) in e?

-Boris
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.gforge.inria.fr/pipermail/frama-c-discuss/attachments/20100114/673ab110/attachment.htm