library colibrilib.fp_conv — module RealConvfp.to_real and to_fp of a real, on the domains.
module RealConv879use int.Int880use list.List881use option.Option882use real.RealInfix883use colibrilib.ring.Atom884use colibrilib.fp.Ereal885use colibrilib.fbin.Fp886use colibrilib.fp_facts.Facts887use colibrilib.stda.StdA as A888use colibrilib.fp_interval.Intervals889use colibrilib.fp_interval.FpInterval890use Env891
updr, or the contradiction for the empty domain
Valid (16ms) (colibri2)let updr_dom (d: env) (n: Atom.t) (l: rdom) : unit894requires { live d -> rmem (d.mr n) l }895= match l with896| Nil -> contradiction d897| _ -> updr d n l898end899
fp.to_real, forwardThe reals of the floats of the domain, when it holds no NaN and no infinity (fp.to_real of those is unspecified): None is no information.
Valid (1.2s) (colibri2 10) (cvc5 2) (split_vc 2) (depth 2)let rec to_real_u (ghost fm: format) (minf pinf: t) (l: list (t, t)) : option rdom906requires { ok_u l /\ fmt_u fm l }907requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }908ensures { match result with909| Some r -> forall x. mem_u x l -> is_not_nan x /\ not (is_inf x) /\ rmem (to_real x) r910| None -> true911end }912variant { l }913= match l with914| Nil -> Some Nil915| Cons (a, b) l' ->916if is_inf_f fm minf pinf a || is_inf_f fm minf pinf b then None917else begin918match to_real_u fm minf pinf l' with919| None -> None920| Some r ->921Some (Cons (RInter (BLarge (to_a a)) (BLarge (to_a b))) r)922end923end924end925Valid (32ms) (colibri2)926let to_real_fwd (ghost fm: format) (minf pinf: t) (d: dom) : option rdom927requires { d.fm = fm }928requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }929ensures { match result with930| Some r -> forall x. mem x d -> is_not_nan x /\ not (is_inf x) /\ rmem (to_real x) r931| None -> true932end }933= if d.nan then None else to_real_u fm minf pinf d.u934
Valid (21ms) (colibri2)let exact (minf pinf: t) (a: A.t) (f: t) : bool941requires { fmt minf = fmt f /\ fmt pinf = fmt f }942requires { minf = minus_infinity (fmt f) /\ pinf = plus_infinity (fmt f) }943ensures { result <-> is_not_nan f /\ not (is_inf f) /\ to_real f = A.real a }944= if is_nan f then false945else if is_inf_f (fmt f) minf pinf f then false946else a_eq a (to_a f)947
The least finite float at or above (strictly when strict) a
Valid (41ms) (colibri2)let lo_of (fm: format) (minf pinf: t) (strict: bool) (a: A.t) : t950requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }951ensures { fmt result = fm }952ensures { forall v. fmt v = fm -> is_not_nan v -> not (is_inf v) ->953(if strict then A.real a <. to_real v else A.real a <=. to_real v) -> le_dz result v }954= let f = ceil_f fm a in955float_lo f strict (exact minf pinf a f)956Valid (51ms) (colibri2)957let hi_of (fm: format) (minf pinf: t) (strict: bool) (a: A.t) : t958requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }959ensures { fmt result = fm }960ensures { forall v. fmt v = fm -> is_not_nan v -> not (is_inf v) ->961(if strict then to_real v <. A.real a else to_real v <=. A.real a) -> le_dz v result }962= let f = floor_f fm a in963float_hi f strict (exact minf pinf a f)964
[l, h], or the empty domain
Valid (95ms) (cvc5)let interval_o (fm: format) (l h: t) : dom967requires { fmt l = fm /\ fmt h = fm }968ensures { result.fm = fm }969ensures { forall v. fmt v = fm -> is_not_nan v -> le_dz l v -> le_dz v h -> mem v result }970= if is_nan l || is_nan h then empty_dom fm971else if le_diff_zero l h then interval fm l h972else begin973{proof…} let lemma pt (v: t) : unit974requires { le_dz l v /\ le_dz v h } ensures { false } = le_trans l v h in {qed}975empty_dom fm976end977Valid (171ms) (colibri2)978let of_riv (fm: format) (minf pinf: t) (i: riv) : dom979requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }980ensures { result.fm = fm }981ensures { forall v. fmt v = fm -> is_not_nan v -> not (is_inf v) ->982rmem_iv (to_real v) i -> mem v result }983= match i with984| RSing a -> interval_o fm (lo_of fm minf pinf false a) (hi_of fm minf pinf false a)985| RInter rl rh ->986let l = match rl with987| BInf -> minf988| BLarge a -> lo_of fm minf pinf false a989| BStrict a -> lo_of fm minf pinf true a990end in991let h = match rh with992| BInf -> pinf993| BLarge a -> hi_of fm minf pinf false a994| BStrict a -> hi_of fm minf pinf true a995end in996{proof…}997let lemma pt (v: t) : unit998requires { fmt v = fm /\ is_not_nan v /\ not (is_inf v) /\ rmem_iv (to_real v) i }999ensures { le_dz l v /\ le_dz v h }1000= match rl with BInf -> lt_le minf v | _ -> () end;1001match rh with BInf -> lt_le v pinf | _ -> () end in1002{qed}1003interval_o fm l h1004end1005Valid (380ms) (colibri2)1006let rec of_rdom (fm: format) (minf pinf: t) (l: rdom) : dom1007requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }1008ensures { result.fm = fm }1009ensures { forall v. fmt v = fm -> is_not_nan v -> not (is_inf v) ->1010rmem (to_real v) l -> mem v result }1011variant { l }1012= match l with1013| Nil -> empty_dom fm1014| Cons i l' -> union fm (of_riv fm minf pinf i) (of_rdom fm minf pinf l')1015end1016
The floats of va that are NaN, infinite, or whose real is in vr; None for none
Valid (638ms) (cvc5)let to_real_back (fm: format) (minf pinf: t) (va: dom) (vr: rdom) : option dom1020requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }1021requires { va.fm = fm }1022ensures { match result with Some r -> r.fm = fm | None -> true end }1023ensures { forall v. mem v va -> (is_not_nan v /\ not (is_inf v) -> rmem (to_real v) vr) ->1024match result with Some r -> mem v r | None -> false end }1025= let ex = union fm (nan_dom fm) (infinites fm minf pinf) in1026let u = of_rdom fm minf pinf vr in1027match inter fm va (union fm ex u) with1028| None -> None1029| Some r -> Some r1030end1031
to_fp of a real, forwardround_x fm md x is to_fp of SMT–LIB: a zero result is –0 when x < 0.
function round_x (fm: format) (md: mode) (x: real) : t =1037round_f fm md (x <. 0.0) (Fin x)1038Valid (41ms) (colibri2)1039let ghost minf_le (fm: format) (v: t) : unit1040requires { fmt v = fm /\ is_not_nan v }1041ensures { le_dz (minus_infinity fm) v }1042= if is_minus_infinity v then le_refl v else lt_le (minus_infinity fm) v1043Valid (15ms) (colibri2)1044let ghost le_pinf (fm: format) (v: t) : unit1045requires { fmt v = fm /\ is_not_nan v }1046ensures { le_dz v (plus_infinity fm) }1047= if is_plus_infinity v then le_refl v else lt_le v (plus_infinity fm)1048Valid (466ms) (colibri2 17) (cvc5 2) (split_vc 3) (depth 2)1049let of_riv1 (fm: format) (minf pinf: t) (md: mode) (i: riv) : dom1050requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }1051ensures { result.fm = fm }1052ensures { forall x. rmem_iv x i -> mem (round_x fm md x) result }1053= match i with1054| RSing a ->1055(* not `singleton`, renamed in `Fp_interval_gen` *)1056let x = round_a fm md a in1057{proof…} le_refl x; {qed}1058interval_o fm x x1059| RInter rl rh ->1060let l = match rl with1061| BInf -> minf1062| BLarge a | BStrict a -> round_a fm md a1063end in1064let h = match rh with1065| BInf -> pinf1066| BLarge a | BStrict a -> round_a fm md a1067end in1068{proof…}1069let lemma pt (x: real) : unit1070requires { rmem_iv x i }1071ensures { le_dz l (round_x fm md x) /\ le_dz (round_x fm md x) h }1072= minf_le fm (round_x fm md x); le_pinf fm (round_x fm md x);1073(match rl with1074| BInf -> ()1075| BLarge a | BStrict a ->1076round_f_le fm md (A.real a <. 0.0) (x <. 0.0) (Fin (A.real a)) (Fin x)1077end);1078match rh with1079| BInf -> ()1080| BLarge a | BStrict a ->1081round_f_le fm md (x <. 0.0) (A.real a <. 0.0) (Fin x) (Fin (A.real a))1082end in1083{qed}1084interval_o fm l h1085end1086Valid (340ms) (colibri2)1087let rec of_real_u (fm: format) (minf pinf: t) (md: mode) (l: rdom) : dom1088requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }1089ensures { result.fm = fm }1090ensures { forall x. rmem x l -> mem (round_x fm md x) result }1091variant { l }1092= match l with1093| Nil -> empty_dom fm1094| Cons i l' -> union fm (of_riv1 fm minf pinf md i) (of_real_u fm minf pinf md l')1095end1096
In the mode, or in any mode when it is unknown
Valid (621ms) (cvc5)let of_real_fwd (fm: format) (minf pinf: t) (om: option mode) (l: rdom) : dom1099requires { fmt minf = fm /\ fmt pinf = fm /\ minf = minus_infinity fm /\ pinf = plus_infinity fm }1100ensures { result.fm = fm }1101ensures { forall md x. (om = None \/ om = Some md) -> rmem x l -> mem (round_x fm md x) result }1102= match om with1103| Some md -> of_real_u fm minf pinf md l1104| None ->1105let r1 = of_real_u fm minf pinf RNE l in1106let r2 = of_real_u fm minf pinf RNA l in1107let r3 = of_real_u fm minf pinf RTP l in1108let r4 = of_real_u fm minf pinf RTN l in1109let r5 = of_real_u fm minf pinf RTZ l in1110union fm r1 (union fm r2 (union fm r3 (union fm r4 r5)))1111end1112
to_fp of a real, backwardThe reals whose rounding is in a float domain, by real_lo and real_hi in the format fm' with one more bit.
Valid (41ms) (colibri2)let rec app (l1 l2: rdom) : rdom1118ensures { forall x. rmem x result <-> rmem x l1 \/ rmem x l2 }1119variant { l1 }1120= match l1 with Nil -> l2 | Cons i l -> Cons i (app l l2) end1121Valid (1.6s) (colibri2 23) (cvc4) (cvc5 4) (split_vc 3) (depth 3)1122let real_iv (fm fm': format) (c c': (t, t, t, t)) (md: mode) (a b: t) : rdom1123requires { widens fm fm' /\ consts_ok fm c /\ consts_ok fm' c' }1124requires { fmt a = fm /\ fmt b = fm /\ is_not_nan a /\ is_not_nan b }1125ensures { forall x. in_iv (round_x fm md x) a b -> rmem x result }1126= let (minf, pinf, nz, pz) = c in1127let (minf', pinf', _, _) = c' in1128let lo = real_lo fm fm' minf nz pz md a in1129let (hi, strict) = real_hi fm fm' pinf nz pz md b in1130if is_inf_f fm' minf' pinf' lo && le_diff_zero pinf' lo then Nil1131else if is_inf_f fm' minf' pinf' hi && le_diff_zero hi minf' then Nil1132else begin1133let rl = if is_inf_f fm' minf' pinf' lo then BInf else BLarge (to_a lo) in1134let rh = if is_inf_f fm' minf' pinf' hi then BInf1135else if strict then BStrict (to_a hi) else BLarge (to_a hi) in1136{proof…}1137let lemma pt (x: real) : unit1138requires { in_iv (round_x fm md x) a b }1139ensures { rmem_iv x (RInter rl rh) }1140= assert { le_dz a (round_f fm md (x <. 0.0) (Fin x)) };1141assert { le_dz (round_f fm md (x <. 0.0) (Fin x)) b };1142assert { ele (ext lo) (Fin x) };1143assert { if strict then Fin x <> ext hi /\ ele (Fin x) (ext hi)1144else ele (Fin x) (ext hi) };1145assert { rmem_lo x rl }; assert { rmem_hi x rh } in1146{qed}1147Cons (RInter rl rh) Nil1148end1149Valid (87ms) (cvc5)1150let rec real_u (fm fm': format) (c c': (t, t, t, t)) (md: mode) (l: list (t, t)) : rdom1151requires { widens fm fm' /\ consts_ok fm c /\ consts_ok fm' c' }1152requires { ok_u l /\ fmt_u fm l }1153ensures { forall x. mem_u (round_x fm md x) l -> rmem x result }1154variant { l }1155= match l with1156| Nil -> Nil1157| Cons (a, b) l' -> app (real_iv fm fm' c c' md a b) (real_u fm fm' c c' md l')1158end1159
In the mode, or in any mode when it is unknown; None when the format has no wider format
Valid (1.2s) (cvc4)let of_real_back (fm: format) (om: option mode) (d: dom) : option rdom1163requires { d.fm = fm }1164ensures { match result with1165| Some l -> forall md x. (om = None \/ om = Some md) -> mem (round_x fm md x) d -> rmem x l1166| None -> true1167end }1168= match widen fm with1169| None -> None1170| Some fm' ->1171let c = consts fm in1172let c' = consts fm' in1173match om with1174| Some md -> Some (real_u fm fm' c c' md d.u)1175| None ->1176let r1 = real_u fm fm' c c' RNE d.u in1177let r2 = real_u fm fm' c c' RNA d.u in1178let r3 = real_u fm fm' c c' RTP d.u in1179let r4 = real_u fm fm' c c' RTN d.u in1180let r5 = real_u fm fm' c c' RTZ d.u in1181Some (app r1 (app r2 (app r3 (app r4 r5))))1182end1183end1184end1185