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] ACSL-1.9, Example 2.46

  • Subject: [Frama-c-discuss] ACSL-1.9, Example 2.46
  • From: dcok at grammatech.com (David R. Cok)
  • Date: Tue, 05 May 2015 08:11:06 -0400
A suggestion: For clarity, this example should have an axiom

@ axiom permut_refl{L1,L2} :
@ \forall double *t1, *t2, integer n;
@ (\forall integer i; 0 <= k < n ==> \at(t1[k],L1) == \at(t2[k],L2)) ==> 
permut{L1,L2}(t1,t2,n) ;

instead of the existing permut_refl. The above serves as a base case 
from which to do exchanges.
The above is not absolutely necessary because one can prove it by a 
transitive combination of two swaps between the same i,j indices, but 
that hardly makes for a good pedagogical example. Similarly the existing 
permut_refl is not essential, as it can also be proved from exchange and 
trans, or from the new refl.

- David