Une nouvelle version du portail de gestion des comptes externes sera mise en production lundi 09 août. Elle permettra d'allonger la validité d'un compte externe jusqu'à 3 ans. Pour plus de détails sur cette version consulter : https://doc-si.inria.fr/x/FCeS

Commit 5623cf45 by Jean-Christophe Filliâtre

### proof of algo65

parent 6a180e51
 ... ... @@ -177,7 +177,6 @@ pvsbin/ /examples/programs/vacid_0_red_black_trees_harness/ /examples/programs/next_digit_sum/ /examples/programs/algo63/ /examples/programs/algo65/ /examples/programs/binary_search_c/ /examples/programs/dijkstra/ /examples/why3bench.html ... ...
 ... ... @@ -25,7 +25,7 @@ module Algo65 a : array int -> m:int -> n:int -> i:ref int -> j:ref int -> { 0 <= m < n < length a } unit writes a i j { m <= !j < !i <= n /\ permut_sub (old a) a m n /\ { m <= !j < !i <= n /\ permut_sub (old a) a m (n+1) /\ exists x:int. (forall r:int. m <= r <= !j -> a[r] <= x) /\ (forall r:int. !j < r < !i -> a[r] = x) /\ ... ... @@ -40,13 +40,13 @@ module Algo65 let j = ref 0 in 'L1: partition a m n i j; assert { permut_sub (at a 'L1) a m n }; assert { permut_sub (at a 'L1) a m (n+1) }; 'L2: if k <= !j then find a m !j k; assert { permut_sub (at a 'L2) a m n }; assert { permut_sub (at a 'L2) a m (n+1) }; if !i <= k then find a !i n k end { permut_sub (old a) a m n /\ { permut_sub (old a) a m (n+1) /\ (forall r:int. m <= r <= k -> a[r] <= a[k]) /\ (forall r:int. k <= r <= n -> a[k] <= a[r]) } ... ...
This diff is collapsed.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!