file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Hacl.Impl.K256.PointMul.fst | Hacl.Impl.K256.PointMul.point_mul_g_double_vartime_noalloc | val point_mul_g_double_vartime_noalloc:
out:point
-> scalar1:qelem -> q1:point
-> scalar2:qelem -> q2:point
-> table2:lbuffer uint64 (32ul *! 15ul) ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q2 /\ live h table2 /\
eq_or_disjoint q1 q... | val point_mul_g_double_vartime_noalloc:
out:point
-> scalar1:qelem -> q1:point
-> scalar2:qelem -> q2:point
-> table2:lbuffer uint64 (32ul *! 15ul) ->
Stack unit
(requires fun h ->
live h out /\ live h scalar1 /\ live h q1 /\
live h scalar2 /\ live h q2 /\ live h table2 /\
eq_or_disjoint q1 q... | let point_mul_g_double_vartime_noalloc out scalar1 q1 scalar2 q2 table2 =
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let l = 5ul in
[@inline_let] let table_len = 32ul in
[@inline_let] let bLen = 4ul in
[@inline_let] let bB... | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 230,
"start_col": 0,
"start_line": 204
} | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.PrecompBaseTable256.fsti.check... | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
out: Hacl.Impl.K256.Point.point ->
scalar1: Hacl.K256.Scalar.qelem ->
q1: Hacl.Impl.K256.Point.point ->
scalar2: Hacl.K256.Scalar.qelem ->
q2: Hacl.Impl.K256.Point.point ->
table2: Lib.Buffer.lbuffer Lib.IntTypes.uint64 (32ul *! 15ul)
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint64",
"Lib.IntTypes.op_Star_Bang",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"FStar.UInt32.__uint_to_t",
"Spec.Exponentiation.exp_double_fw_lemma",
"Spec.K256.PointOps.proj_point",
"Spec.K256.mk_k256_con... | [] | false | true | false | false | false | let point_mul_g_double_vartime_noalloc out scalar1 q1 scalar2 q2 table2 =
| [@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let l = 5ul in
[@@ inline_let ]let table_len = 32ul in
[@@ inline_let ]let bLen = 4ul in
[@@ inline_let ]let bBits = 256ul in
assert_norm (pow2 (v l) == v table_len);
let h0 = ST.get ()... | false |
FStar.LexicographicOrdering.fst | FStar.LexicographicOrdering.lex_to_lex_t | val lex_to_lex_t (#a:Type u#a) (#b:a -> Type u#b)
(r_a:binrel u#a u#ra a)
(r_b:(x:a -> binrel u#b u#rb (b x)))
(t1 t2:(x:a & b x))
(p:lex_aux r_a r_b t1 t2)
: squash (lex_t r_a r_b t1 t2) | val lex_to_lex_t (#a:Type u#a) (#b:a -> Type u#b)
(r_a:binrel u#a u#ra a)
(r_b:(x:a -> binrel u#b u#rb (b x)))
(t1 t2:(x:a & b x))
(p:lex_aux r_a r_b t1 t2)
: squash (lex_t r_a r_b t1 t2) | let lex_to_lex_t #a #b r_a r_b t1 t2 p =
let left (p:squash (r_a (dfst t1) (dfst t2)))
: squash (lex_t r_a r_b t1 t2)
= bind_squash p (fun p ->
return_squash (Left_lex #a #b #r_a #r_b (dfst t1) (dfst t2) (dsnd t1) (dsnd t2) p)) in
let right (p:(dfst t1 == dfst t2 /\ (squash (r_b (dfst t1) (dsnd t1)... | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 120,
"start_col": 0,
"start_line": 103
} | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.LexicographicOrdering.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r_a: FStar.WellFounded.binrel a ->
r_b: (x: a -> FStar.WellFounded.binrel (b x)) ->
t1: Prims.dtuple2 a (fun x -> b x) ->
t2: Prims.dtuple2 a (fun x -> b x) ->
p: FStar.LexicographicOrdering.lex_aux r_a r_b t1 t2
-> Prims.squash (FStar.LexicographicOrdering.lex_t r_a r_b t1 t2) | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"Prims.dtuple2",
"FStar.LexicographicOrdering.lex_aux",
"FStar.Squash.bind_squash",
"Prims.sum",
"Prims.squash",
"FStar.Pervasives.dfst",
"Prims.l_and",
"Prims.eq2",
"FStar.Pervasives.dsnd",
"FStar.LexicographicOrdering.lex_t",
"Prims.pair",
"Prims.Mkdtuple2",
"... | [] | false | false | true | false | false | let lex_to_lex_t #a #b r_a r_b t1 t2 p =
| let left (p: squash (r_a (dfst t1) (dfst t2))) : squash (lex_t r_a r_b t1 t2) =
bind_squash p
(fun p -> return_squash (Left_lex #a #b #r_a #r_b (dfst t1) (dfst t2) (dsnd t1) (dsnd t2) p))
in
let right (p: (dfst t1 == dfst t2 /\ (squash (r_b (dfst t1) (dsnd t1) (dsnd t2)))))
: squash (lex_t r_a r_b t1 t2) =
... | false |
FStar.LexicographicOrdering.fst | FStar.LexicographicOrdering.lex_t_wf_aux | val lex_t_wf_aux
(#a: Type u#a)
(#b: (a -> Type u#b))
(#r_a: binrel u#a u#ra a)
(#r_b: (x: a -> binrel u#b u#rb (b x)))
(x: a)
(acc_x: acc r_a x)
(wf_b: (x0: a{closure r_a x0 x} -> well_founded (r_b x0)))
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
... | val lex_t_wf_aux
(#a: Type u#a)
(#b: (a -> Type u#b))
(#r_a: binrel u#a u#ra a)
(#r_b: (x: a -> binrel u#b u#rb (b x)))
(x: a)
(acc_x: acc r_a x)
(wf_b: (x0: a{closure r_a x0 x} -> well_founded (r_b x0)))
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
... | let rec lex_t_wf_aux (#a:Type u#a)
(#b:a -> Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:(x:a -> binrel u#b u#rb (b x)))
(x:a)
(acc_x:acc r_a x) //x and accessibility of x
(wf_b:(x0:a{closure r_a x... | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 92,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.LexicographicOrdering.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
x: a ->
acc_x: FStar.WellFounded.acc r_a x ->
wf_b:
(x0: a{FStar.ReflexiveTransitiveClosure.closure r_a x0 x}
-> FStar.WellFounded.well_founded (r_b x0)) ->
y: b x ->
acc_y: FStar.WellFounded.acc (r_b x) y ->
t: Prims.dtuple2 a (fun x -> b x) ->
p_t: FStar.LexicographicOrder... | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.acc",
"FStar.ReflexiveTransitiveClosure.closure",
"FStar.WellFounded.well_founded",
"Prims.dtuple2",
"FStar.LexicographicOrdering.lex_t",
"Prims.Mkdtuple2",
"FStar.WellFounded.AccIntro",
"FStar.LexicographicOrdering.lex_t_wf_aux"
] | [
"recursion"
] | false | false | false | false | false | let rec lex_t_wf_aux
(#a: Type u#a)
(#b: (a -> Type u#b))
(#r_a: binrel u#a u#ra a)
(#r_b: (x: a -> binrel u#b u#rb (b x)))
(x: a)
(acc_x: acc r_a x)
(wf_b: (x0: a{closure r_a x0 x} -> well_founded (r_b x0)))
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
... | match p_t with
| Left_lex x_t _ y_t _ p_a ->
AccIntro (lex_t_wf_aux x_t (match acc_x with | AccIntro f -> f x_t p_a) wf_b y_t (wf_b x_t y_t))
| Right_lex _ _ _ _ ->
let rec lex_t_wf_aux_y
(y: b x)
(acc_y: acc (r_b x) y)
(t: (x: a & b x))
(p_t: lex_t r_a r_b t (| x, y |))
: Tot ... | false |
FStar.LexicographicOrdering.fst | FStar.LexicographicOrdering.lex_t_non_dep_wf | val lex_t_non_dep_wf (#a:Type u#a)
(#b:Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:binrel u#b u#rb b)
(wf_a:well_founded r_a)
(wf_b:well_founded r_b)
: well_founded (lex_t_non_dep r_a r_b) | val lex_t_non_dep_wf (#a:Type u#a)
(#b:Type u#b)
(#r_a:binrel u#a u#ra a)
(#r_b:binrel u#b u#rb b)
(wf_a:well_founded r_a)
(wf_b:well_founded r_b)
: well_founded (lex_t_non_dep r_a r_b) | let lex_t_non_dep_wf #a #b #r_a #r_b wf_a wf_b =
let rec get_acc (t:a & b) (p:acc (lex_t r_a (fun _ -> r_b)) (tuple_to_dep_tuple t))
: Tot (acc (lex_t_non_dep r_a r_b) t)
(decreases p)
= let get_acc_aux (t1:a & b) (p_dep:lex_t_non_dep r_a r_b t1 t)
: (p1:acc (lex_t r_a (fun _ -> r_b)) (tuple... | {
"file_name": "ulib/FStar.LexicographicOrdering.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 132,
"start_col": 0,
"start_line": 123
} | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.fst.checked",
"FStar.Squash.fsti.checked",
"FStar.ReflexiveTransitiveClosure.fsti.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.LexicographicOrdering.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Squash",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.ReflexiveTransitiveClosure",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.WellFounded",
"short_module": null
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | wf_a: FStar.WellFounded.well_founded r_a -> wf_b: FStar.WellFounded.well_founded r_b
-> FStar.WellFounded.well_founded (FStar.LexicographicOrdering.lex_t_non_dep r_a r_b) | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.Pervasives.Native.tuple2",
"FStar.LexicographicOrdering.lex_t_wf",
"FStar.LexicographicOrdering.tuple_to_dep_tuple",
"FStar.WellFounded.acc",
"FStar.LexicographicOrdering.lex_t_non_dep",
"Prims.dtuple2",
"FStar.LexicographicOrderin... | [] | false | false | false | false | false | let lex_t_non_dep_wf #a #b #r_a #r_b wf_a wf_b =
| let rec get_acc (t: a & b) (p: acc (lex_t r_a (fun _ -> r_b)) (tuple_to_dep_tuple t))
: Tot (acc (lex_t_non_dep r_a r_b) t) (decreases p) =
let get_acc_aux (t1: a & b) (p_dep: lex_t_non_dep r_a r_b t1 t)
: (p1: acc (lex_t r_a (fun _ -> r_b)) (tuple_to_dep_tuple t1) {p1 << p}) =
match p with | AccIntro f... | false |
Vale.Transformers.InstructionReorder.fst | Vale.Transformers.InstructionReorder.lemma_machine_eval_ins_st_equiv_states | val lemma_machine_eval_ins_st_equiv_states (i: ins) (s1 s2: machine_state)
: Lemma (requires (equiv_states s1 s2))
(ensures (equiv_states (run (machine_eval_ins_st i) s1) (run (machine_eval_ins_st i) s2))) | val lemma_machine_eval_ins_st_equiv_states (i: ins) (s1 s2: machine_state)
: Lemma (requires (equiv_states s1 s2))
(ensures (equiv_states (run (machine_eval_ins_st i) s1) (run (machine_eval_ins_st i) s2))) | let lemma_machine_eval_ins_st_equiv_states (i : ins) (s1 s2 : machine_state) :
Lemma
(requires (equiv_states s1 s2))
(ensures (
equiv_states
(run (machine_eval_ins_st i) s1)
(run (machine_eval_ins_st i) s2))) =
let s1_orig, s2_orig = s1, s2 in
let s1_final = run (machine_eval_i... | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.InstructionReorder.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 55,
"end_line": 404,
"start_col": 0,
"start_line": 365
} | (**
This module defines a transformer that performs safe instruction
reordering.
Example:
The following set of instructions can be reordered in any order
without any observable change in behavior:
mov rax, 10
mov rbx, 3
Usage:
Actual vale-tool or user-facing code should pr... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.Bytes_Code_s.fst.checked",
"Vale.Transformers.Lo... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "Vale.Transformers.BoundedInstructionEffects",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.Locations",
"short_module": null
},
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
i: Vale.X64.Machine_Semantics_s.ins ->
s1: Vale.X64.Machine_Semantics_s.machine_state ->
s2: Vale.X64.Machine_Semantics_s.machine_state
-> FStar.Pervasives.Lemma (requires Vale.Transformers.InstructionReorder.equiv_states s1 s2)
(ensures
Vale.Transformers.InstructionReorder.equiv_states (Va... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Machine_Semantics_s.machine_state",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__args",
"Vale.X64.Mach... | [] | false | false | true | false | false | let lemma_machine_eval_ins_st_equiv_states (i: ins) (s1 s2: machine_state)
: Lemma (requires (equiv_states s1 s2))
(ensures (equiv_states (run (machine_eval_ins_st i) s1) (run (machine_eval_ins_st i) s2))) =
| let s1_orig, s2_orig = s1, s2 in
let s1_final = run (machine_eval_ins_st i) s1 in
let s2_final = run (machine_eval_ins_st i) s2 in
match i with
| Instr it oprs ann -> lemma_eval_instr_equiv_states it oprs ann s1 s2
| Push _ _ -> assert_spinoff (equiv_states_ext s1_final s2_final)
| Pop dst t ->
let stack_op = OStack ... | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.match_returns_ascription_cmp | val match_returns_ascription_cmp : comparator_for match_returns_ascription | val match_returns_ascription_cmp : comparator_for match_returns_ascription | let rec term_cmp t1 t2 =
pack_inspect_inv t1;
pack_inspect_inv t2;
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
match tv1, tv2 with
| Tv_Unsupp, _
| _, Tv_Unsupp -> Unknown
| Tv_Var v1, Tv_Var v2 -> namedv_cmp v1 v2
| Tv_BVar v1, Tv_BVar v2 -> bv_cmp v1 v2
| Tv_FVar f1, Tv_FVar f2 -> fv_cmp... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 379,
"start_col": 0,
"start_line": 242
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Reflection.V2.TermEq.comparator_for FStar.Stubs.Reflection.Types.match_returns_ascription | Prims.Tot | [
"total"
] | [
"term_cmp",
"arg_cmp",
"aqual_cmp",
"match_returns_ascription_cmp",
"binder_cmp",
"comp_cmp",
"br_cmp",
"pat_cmp",
"pat_arg_cmp"
] | [
"FStar.Stubs.Reflection.Types.match_returns_ascription",
"FStar.Stubs.Reflection.Types.binder",
"FStar.Pervasives.either",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.Types.comp",
"FStar.Pervasives.Native.option",
"Prims.bool",
"FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp",
"FStar.Per... | [
"mutual recursion"
] | false | false | false | true | false | let rec match_returns_ascription_cmp asc1 asc2 =
| let b1, (tc1, tacopt1, eq1) = asc1 in
let b2, (tc2, tacopt2, eq2) = asc2 in
binder_cmp b1 b2 &&& either_dec_cmp asc1 asc2 term_cmp comp_cmp tc1 tc2 &&&
opt_dec_cmp asc1 asc2 term_cmp tacopt1 tacopt2 &&&
eq_cmp eq1 eq2 | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.br_cmp | val br_cmp : comparator_for branch | val br_cmp : comparator_for branch | let rec term_cmp t1 t2 =
pack_inspect_inv t1;
pack_inspect_inv t2;
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
match tv1, tv2 with
| Tv_Unsupp, _
| _, Tv_Unsupp -> Unknown
| Tv_Var v1, Tv_Var v2 -> namedv_cmp v1 v2
| Tv_BVar v1, Tv_BVar v2 -> bv_cmp v1 v2
| Tv_FVar f1, Tv_FVar f2 -> fv_cmp... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 379,
"start_col": 0,
"start_line": 242
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Reflection.V2.TermEq.comparator_for FStar.Stubs.Reflection.V2.Data.branch | Prims.Tot | [
"total"
] | [
"term_cmp",
"arg_cmp",
"aqual_cmp",
"match_returns_ascription_cmp",
"binder_cmp",
"comp_cmp",
"br_cmp",
"pat_cmp",
"pat_arg_cmp"
] | [
"FStar.Stubs.Reflection.V2.Data.branch",
"FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp",
"FStar.Stubs.Reflection.V2.Data.pattern",
"FStar.Stubs.Reflection.Types.term",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.Native.snd",
"FStar.Reflection.V2.TermEq.pat_cmp",
"FStar.Reflection.V2.TermEq.term_cmp"... | [
"mutual recursion"
] | false | false | false | true | false | let rec br_cmp br1 br2 =
| pat_cmp (fst br1) (fst br2) &&& term_cmp (snd br1) (snd br2) | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.pat_arg_cmp | val pat_arg_cmp : comparator_for (pattern & bool) | val pat_arg_cmp : comparator_for (pattern & bool) | let rec term_cmp t1 t2 =
pack_inspect_inv t1;
pack_inspect_inv t2;
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
match tv1, tv2 with
| Tv_Unsupp, _
| _, Tv_Unsupp -> Unknown
| Tv_Var v1, Tv_Var v2 -> namedv_cmp v1 v2
| Tv_BVar v1, Tv_BVar v2 -> bv_cmp v1 v2
| Tv_FVar f1, Tv_FVar f2 -> fv_cmp... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 379,
"start_col": 0,
"start_line": 242
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Reflection.V2.TermEq.comparator_for (FStar.Stubs.Reflection.V2.Data.pattern * Prims.bool) | Prims.Tot | [
"total"
] | [
"term_cmp",
"arg_cmp",
"aqual_cmp",
"match_returns_ascription_cmp",
"binder_cmp",
"comp_cmp",
"br_cmp",
"pat_cmp",
"pat_arg_cmp"
] | [
"FStar.Pervasives.Native.tuple2",
"FStar.Stubs.Reflection.V2.Data.pattern",
"Prims.bool",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp",
"FStar.Reflection.V2.TermEq.pat_cmp",
"FStar.Reflection.V2.TermEq.eq_cmp",
"FStar.Reflection.V2.TermEq.cmpres"
] | [
"mutual recursion"
] | false | false | false | true | false | let rec pat_arg_cmp (p1, b1) (p2, b2) =
| pat_cmp p1 p2 &&& eq_cmp b1 b2 | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.pat_cmp | val pat_cmp : comparator_for pattern | val pat_cmp : comparator_for pattern | let rec term_cmp t1 t2 =
pack_inspect_inv t1;
pack_inspect_inv t2;
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
match tv1, tv2 with
| Tv_Unsupp, _
| _, Tv_Unsupp -> Unknown
| Tv_Var v1, Tv_Var v2 -> namedv_cmp v1 v2
| Tv_BVar v1, Tv_BVar v2 -> bv_cmp v1 v2
| Tv_FVar f1, Tv_FVar f2 -> fv_cmp... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 379,
"start_col": 0,
"start_line": 242
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Reflection.V2.TermEq.comparator_for FStar.Stubs.Reflection.V2.Data.pattern | Prims.Tot | [
"total"
] | [
"term_cmp",
"arg_cmp",
"aqual_cmp",
"match_returns_ascription_cmp",
"binder_cmp",
"comp_cmp",
"br_cmp",
"pat_cmp",
"pat_arg_cmp"
] | [
"FStar.Stubs.Reflection.V2.Data.pattern",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Sealed.sealed",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Data.ppname_t",
"FStar.Reflection.V2.TermEq.Eq",
"Prims.unit",
"FStar.Sealed.sealed_singl",
"Prims.string",
"FStar.Stubs.Reflection.V... | [
"mutual recursion"
] | false | false | false | true | false | let rec pat_cmp p1 p2 =
| match p1, p2 with
| Pat_Var x1 s1, Pat_Var x2 s2 ->
sealed_singl x1 x2;
sealed_singl s1 s2;
Eq
| Pat_Constant x1, Pat_Constant x2 -> const_cmp x1 x2
| Pat_Dot_Term x1, Pat_Dot_Term x2 -> opt_dec_cmp p1 p2 term_cmp x1 x2
| Pat_Cons head1 us1 subpats1, Pat_Cons head2 us2 subpats2 ->
fv_cmp head1 head2 &&& opt_dec... | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.comp_cmp | val comp_cmp : comparator_for comp | val comp_cmp : comparator_for comp | let rec term_cmp t1 t2 =
pack_inspect_inv t1;
pack_inspect_inv t2;
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
match tv1, tv2 with
| Tv_Unsupp, _
| _, Tv_Unsupp -> Unknown
| Tv_Var v1, Tv_Var v2 -> namedv_cmp v1 v2
| Tv_BVar v1, Tv_BVar v2 -> bv_cmp v1 v2
| Tv_FVar f1, Tv_FVar f2 -> fv_cmp... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 379,
"start_col": 0,
"start_line": 242
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | FStar.Reflection.V2.TermEq.comparator_for FStar.Stubs.Reflection.Types.comp | Prims.Tot | [
"total"
] | [
"term_cmp",
"arg_cmp",
"aqual_cmp",
"match_returns_ascription_cmp",
"binder_cmp",
"comp_cmp",
"br_cmp",
"pat_cmp",
"pat_arg_cmp"
] | [
"FStar.Stubs.Reflection.Types.comp",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.V2.Data.comp_view",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Reflection.V2.TermEq.term_cmp",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V2.TermEq.op_Amp_Amp_Amp",
"FStar.Pervasives.Native.tup... | [
"mutual recursion"
] | false | false | false | true | false | let rec comp_cmp c1 c2 =
| let cv1 = inspect_comp c1 in
let cv2 = inspect_comp c2 in
pack_inspect_comp_inv c1;
pack_inspect_comp_inv c2;
match cv1, cv2 with
| C_Total t1, C_Total t2 | C_GTotal t1, C_GTotal t2 -> term_cmp t1 t2
| C_Lemma pre1 post1 pat1, C_Lemma pre2 post2 pat2 ->
term_cmp pre1 pre2 &&& term_cmp post1 post2 &&& term_cmp pat1 pa... | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.lemma_label_bool | val lemma_label_bool (r:range) (msg:string) (b:bool) : Lemma
(requires label r msg b)
(ensures b)
[SMTPat (label r msg b)] | val lemma_label_bool (r:range) (msg:string) (b:bool) : Lemma
(requires label r msg b)
(ensures b)
[SMTPat (label r msg b)] | let lemma_label_bool r msg b = lemma_label_Type0 r msg b | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 56,
"end_line": 13,
"start_col": 0,
"start_line": 13
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= () | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.HeapImpl",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> msg: Prims.string -> b: Prims.bool
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.label r msg b)
(ensures b)
[SMTPat (Vale.X64.QuickCodes.label r msg b)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Range.range",
"Prims.string",
"Prims.bool",
"Vale.X64.QuickCodes.lemma_label_Type0",
"Prims.b2t",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_label_bool r msg b =
| lemma_label_Type0 r msg b | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.empty_list_is_small | val empty_list_is_small (#a:Type) (x:list a) : Lemma
([] #a == x \/ [] #a << x) | val empty_list_is_small (#a:Type) (x:list a) : Lemma
([] #a == x \/ [] #a << x) | let rec empty_list_is_small #a x =
match x with
| [] -> ()
| h::t -> empty_list_is_small t | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 18,
"start_col": 0,
"start_line": 15
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.list a -> FStar.Pervasives.Lemma (ensures [] == x \/ [] << x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Vale.X64.QuickCodes.empty_list_is_small",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec empty_list_is_small #a x =
| match x with
| [] -> ()
| h :: t -> empty_list_is_small t | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.state_mod_eq | val state_mod_eq : m: Vale.X64.QuickCode.mod_t -> s1: Vale.X64.State.vale_state -> s2: Vale.X64.State.vale_state
-> Prims.logical | let state_mod_eq (m:mod_t) (s1 s2:vale_state) =
match m with
| Mod_None -> True
| Mod_ok -> s1.vs_ok == s2.vs_ok
| Mod_reg r -> eval_reg r s1 == eval_reg r s2
| Mod_flags -> s1.vs_flags == s2.vs_flags
| Mod_mem -> s1.vs_heap.vf_heap == s2.vs_heap.vf_heap
| Mod_mem_layout -> s1.vs_heap.vf_layout == s2.vs_h... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 30,
"start_col": 0,
"start_line": 20
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | m: Vale.X64.QuickCode.mod_t -> s1: Vale.X64.State.vale_state -> s2: Vale.X64.State.vale_state
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.mod_t",
"Vale.X64.State.vale_state",
"Prims.l_True",
"Prims.eq2",
"Prims.bool",
"Vale.X64.State.__proj__Mkvale_state__item__vs_ok",
"Vale.X64.Machine_s.reg",
"Vale.X64.Machine_s.t_reg",
"Vale.X64.State.eval_reg",
"Vale.X64.Flags.t",
"Vale.X64.State.__proj__Mkvale_state__item_... | [] | false | false | false | true | true | let state_mod_eq (m: mod_t) (s1 s2: vale_state) =
| match m with
| Mod_None -> True
| Mod_ok -> s1.vs_ok == s2.vs_ok
| Mod_reg r -> eval_reg r s1 == eval_reg r s2
| Mod_flags -> s1.vs_flags == s2.vs_flags
| Mod_mem -> s1.vs_heap.vf_heap == s2.vs_heap.vf_heap
| Mod_mem_layout -> s1.vs_heap.vf_layout == s2.vs_heap.vf_layout
| Mod_mem_heaplet n -> Map16.sel s1.vs_heap.vf_h... | false | |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_from1 | val update_state_mods_from1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s') | val update_state_mods_from1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s') | let update_state_mods_from1 (mods:mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s')
=
if not (mods_contains1 mods m0) then update_state_mods_not1 mods s' s m0 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 51,
"start_col": 0,
"start_line": 47
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mods: Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCodes.state_mod_eq m0 s' (Vale.X64.QuickCode.update_state_mods mods s' s))
(ensures
Vale.X64.Q... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.op_Negation",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.update_state_mods_not1",
"Prims.bool",
"Prims.unit",
"Vale.X64.QuickCodes.state_mod_eq",
"Vale.X64.QuickCode.update_state_mods",
"... | [] | false | false | true | false | false | let update_state_mods_from1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires state_mod_eq m0 s' (update_state_mods mods s' s))
(ensures mods_contains1 mods m0 \/ state_mod_eq m0 s s') =
| if not (mods_contains1 mods m0) then update_state_mods_not1 mods s' s m0 | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_refl | val update_state_mods_refl (mods: mods_t) (s: vale_state)
: Lemma (ensures state_eq (update_state_mods mods s s) s) | val update_state_mods_refl (mods: mods_t) (s: vale_state)
: Lemma (ensures state_eq (update_state_mods mods s s) s) | let rec update_state_mods_refl (mods:mods_t) (s:vale_state) : Lemma
(ensures state_eq (update_state_mods mods s s) s)
=
match mods with
| [] -> ()
| _::mods -> update_state_mods_refl mods s | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 44,
"end_line": 37,
"start_col": 0,
"start_line": 32
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | mods: Vale.X64.QuickCode.mods_t -> s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(ensures Vale.X64.State.state_eq (Vale.X64.QuickCode.update_state_mods mods s s) s) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"Vale.X64.QuickCodes.update_state_mods_refl",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Vale.X64.State.state_eq",
"Vale.X64.QuickCode.update_state_mods",
"Prims.Nil",
"FStar.Pervasives.patt... | [
"recursion"
] | false | false | true | false | false | let rec update_state_mods_refl (mods: mods_t) (s: vale_state)
: Lemma (ensures state_eq (update_state_mods mods s s) s) =
| match mods with
| [] -> ()
| _ :: mods -> update_state_mods_refl mods s | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_weaken | val update_state_mods_weaken (mods mods': mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s') | val update_state_mods_weaken (mods mods': mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s') | let update_state_mods_weaken (mods mods':mods_t) (s' s:vale_state) : Lemma
(requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s')
=
update_state_mods_from mods s' s;
let f1 (m0:mod_t) : Lemma (mods_contains1 mods' m0 \/ state_mod_eq m0 s s') =
... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 136,
"start_col": 0,
"start_line": 127
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mods: Vale.X64.QuickCode.mods_t ->
mods': Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCode.update_state_mods mods s' s == s' /\
Vale.X64.QuickCodes.mods_contains mods' mods)
(e... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.update_state_mods_to",
"Prims.unit",
"FStar.Classical.forall_intro",
"Vale.X64.QuickCode.mod_t",
"Prims.l_or",
"Prims.b2t",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.state_mod_eq",
"Prims.l_True",
"... | [] | false | false | true | false | false | let update_state_mods_weaken (mods mods': mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s' /\ mods_contains mods' mods)
(ensures update_state_mods mods' s' s == s') =
| update_state_mods_from mods s' s;
let f1 (m0: mod_t) : Lemma (mods_contains1 mods' m0 \/ state_mod_eq m0 s s') =
update_state_mods_weaken1 mods mods' s' s m0
in
FStar.Classical.forall_intro f1;
update_state_mods_to mods' s' s | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_from | val update_state_mods_from (mods: mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s')
(ensures
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s')) | val update_state_mods_from (mods: mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s')
(ensures
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s')) | let update_state_mods_from (mods:mods_t) (s' s:vale_state) : Lemma
(requires update_state_mods mods s' s == s')
(ensures (
forall (m0:mod_t).{:pattern mods_contains1 mods m0 \/ state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'
))
=
let f1 (m0:mod_t) : Lemma (mods_contains1 mods m0... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 76,
"start_col": 0,
"start_line": 66
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | mods: Vale.X64.QuickCode.mods_t -> s': Vale.X64.State.vale_state -> s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCode.update_state_mods mods s' s == s')
(ensures
forall (m0: Vale.X64.QuickCode.mod_t).
{:pattern
Vale.X64.QuickCodes.mods_contains1 mods... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"FStar.Classical.forall_intro",
"Vale.X64.QuickCode.mod_t",
"Prims.l_or",
"Prims.b2t",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.state_mod_eq",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasi... | [] | false | false | true | false | false | let update_state_mods_from (mods: mods_t) (s' s: vale_state)
: Lemma (requires update_state_mods mods s' s == s')
(ensures
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s')) =
| let f1 (m0: mod_t) : Lemma (mods_contains1 mods m0 \/ state_mod_eq m0 s s') =
update_state_mods_from1 mods s' s m0
in
FStar.Classical.forall_intro f1 | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_to | val update_state_mods_to (mods: mods_t) (s' s: vale_state)
: Lemma
(requires
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'))
(ensures state_eq s' (update_state_mods mods s' s)) | val update_state_mods_to (mods: mods_t) (s' s: vale_state)
: Lemma
(requires
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'))
(ensures state_eq s' (update_state_mods mods s' s)) | let update_state_mods_to (mods:mods_t) (s' s:vale_state) : Lemma
(requires (
forall (m0:mod_t).{:pattern mods_contains1 mods m0 \/ state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'
))
(ensures state_eq s' (update_state_mods mods s' s))
=
let s'' = update_state_mods mods s' s in
... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 107,
"start_col": 0,
"start_line": 78
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | mods: Vale.X64.QuickCode.mods_t -> s': Vale.X64.State.vale_state -> s: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(requires
forall (m0: Vale.X64.QuickCode.mod_t).
{:pattern
Vale.X64.QuickCodes.mods_contains1 mods m0\/Vale.X64.QuickCodes.state_mod_eq m0 s s'}
Vale.X... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.Arch.HeapImpl.heaplet_id",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.Lib.Map16.sel",
"Vale.Arch.HeapImpl.__proj__Mkvale_full_heap__item__vf_heaplets",
"Vale.X64.State.__proj__Mk... | [] | false | false | true | false | false | let update_state_mods_to (mods: mods_t) (s' s: vale_state)
: Lemma
(requires
(forall (m0: mod_t). {:pattern mods_contains1 mods m0\/state_mod_eq m0 s s'}
mods_contains1 mods m0 \/ state_mod_eq m0 s s'))
(ensures state_eq s' (update_state_mods mods s' s)) =
| let s'' = update_state_mods mods s' s in
let f1 (m0: mod_t) : Lemma (state_mod_eq m0 s' s'') = update_state_mods_to1 mods s' s m0 in
f1 Mod_ok;
f1 Mod_flags;
f1 Mod_mem;
f1 Mod_mem_layout;
f1 Mod_stack;
f1 Mod_stackTaint;
let f1_reg (r: reg)
: Lemma (ensures Regs.sel r s'.vs_regs == Regs.sel r s''.vs_regs)
[S... | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_weaken1 | val update_state_mods_weaken1 (mods mods': mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s')) | val update_state_mods_weaken1 (mods mods': mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s')) | let rec update_state_mods_weaken1 (mods mods':mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s'))
=
match mods with
| [] -> ()
| _::mods ->
if mods_contains mods... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 125,
"start_col": 0,
"start_line": 117
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mods: Vale.X64.QuickCode.mods_t ->
mods': Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires
(Vale.X64.QuickCodes.mods_contains1 mods m0 \/ Vale.X64.QuickCodes.state_mod_eq m0... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"Prims.op_AmpAmp",
"Vale.X64.QuickCodes.mods_contains",
"Vale.X64.QuickCodes.mods_contains1",
"Vale.X64.QuickCodes.update_state_mods_weaken1",
"Prims.bool",
"Prims.unit",
"Prims.l_and",
"Prims.l... | [
"recursion"
] | false | false | true | false | false | let rec update_state_mods_weaken1 (mods mods': mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires (mods_contains1 mods m0 \/ state_mod_eq m0 s s') /\ mods_contains mods' mods)
(ensures (mods_contains1 mods' m0 \/ state_mod_eq m0 s s')) =
| match mods with
| [] -> ()
| _ :: mods ->
if mods_contains mods' mods && mods_contains1 mods m0
then update_state_mods_weaken1 mods mods' s' s m0 | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_to1 | val update_state_mods_to1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s)) | val update_state_mods_to1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s)) | let rec update_state_mods_to1 (mods:mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s))
=
match mods with
| [] -> ()
| r::mods' ->
let b = r =!= m0 \/ state_mod_eq m0 s s' in
let goal (_... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 64,
"start_col": 0,
"start_line": 53
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mods: Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCodes.mods_contains1 mods m0 \/ Vale.X64.QuickCodes.state_mod_eq m0 s s')
(ensures
Vale.X64.Qu... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"FStar.Classical.or_elim",
"Prims.l_not",
"Prims.squash",
"Prims.unit",
"Prims.l_True",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Vale.X64.QuickCodes.update_state_mods_to1",
"Prims.l_or",
"V... | [
"recursion"
] | false | false | true | false | false | let rec update_state_mods_to1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires mods_contains1 mods m0 \/ state_mod_eq m0 s s')
(ensures state_mod_eq m0 s' (update_state_mods mods s' s)) =
| match mods with
| [] -> ()
| r :: mods' ->
let b = r =!= m0 \/ state_mod_eq m0 s s' in
let goal (_: squash (b \/ ~b)) : Type0 = state_mod_eq m0 s' (update_state_mods mods s' s) in
let l1 (_: squash b) : Lemma (goal ()) = update_state_mods_to1 mods' s' s m0 in
let l2 (_: squash (~b)) : Lemma (goal ()) = () in
... | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.qInlineIf_proof | val qInlineIf_proof (#a:Type) (#c1:code) (#c2:code) (b:bool) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_InlineIf b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (if_code b c1 c2) s0 f... | val qInlineIf_proof (#a:Type) (#c1:code) (#c2:code) (b:bool) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_InlineIf b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (if_code b c1 c2) s0 f... | let qInlineIf_proof #a #c1 #c2 b qc1 qc2 mods s0 k =
if b then
(
let (sM, f0, g) = QProc?.proof qc1 s0 k in
update_state_mods_weaken qc1.mods mods sM s0;
(sM, f0, g)
)
else
(
let (sM, f0, g) = QProc?.proof qc2 s0 k in
update_state_mods_weaken qc2.mods mods sM s0;
(sM, f0, g)
) | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 238,
"start_col": 0,
"start_line": 226
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
b: Prims.bool ->
qc1: Vale.X64.QuickCode.quickCode a c1 ->
qc2: Vale.X64.QuickCode.quickCode a c2 ->
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * a) | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.code",
"Prims.bool",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"Vale.X64.QuickCodes.update_state_mods_weaken",
"Vale.X64.Qui... | [] | false | false | false | false | false | let qInlineIf_proof #a #c1 #c2 b qc1 qc2 mods s0 k =
| if b
then
(let sM, f0, g = QProc?.proof qc1 s0 k in
update_state_mods_weaken qc1.mods mods sM s0;
(sM, f0, g))
else
(let sM, f0, g = QProc?.proof qc2 s0 k in
update_state_mods_weaken qc2.mods mods sM s0;
(sM, f0, g)) | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_trans | val update_state_mods_trans (mods: mods_t) (s0 s1 s2: vale_state)
: Lemma (requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2) | val update_state_mods_trans (mods: mods_t) (s0 s1 s2: vale_state)
: Lemma (requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2) | let update_state_mods_trans (mods:mods_t) (s0 s1 s2:vale_state) : Lemma
(requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2)
=
update_state_mods_from mods s1 s0;
update_state_mods_from mods s2 s1;
update_state_mods_to mods s2 s0 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 115,
"start_col": 0,
"start_line": 109
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.State.vale_state ->
s1: Vale.X64.State.vale_state ->
s2: Vale.X64.State.vale_state
-> FStar.Pervasives.Lemma
(requires
Vale.X64.QuickCode.update_state_mods mods s1 s0 == s1 /\
Vale.X64.QuickCode.update_state_mods mods s2 s1 == s2)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.update_state_mods_to",
"Prims.unit",
"Vale.X64.QuickCodes.update_state_mods_from",
"Prims.l_and",
"Prims.eq2",
"Vale.X64.QuickCode.update_state_mods",
"Prims.squash",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let update_state_mods_trans (mods: mods_t) (s0 s1 s2: vale_state)
: Lemma (requires update_state_mods mods s1 s0 == s1 /\ update_state_mods mods s2 s1 == s2)
(ensures update_state_mods mods s2 s0 == s2) =
| update_state_mods_from mods s1 s0;
update_state_mods_from mods s2 s1;
update_state_mods_to mods s2 s0 | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.qblock_proof | val qblock_proof (#a:Type) (#cs:codes) (qcs:va_state -> GTot (quickCodes a cs)) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_block qcs mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (block cs) s0 f0 sM /\ update_state_mods mods sM s0 ==... | val qblock_proof (#a:Type) (#cs:codes) (qcs:va_state -> GTot (quickCodes a cs)) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_block qcs mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (block cs) s0 f0 sM /\ update_state_mods mods sM s0 ==... | let qblock_proof #a #cs qcs mods s0 k =
wp_sound cs (qcs s0) mods k s0 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 224,
"start_col": 0,
"start_line": 223
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
qcs: (_: Vale.X64.Decls.va_state -> Prims.GTot (Vale.X64.QuickCodes.quickCodes a cs)) ->
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * a) | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.codes",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.QuickCodes.wp_sound",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.Decls.va_fuel"
] | [] | false | false | false | false | false | let qblock_proof #a #cs qcs mods s0 k =
| wp_sound cs (qcs s0) mods k s0 | false |
Spec.HMAC_DRBG.Test.Vectors.fst | Spec.HMAC_DRBG.Test.Vectors.is_supported_alg | val is_supported_alg : _: Spec.Hash.Definitions.hash_alg -> Prims.bool | let is_supported_alg = function
| SHA1 | SHA2_256 | SHA2_384 | SHA2_512 -> true
| _ -> false | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 15,
"start_col": 0,
"start_line": 13
} | module Spec.HMAC_DRBG.Test.Vectors
open Lib.Meta
open Spec.Hash.Definitions
#set-options "--fuel 0 --ifuel 0"
///
/// HMAC-DRBG test vectors from NIST CAVP
/// https://csrc.nist.gov/projects/cryptographic-algorithm-validation-program/random-number-generators#DRBG
/// | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.HMAC_DRBG.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG.Test",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Spec.Hash.Definitions.hash_alg -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.bool"
] | [] | false | false | false | true | false | let is_supported_alg =
| function
| SHA1 | SHA2_256 | SHA2_384 | SHA2_512 -> true
| _ -> false | false | |
Spec.HMAC_DRBG.Test.Vectors.fst | Spec.HMAC_DRBG.Test.Vectors.supported_alg | val supported_alg : Type0 | let supported_alg = a:hash_alg{ is_supported_alg a } | {
"file_name": "specs/drbg/Spec.HMAC_DRBG.Test.Vectors.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 17,
"start_col": 0,
"start_line": 17
} | module Spec.HMAC_DRBG.Test.Vectors
open Lib.Meta
open Spec.Hash.Definitions
#set-options "--fuel 0 --ifuel 0"
///
/// HMAC-DRBG test vectors from NIST CAVP
/// https://csrc.nist.gov/projects/cryptographic-algorithm-validation-program/random-number-generators#DRBG
///
let is_supported_alg = function
| SHA1 | SHA2_... | {
"checked_file": "/",
"dependencies": [
"Spec.Hash.Definitions.fst.checked",
"prims.fst.checked",
"Lib.Meta.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "Spec.HMAC_DRBG.Test.Vectors.fst"
} | [
{
"abbrev": false,
"full_module": "Spec.Hash.Definitions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Lib.Meta",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.HMAC_DRBG.Test",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.HMAC_DRBG.Test.Vectors.is_supported_alg"
] | [] | false | false | false | true | true | let supported_alg =
| a: hash_alg{is_supported_alg a} | false | |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.wp_sound | val wp_sound (#a:Type0) (cs:codes) (qcs:quickCodes a cs) (mods:mods_t) (k:va_state -> a -> Type0) (s0:va_state)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp cs qcs mods k s0)
(ensures fun (sN, fN, gN) ->
eval (Block cs) s0 fN sN /\ update_state_mods mods sN s0 == sN /\ state_inv sN /\ k sN gN... | val wp_sound (#a:Type0) (cs:codes) (qcs:quickCodes a cs) (mods:mods_t) (k:va_state -> a -> Type0) (s0:va_state)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp cs qcs mods k s0)
(ensures fun (sN, fN, gN) ->
eval (Block cs) s0 fN sN /\ update_state_mods mods sN s0 == sN /\ state_inv sN /\ k sN gN... | let rec wp_sound #a cs qcs mods k s0 =
let qcs0 = qcs in
match qcs with
| QEmpty g ->
update_state_mods_refl mods s0;
let (sN, fN) = va_lemma_empty_total s0 [] in (sN, fN, g)
| QSeq _ _ qc qcs ->
let QProc _ _ wp1' proof = qc in
let c::cs = cs in
let k' = wp_Seq cs qcs mods k in
... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 221,
"start_col": 0,
"start_line": 164
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
cs: Vale.X64.QuickCodes.codes ->
qcs: Vale.X64.QuickCodes.quickCodes a cs ->
mods: Vale.X64.QuickCode.mods_t ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0) ->
s0: Vale.X64.Decls.va_state
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * a) | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.codes",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.tuple2",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_l... | [
"recursion"
] | false | false | false | false | false | let rec wp_sound #a cs qcs mods k s0 =
| let qcs0 = qcs in
match qcs with
| QEmpty g ->
update_state_mods_refl mods s0;
let sN, fN = va_lemma_empty_total s0 [] in
(sN, fN, g)
| QSeq _ _ qc qcs ->
let QProc _ _ wp1' proof = qc in
let c :: cs = cs in
let k' = wp_Seq cs qcs mods k in
let sM, fM, gM = proof s0 k' in
let sN, fN, gN = wp_sound cs qc... | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.qAssertLemma | val qAssertLemma (p:Type0) : tAssertLemma p | val qAssertLemma (p:Type0) : tAssertLemma p | let qAssertLemma p = fun () -> () | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 310,
"start_col": 0,
"start_line": 310
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Type0 -> Vale.X64.QuickCodes.tAssertLemma p | Prims.Tot | [
"total"
] | [] | [
"Prims.unit"
] | [] | false | false | false | true | false | let qAssertLemma p =
| fun () -> () | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.update_state_mods_not1 | val update_state_mods_not1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s)) | val update_state_mods_not1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s)) | let rec update_state_mods_not1 (mods:mods_t) (s' s:vale_state) (m0:mod_t) : Lemma
(requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s))
=
match mods with
| [] -> ()
| _::mods -> update_state_mods_not1 mods s' s m0 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 45,
"start_col": 0,
"start_line": 39
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
mods: Vale.X64.QuickCode.mods_t ->
s': Vale.X64.State.vale_state ->
s: Vale.X64.State.vale_state ->
m0: Vale.X64.QuickCode.mod_t
-> FStar.Pervasives.Lemma
(requires Prims.op_Negation (Vale.X64.QuickCodes.mods_contains1 mods m0))
(ensures
Vale.X64.QuickCodes.state_mod_eq m0 s (Vale... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCode.mod_t",
"Prims.list",
"Vale.X64.QuickCodes.update_state_mods_not1",
"Prims.unit",
"Prims.b2t",
"Prims.op_Negation",
"Vale.X64.QuickCodes.mods_contains1",
"Prims.squash",
"Vale.X64.QuickCodes.state_mod_eq",
"Vale.X64.... | [
"recursion"
] | false | false | true | false | false | let rec update_state_mods_not1 (mods: mods_t) (s' s: vale_state) (m0: mod_t)
: Lemma (requires not (mods_contains1 mods m0))
(ensures state_mod_eq m0 s (update_state_mods mods s' s)) =
| match mods with
| [] -> ()
| _ :: mods -> update_state_mods_not1 mods s' s m0 | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.qIf_proof | val qIf_proof (#a:Type) (#c1:code) (#c2:code) (b:cmp) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_If b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (IfElse (cmp_to_ocmp b) c1 c2) s0 f... | val qIf_proof (#a:Type) (#c1:code) (#c2:code) (b:cmp) (qc1:quickCode a c1) (qc2:quickCode a c2) (mods:mods_t) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_If b qc1 qc2 mods s0 k)
(ensures fun (sM, f0, g) ->
eval_code (IfElse (cmp_to_ocmp b) c1 c2) s0 f... | let qIf_proof #a #c1 #c2 b qc1 qc2 mods s0 k =
( match b with
| Cmp_eq o1 o2 -> lemma_valid_cmp_eq s0 o1 o2; lemma_cmp_eq s0 o1 o2
| Cmp_ne o1 o2 -> lemma_valid_cmp_ne s0 o1 o2; lemma_cmp_ne s0 o1 o2
| Cmp_le o1 o2 -> lemma_valid_cmp_le s0 o1 o2; lemma_cmp_le s0 o1 o2
| Cmp_ge o1 o2 -> lemma_valid_cmp... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 266,
"start_col": 0,
"start_line": 240
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
b: Vale.X64.QuickCodes.cmp ->
qc1: Vale.X64.QuickCode.quickCode a c1 ->
qc2: Vale.X64.QuickCode.quickCode a c2 ->
mods: Vale.X64.QuickCode.mods_t ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fue... | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.cmp",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.QuickCodes.eval_cmp",
"Vale.X64.State.vale_state",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"Vale.X64.QuickC... | [] | false | false | false | false | false | let qIf_proof #a #c1 #c2 b qc1 qc2 mods s0 k =
| (match b with
| Cmp_eq o1 o2 ->
lemma_valid_cmp_eq s0 o1 o2;
lemma_cmp_eq s0 o1 o2
| Cmp_ne o1 o2 ->
lemma_valid_cmp_ne s0 o1 o2;
lemma_cmp_ne s0 o1 o2
| Cmp_le o1 o2 ->
lemma_valid_cmp_le s0 o1 o2;
lemma_cmp_le s0 o1 o2
| Cmp_ge o1 o2 ->
lemma_valid_cmp_ge s0 o1 o2;
lemma_cmp_ge... | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.call_QPURE | val call_QPURE
(#a: Type0)
(#cs: codes)
(r: range)
(msg: string)
(pre: ((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l: (unit -> PURE unit (as_pure_wp pre)))
(qcs: quickCodes a cs)
(mods: mods_t)
(k: (vale_state -> a -> Type0))
(s0: vale_state)
... | val call_QPURE
(#a: Type0)
(#cs: codes)
(r: range)
(msg: string)
(pre: ((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l: (unit -> PURE unit (as_pure_wp pre)))
(qcs: quickCodes a cs)
(mods: mods_t)
(k: (vale_state -> a -> Type0))
(s0: vale_state)
... | let call_QPURE
(#a:Type0) (#cs:codes) (r:range) (msg:string) (pre:((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l:unit -> PURE unit (as_pure_wp pre)) (qcs:quickCodes a cs) (mods:mods_t) (k:vale_state -> a -> Type0) (s0:vale_state)
: Lemma
(requires
(forall (p:unit -> GTot Type0).{:pattern pre... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 6,
"end_line": 147,
"start_col": 0,
"start_line": 138
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: FStar.Range.range ->
msg: Prims.string ->
pre:
(_: (_: Prims.unit -> Prims.GTot Type0) -> Prims.GTot Type0)
{FStar.Monotonic.Pure.is_monotonic pre} ->
l: (_: Prims.unit -> Prims.PURE Prims.unit) ->
qcs: Vale.X64.QuickCodes.quickCodes a cs ->
mods: Vale.X64.QuickCode.mods_t ->
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.QuickCodes.codes",
"FStar.Range.range",
"Prims.string",
"Prims.unit",
"FStar.Monotonic.Pure.is_monotonic",
"FStar.Monotonic.Pure.as_pure_wp",
"Vale.X64.QuickCodes.quickCodes",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Prims.l_Forall",
"Prims.l_imp",
"Vale.X64.QuickCo... | [] | true | false | true | false | false | let call_QPURE
(#a: Type0)
(#cs: codes)
(r: range)
(msg: string)
(pre: ((unit -> GTot Type0) -> GTot Type0){is_monotonic pre})
(l: (unit -> PURE unit (as_pure_wp pre)))
(qcs: quickCodes a cs)
(mods: mods_t)
(k: (vale_state -> a -> Type0))
(s0: vale_state)
... | l () | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.qAssertSquashLemma | val qAssertSquashLemma (p:Type0) : tAssertSquashLemma p | val qAssertSquashLemma (p:Type0) : tAssertSquashLemma p | let qAssertSquashLemma p = fun () -> () | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 312,
"start_col": 0,
"start_line": 312
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Type0 -> Vale.X64.QuickCodes.tAssertSquashLemma p | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"Prims.squash"
] | [] | false | false | false | true | false | let qAssertSquashLemma p =
| fun () -> () | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.wp_sound_code | val wp_sound_code (#a:Type0) (c:code) (qc:quickCode a c) (k:va_state -> a -> Type0) (s0:va_state) :
Ghost (va_state & fuel & a)
(requires t_require s0 /\ QProc?.wp qc s0 k)
(ensures fun (sN, fN, gN) -> eval_code c s0 fN sN /\ update_state_mods qc.mods sN s0 == sN /\ state_inv sN /\ k sN gN) | val wp_sound_code (#a:Type0) (c:code) (qc:quickCode a c) (k:va_state -> a -> Type0) (s0:va_state) :
Ghost (va_state & fuel & a)
(requires t_require s0 /\ QProc?.wp qc s0 k)
(ensures fun (sN, fN, gN) -> eval_code c s0 fN sN /\ update_state_mods qc.mods sN s0 == sN /\ state_inv sN /\ k sN gN) | let wp_sound_code #a c qc k s0 =
let QProc c _ wp proof = qc in
proof s0 k | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 12,
"end_line": 319,
"start_col": 0,
"start_line": 317
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c: Vale.X64.QuickCodes.code ->
qc: Vale.X64.QuickCode.quickCode a c ->
k: (_: Vale.X64.Decls.va_state -> _: a -> Type0) ->
s0: Vale.X64.Decls.va_state
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.QuickCodes.fuel) * a) | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_code",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.QuickCode.quickProc_wp",
"Vale.X64.QuickCode.t_proof",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.QuickCodes.fuel"
] | [] | false | false | false | false | false | let wp_sound_code #a c qc k s0 =
| let QProc c _ wp proof = qc in
proof s0 k | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.lemma_state_match | val lemma_state_match (s0:va_state) (s1:va_state) : Lemma
(requires state_match s0 s1)
(ensures state_eq s0 s1) | val lemma_state_match (s0:va_state) (s1:va_state) : Lemma
(requires state_match s0 s1)
(ensures state_eq s0 s1) | let lemma_state_match s0 s1 =
lemma_regs_match s0.vs_regs s1.vs_regs n_reg_files;
assert (Regs.equal s0.vs_regs s1.vs_regs) | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 43,
"end_line": 337,
"start_col": 0,
"start_line": 335
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s0: Vale.X64.Decls.va_state -> s1: Vale.X64.Decls.va_state
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.state_match s0 s1)
(ensures Vale.X64.State.state_eq s0 s1) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.Decls.va_state",
"Prims._assert",
"Vale.X64.Regs.equal",
"Vale.X64.State.__proj__Mkvale_state__item__vs_regs",
"Prims.unit",
"Vale.X64.QuickCodes.lemma_regs_match",
"Vale.X64.Machine_s.n_reg_files"
] | [] | true | false | true | false | false | let lemma_state_match s0 s1 =
| lemma_regs_match s0.vs_regs s1.vs_regs n_reg_files;
assert (Regs.equal s0.vs_regs s1.vs_regs) | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.qWhile_proof_rec | val qWhile_proof_rec
(#a #d: Type)
(#c: code)
(b: cmp)
(qc: (a -> quickCode a c))
(mods: mods_t)
(inv: (vale_state -> a -> Type0))
(dec: (vale_state -> a -> d))
(s0 s1: vale_state)
(g1: a)
(f1: fuel)
(k: (vale_state -> a -> Type0))
: Ghost (vale_stat... | val qWhile_proof_rec
(#a #d: Type)
(#c: code)
(b: cmp)
(qc: (a -> quickCode a c))
(mods: mods_t)
(inv: (vale_state -> a -> Type0))
(dec: (vale_state -> a -> d))
(s0 s1: vale_state)
(g1: a)
(f1: fuel)
(k: (vale_state -> a -> Type0))
: Ghost (vale_stat... | let rec qWhile_proof_rec
(#a #d:Type) (#c:code) (b:cmp) (qc:a -> quickCode a c) (mods:mods_t) (inv:vale_state -> a -> Type0)
(dec:vale_state -> a -> d) (s0 s1:vale_state) (g1:a) (f1:fuel) (k:vale_state -> a -> Type0)
: Ghost (vale_state & va_fuel & a)
(requires
state_inv s1 /\
wp_While b qc mods inv... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 302,
"start_col": 0,
"start_line": 268
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
b: Vale.X64.QuickCodes.cmp ->
qc: (_: a -> Vale.X64.QuickCode.quickCode a c) ->
mods: Vale.X64.QuickCode.mods_t ->
inv: (_: Vale.X64.State.vale_state -> _: a -> Type0) ->
dec: (_: Vale.X64.State.vale_state -> _: a -> d) ->
s0: Vale.X64.State.vale_state ->
s1: Vale.X64.State.vale_state ->
... | Prims.Ghost | [
""
] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.cmp",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.State.vale_state",
"Vale.X64.QuickCodes.fuel",
"Vale.X64.QuickCodes.eval_cmp",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCodes.qWhile_proof_rec",
... | [
"recursion"
] | false | false | false | false | false | let rec qWhile_proof_rec
(#a #d: Type)
(#c: code)
(b: cmp)
(qc: (a -> quickCode a c))
(mods: mods_t)
(inv: (vale_state -> a -> Type0))
(dec: (vale_state -> a -> d))
(s0 s1: vale_state)
(g1: a)
(f1: fuel)
(k: (vale_state -> a -> Type0))
: Ghost (vale_... | let ob = cmp_to_ocmp b in
let s1' = { s1 with vs_flags = havoc_flags } in
update_state_mods_to mods s1' s1;
update_state_mods_trans mods s0 s1 s1';
if eval_cmp s1 b
then
(let inv2 = wp_While_inv qc mods inv dec s1 g1 in
let wp = QProc?.wp (qc g1) in
let s2, f2 = va_lemma_whileTrue_total ob c s0 s1 f1 in
l... | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.wp_sound_code_wrap | val wp_sound_code_wrap
(#a: Type0)
(c: code)
(qc: quickCode a c)
(s0: vale_state)
(k: (s0': vale_state{s0 == s0'} -> vale_state -> a -> Type0))
: Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k) | val wp_sound_code_wrap
(#a: Type0)
(c: code)
(qc: quickCode a c)
(s0: vale_state)
(k: (s0': vale_state{s0 == s0'} -> vale_state -> a -> Type0))
: Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k) | let wp_sound_code_wrap (#a:Type0) (c:code) (qc:quickCode a c) (s0:vale_state) (k:(s0':vale_state{s0 == s0'}) -> vale_state -> a -> Type0) :
Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k)
=
wp_sound_code c qc (k s0) s0 | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 344,
"start_col": 0,
"start_line": 339
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c: Vale.X64.QuickCodes.code ->
qc: Vale.X64.QuickCode.quickCode a c ->
s0: Vale.X64.State.vale_state ->
k: (s0': Vale.X64.State.vale_state{s0 == s0'} -> _: Vale.X64.State.vale_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.State.vale_state * Vale.X64.QuickCodes.fuel) * a) | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.State.vale_state",
"Prims.eq2",
"Vale.X64.QuickCodes.wp_sound_code",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.QuickCodes.fuel",
"Prims.l_and",
"Vale.X64.QuickCode.t_require",
"Vale.X64.QuickCodes.wp_sound_code_pre",
"Vale.X... | [] | false | false | false | false | false | let wp_sound_code_wrap
(#a: Type0)
(c: code)
(qc: quickCode a c)
(s0: vale_state)
(k: (s0': vale_state{s0 == s0'} -> vale_state -> a -> Type0))
: Ghost (vale_state & fuel & a)
(t_require s0 /\ wp_sound_code_pre qc s0 k)
(wp_sound_code_post qc s0 k) =
| wp_sound_code c qc (k s0) s0 | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.lemma_regs_match_file | val lemma_regs_match_file (r0 r1: Regs.t) (rf: reg_file_id) (k: nat{k <= n_regs rf})
: Lemma (requires regs_match_file r0 r1 rf k)
(ensures
(forall (i: nat). {:pattern (Reg rf i)}
i < k ==>
(let r = Reg rf i in
Regs.sel r r0 == Regs.sel r r1))) | val lemma_regs_match_file (r0 r1: Regs.t) (rf: reg_file_id) (k: nat{k <= n_regs rf})
: Lemma (requires regs_match_file r0 r1 rf k)
(ensures
(forall (i: nat). {:pattern (Reg rf i)}
i < k ==>
(let r = Reg rf i in
Regs.sel r r0 == Regs.sel r r1))) | let rec lemma_regs_match_file (r0:Regs.t) (r1:Regs.t) (rf:reg_file_id) (k:nat{k <= n_regs rf}) : Lemma
(requires regs_match_file r0 r1 rf k)
(ensures (forall (i:nat).{:pattern (Reg rf i)} i < k ==>
(let r = Reg rf i in Regs.sel r r0 == Regs.sel r r1)))
=
if k > 0 then lemma_regs_match_file r0 r1 rf (k - 1) | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 54,
"end_line": 326,
"start_col": 0,
"start_line": 321
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r0: Vale.X64.Regs.t ->
r1: Vale.X64.Regs.t ->
rf: Vale.X64.Machine_s.reg_file_id ->
k: Prims.nat{k <= Vale.X64.Machine_s.n_regs rf}
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.regs_match_file r0 r1 rf k)
(ensures
forall (i: Prims.nat). {:pattern Vale.X64.Machine_s.Reg rf i}
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.Regs.t",
"Vale.X64.Machine_s.reg_file_id",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Vale.X64.Machine_s.n_regs",
"Prims.op_GreaterThan",
"Vale.X64.QuickCodes.lemma_regs_match_file",
"Prims.op_Subtraction",
"Prims.bool",
"Prims.unit",
"Vale.X64.QuickCodes.regs_match_file"... | [
"recursion"
] | false | false | true | false | false | let rec lemma_regs_match_file (r0 r1: Regs.t) (rf: reg_file_id) (k: nat{k <= n_regs rf})
: Lemma (requires regs_match_file r0 r1 rf k)
(ensures
(forall (i: nat). {:pattern (Reg rf i)}
i < k ==>
(let r = Reg rf i in
Regs.sel r r0 == Regs.sel r r1))) =
| if k > 0 then lemma_regs_match_file r0 r1 rf (k - 1) | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.qWhile_proof | val qWhile_proof
(#a #d:Type) (#c:code) (b:cmp) (qc:a -> quickCode a c) (mods:mods_t) (inv:va_state -> a -> Type0)
(dec:va_state -> a -> d) (g0:a) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_While b qc mods inv dec g0 s0 k)
(ensures fun (sM, f0, g... | val qWhile_proof
(#a #d:Type) (#c:code) (b:cmp) (qc:a -> quickCode a c) (mods:mods_t) (inv:va_state -> a -> Type0)
(dec:va_state -> a -> d) (g0:a) (s0:va_state) (k:va_state -> a -> Type0)
: Ghost (va_state & va_fuel & a)
(requires t_require s0 /\ wp_While b qc mods inv dec g0 s0 k)
(ensures fun (sM, f0, g... | let qWhile_proof #a #d #c b qc mods inv dec g0 s0 k =
let ob = cmp_to_ocmp b in
let (s1, f1) = va_lemma_while_total ob c s0 in
update_state_mods_refl mods s0;
qWhile_proof_rec b qc mods inv dec s0 s1 g0 f1 k | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 308,
"start_col": 0,
"start_line": 304
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
b: Vale.X64.QuickCodes.cmp ->
qc: (_: a -> Vale.X64.QuickCode.quickCode a c) ->
mods: Vale.X64.QuickCode.mods_t ->
inv: (_: Vale.X64.Decls.va_state -> _: a -> Type0) ->
dec: (_: Vale.X64.Decls.va_state -> _: a -> d) ->
g0: a ->
s0: Vale.X64.Decls.va_state ->
k: (_: Vale.X64.Decls.va_sta... | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCodes.cmp",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.QuickCode.mods_t",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCodes.qWhile_proof_rec",
"Prims.unit",
"Vale.X64.QuickCodes.update_state_mods_refl",
"FStar.Pervasives.Native.tupl... | [] | false | false | false | false | false | let qWhile_proof #a #d #c b qc mods inv dec g0 s0 k =
| let ob = cmp_to_ocmp b in
let s1, f1 = va_lemma_while_total ob c s0 in
update_state_mods_refl mods s0;
qWhile_proof_rec b qc mods inv dec s0 s1 g0 f1 k | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.va_wp_sound_code_norm | val va_wp_sound_code_norm (#a:Type0) (c:code) (qc:quickCode a c) (s0:va_state) (k:(s0':va_state{s0 == s0'}) -> va_state -> a -> Type0) :
Ghost (va_state & fuel & a)
(t_require s0 /\ normal (wp_sound_code_pre qc s0 k))
(wp_sound_code_post qc s0 k) | val va_wp_sound_code_norm (#a:Type0) (c:code) (qc:quickCode a c) (s0:va_state) (k:(s0':va_state{s0 == s0'}) -> va_state -> a -> Type0) :
Ghost (va_state & fuel & a)
(t_require s0 /\ normal (wp_sound_code_pre qc s0 k))
(wp_sound_code_post qc s0 k) | let va_wp_sound_code_norm #a c qc s0 k =
assert_normal (wp_sound_code_pre qc s0 k);
wp_sound_code_wrap c qc s0 k | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 30,
"end_line": 354,
"start_col": 0,
"start_line": 352
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
c: Vale.X64.QuickCodes.code ->
qc: Vale.X64.QuickCode.quickCode a c ->
s0: Vale.X64.Decls.va_state ->
k: (s0': Vale.X64.Decls.va_state{s0 == s0'} -> _: Vale.X64.Decls.va_state -> _: a -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.QuickCodes.fuel) * a) | Prims.Ghost | [] | [] | [
"Vale.X64.QuickCodes.code",
"Vale.X64.QuickCode.quickCode",
"Vale.X64.Decls.va_state",
"Prims.eq2",
"Vale.X64.QuickCodes.wp_sound_code_wrap",
"Prims.unit",
"Vale.X64.QuickCodes.assert_normal",
"Vale.X64.QuickCodes.wp_sound_code_pre",
"FStar.Pervasives.Native.tuple3",
"Vale.X64.QuickCodes.fuel"
] | [] | false | false | false | false | false | let va_wp_sound_code_norm #a c qc s0 k =
| assert_normal (wp_sound_code_pre qc s0 k);
wp_sound_code_wrap c qc s0 k | false |
Vale.X64.QuickCodes.fst | Vale.X64.QuickCodes.lemma_regs_match | val lemma_regs_match (r0 r1: Regs.t) (k: nat{k <= n_reg_files})
: Lemma (requires regs_match r0 r1 k)
(ensures
(forall (i: nat) (j: nat). {:pattern (Reg i j)}
i < k /\ j < n_regs i ==>
(let r = Reg i j in
Regs.sel r r0 == Regs.sel r r1))) | val lemma_regs_match (r0 r1: Regs.t) (k: nat{k <= n_reg_files})
: Lemma (requires regs_match r0 r1 k)
(ensures
(forall (i: nat) (j: nat). {:pattern (Reg i j)}
i < k /\ j < n_regs i ==>
(let r = Reg i j in
Regs.sel r r0 == Regs.sel r r1))) | let rec lemma_regs_match (r0:Regs.t) (r1:Regs.t) (k:nat{k <= n_reg_files}) : Lemma
(requires regs_match r0 r1 k)
(ensures (forall (i j:nat).{:pattern (Reg i j)} i < k /\ j < n_regs i ==>
(let r = Reg i j in Regs.sel r r0 == Regs.sel r r1)))
=
if k > 0 then (lemma_regs_match_file r0 r1 (k - 1) (n_regs (k - 1... | {
"file_name": "vale/code/arch/x64/Vale.X64.QuickCodes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 102,
"end_line": 333,
"start_col": 0,
"start_line": 328
} | module Vale.X64.QuickCodes
open FStar.Mul
open Vale.Arch.HeapImpl
open FStar.Range
module Map16 = Vale.Lib.Map16
#reset-options "--initial_ifuel 1 --z3rlimit 30"
let lemma_label_Type0 (r:range) (msg:string) (p:Type0) : Lemma
(requires True) (ensures label r msg p ==> p)
= ()
let lemma_label_bool r msg b = lemma_... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Regs.fsti.checked",
"Vale.Lib.Map16.fsti.checked",
"Vale.Arch.HeapImpl.fsti.checked",
"prims.fst.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
... | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.Pure",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Lib.Map16",
"short_module": "Map16"
},
{
"abbrev": false,
"full_module": "FStar.Range",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r0: Vale.X64.Regs.t -> r1: Vale.X64.Regs.t -> k: Prims.nat{k <= Vale.X64.Machine_s.n_reg_files}
-> FStar.Pervasives.Lemma (requires Vale.X64.QuickCodes.regs_match r0 r1 k)
(ensures
forall (i: Prims.nat) (j: Prims.nat). {:pattern Vale.X64.Machine_s.Reg i j}
i < k /\ j < Vale.X64.Machine_s.n_reg... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.Regs.t",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Vale.X64.Machine_s.n_reg_files",
"Prims.op_GreaterThan",
"Vale.X64.QuickCodes.lemma_regs_match",
"Prims.op_Subtraction",
"Prims.unit",
"Vale.X64.QuickCodes.lemma_regs_match_file",
"Vale.X64.Machine_s.n_regs",
"Prims.bool... | [
"recursion"
] | false | false | true | false | false | let rec lemma_regs_match (r0 r1: Regs.t) (k: nat{k <= n_reg_files})
: Lemma (requires regs_match r0 r1 k)
(ensures
(forall (i: nat) (j: nat). {:pattern (Reg i j)}
i < k /\ j < n_regs i ==>
(let r = Reg i j in
Regs.sel r r0 == Regs.sel r r1))) =
| if k > 0
then
(lemma_regs_match_file r0 r1 (k - 1) (n_regs (k - 1));
lemma_regs_match r0 r1 (k - 1)) | false |
Hacl.Impl.K256.PointMul.fst | Hacl.Impl.K256.PointMul.point_mul_g_noalloc | val point_mul_g_noalloc: out:point -> scalar:qelem
-> q1:point -> q2:point
-> q3:point -> q4:point ->
Stack unit
(requires fun h ->
live h scalar /\ live h out /\ live h q1 /\
live h q2 /\ live h q3 /\ live h q4 /\
disjoint out scalar /\ disjoint out q1 /\ disjoint out q2 /\
disjoint out q3 /\ d... | val point_mul_g_noalloc: out:point -> scalar:qelem
-> q1:point -> q2:point
-> q3:point -> q4:point ->
Stack unit
(requires fun h ->
live h scalar /\ live h out /\ live h q1 /\
live h q2 /\ live h q3 /\ live h q4 /\
disjoint out scalar /\ disjoint out q1 /\ disjoint out q2 /\
disjoint out q3 /\ d... | let point_mul_g_noalloc out scalar q1 q2 q3 q4 =
[@inline_let] let len = 15ul in
[@inline_let] let ctx_len = 0ul in
[@inline_let] let k = mk_k256_concrete_ops in
[@inline_let] let l = 4ul in
[@inline_let] let table_len = 16ul in
[@inline_let] let bLen = 1ul in
[@inline_let] let bBits = 64ul in
let h0 =... | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 7,
"end_line": 142,
"start_col": 0,
"start_line": 95
} | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.PrecompBaseTable256.fsti.check... | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
out: Hacl.Impl.K256.Point.point ->
scalar: Hacl.K256.Scalar.qelem ->
q1: Hacl.Impl.K256.Point.point ->
q2: Hacl.Impl.K256.Point.point ->
q3: Hacl.Impl.K256.Point.point ->
q4: Hacl.Impl.K256.Point.point
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"Hacl.Impl.MultiExponentiation.mk_lexp_four_fw_tables",
"Lib.IntTypes.U64",
"Hacl.Impl.K256.PointMul.table_inv_w4",
"Hacl.Impl.K256.PointMul.precomp_get_consttime",
"Lib.Buffer.null",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint64",
"Lib.Buffer.to_co... | [] | false | true | false | false | false | let point_mul_g_noalloc out scalar q1 q2 q3 q4 =
| [@@ inline_let ]let len = 15ul in
[@@ inline_let ]let ctx_len = 0ul in
[@@ inline_let ]let k = mk_k256_concrete_ops in
[@@ inline_let ]let l = 4ul in
[@@ inline_let ]let table_len = 16ul in
[@@ inline_let ]let bLen = 1ul in
[@@ inline_let ]let bBits = 64ul in
let h0 = ST.get () in
recall_contents precomp_basepoint_tabl... | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_pattern_args | val faithful_lemma_pattern_args
(#b: _)
(top1 top2: b)
(pats1: list (pattern & bool) {pats1 << top1})
(pats2: list (pattern & bool) {pats2 << top2})
: Lemma (requires allP top1 faithful_pattern_arg pats1 /\ allP top2 faithful_pattern_arg pats2)
(ensures defined (list_dec_cmp top1 top2 ... | val faithful_lemma_pattern_args
(#b: _)
(top1 top2: b)
(pats1: list (pattern & bool) {pats1 << top1})
(pats2: list (pattern & bool) {pats2 << top2})
: Lemma (requires allP top1 faithful_pattern_arg pats1 /\ allP top2 faithful_pattern_arg pats2)
(ensures defined (list_dec_cmp top1 top2 ... | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
top1: b ->
top2: b ->
pats1: Prims.list (FStar.Stubs.Reflection.V2.Data.pattern * Prims.bool) {pats1 << top1} ->
pats2: Prims.list (FStar.Stubs.Reflection.V2.Data.pattern * Prims.bool) {pats2 << top2}
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.allP top1 FStar.Reflect... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Stubs.Reflection.V2.Data.pattern",
"Prims.bool",
"Prims.precedes",
"FStar.Reflection.V2.TermEq.defined_list_dec",
"FStar.Reflection.V2.TermEq.pat_arg_cmp",
"Prims.unit",
"FStar.Classical.Sugar.forall_intro",
"Prims.l_Forall",
"Prims.l_imp",
... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_pattern_args
#b
(top1: b)
(top2: b)
(pats1: list (pattern & bool) {pats1 << top1})
(pats2: list (pattern & bool) {pats2 << top2})
: Lemma (requires allP top1 faithful_pattern_arg pats1 /\ allP top2 faithful_pattern_arg pats2)
(ensures defined (list_dec_cmp ... | introduce forall x y . L.memP x pats1 /\ L.memP y pats2 ==> defined (pat_arg_cmp x y)
with (introduce forall y . L.memP x pats1 /\ L.memP y pats2 ==> defined (pat_arg_cmp x y)
with (introduce (L.memP x pats1 /\ L.memP y pats2) ==> (defined (pat_arg_cmp x y))
with h. (faithful_lemma_pattern_arg x y)));
defined_lis... | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_arg | val faithful_lemma_arg (a1 a2: argv)
: Lemma (requires faithful_arg a1 /\ faithful_arg a2) (ensures defined (arg_cmp a1 a2)) | val faithful_lemma_arg (a1 a2: argv)
: Lemma (requires faithful_arg a1 /\ faithful_arg a2) (ensures defined (arg_cmp a1 a2)) | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | a1: FStar.Stubs.Reflection.V2.Data.argv -> a2: FStar.Stubs.Reflection.V2.Data.argv
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.faithful_arg a1 /\ FStar.Reflection.V2.TermEq.faithful_arg a2)
(ensures FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.TermEq.arg_cmp a1 a2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"FStar.Stubs.Reflection.V2.Data.argv",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.V2.Data.aqualv",
"FStar.Pervasives.Native.snd",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V2.TermEq.faithful_lemma",
"FStar.Pervasives.Native.tuple2",
"Prims.unit",
"FStar.Pervasives.Nativ... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_arg (a1 a2: argv)
: Lemma (requires faithful_arg a1 /\ faithful_arg a2) (ensures defined (arg_cmp a1 a2)) =
| faithful_lemma (fst a1) (fst a2);
(match snd a1, snd a2 with
| Q_Meta t1, Q_Meta t2 -> faithful_lemma t1 t2
| _ -> ()) | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_binder | val faithful_lemma_binder (b1 b2: binder)
: Lemma (requires faithful_binder b1 /\ faithful_binder b2) (ensures defined (binder_cmp b1 b2)) | val faithful_lemma_binder (b1 b2: binder)
: Lemma (requires faithful_binder b1 /\ faithful_binder b2) (ensures defined (binder_cmp b1 b2)) | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b1: FStar.Stubs.Reflection.Types.binder -> b2: FStar.Stubs.Reflection.Types.binder
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.faithful_binder b1 /\
FStar.Reflection.V2.TermEq.faithful_binder b2)
(ensures FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.TermEq.bin... | FStar.Pervasives.Lemma | [
"lemma"
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"FStar.Stubs.Reflection.Types.binder",
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.eq2",
"FStar.Reflection.V2.TermEq._cmpres",
"Prims.l_or",
"FStar.Reflection.V2.TermEq.valid",
"FStar.Pervasives.Native.tuple2",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Data.aqualv",
... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_binder (b1 b2: binder)
: Lemma (requires faithful_binder b1 /\ faithful_binder b2) (ensures defined (binder_cmp b1 b2)) =
| let bv1 = inspect_binder b1 in
let bv2 = inspect_binder b2 in
faithful_lemma_qual bv1.qual bv2.qual;
faithful_lemma bv1.sort bv2.sort;
faithful_lemma_attrs_dec b1 b2 bv1.attrs bv2.attrs;
assert_norm ((term_cmp bv1.sort bv2.sort &&& aqual_cmp bv1.qual bv2.qual &&&
list_dec_cmp b1 b2 term_cmp bv1.attrs bv2.attrs) =... | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_qual | val faithful_lemma_qual (q1 q2: aqualv)
: Lemma (requires faithful_qual q1 /\ faithful_qual q2) (ensures defined (aqual_cmp q1 q2)) | val faithful_lemma_qual (q1 q2: aqualv)
: Lemma (requires faithful_qual q1 /\ faithful_qual q2) (ensures defined (aqual_cmp q1 q2)) | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | q1: FStar.Stubs.Reflection.V2.Data.aqualv -> q2: FStar.Stubs.Reflection.V2.Data.aqualv
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.faithful_qual q1 /\ FStar.Reflection.V2.TermEq.faithful_qual q2)
(ensures FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.TermEq.aqual_cmp q... | FStar.Pervasives.Lemma | [
"lemma"
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"FStar.Stubs.Reflection.V2.Data.aqualv",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.Types.term",
"FStar.Reflection.V2.TermEq.faithful_lemma",
"FStar.Pervasives.Native.tuple2",
"Prims.unit",
"Prims.l_and",
"FStar.Reflection.V2.TermEq.faithful_qual",
"Prims.squash",
"FStar.Reflectio... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_qual (q1 q2: aqualv)
: Lemma (requires faithful_qual q1 /\ faithful_qual q2) (ensures defined (aqual_cmp q1 q2)) =
| match q1, q2 with
| Q_Meta t1, Q_Meta t2 -> faithful_lemma t1 t2
| _ -> () | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_comp | val faithful_lemma_comp (c1 c2: comp)
: Lemma (requires faithful_comp c1 /\ faithful_comp c2) (ensures defined (comp_cmp c1 c2)) | val faithful_lemma_comp (c1 c2: comp)
: Lemma (requires faithful_comp c1 /\ faithful_comp c2) (ensures defined (comp_cmp c1 c2)) | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | c1: FStar.Stubs.Reflection.Types.comp -> c2: FStar.Stubs.Reflection.Types.comp
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.faithful_comp c1 /\ FStar.Reflection.V2.TermEq.faithful_comp c2)
(ensures FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.TermEq.comp_cmp c1 c2)) | FStar.Pervasives.Lemma | [
"lemma"
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"FStar.Stubs.Reflection.Types.comp",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflection.V2.Data.comp_view",
"FStar.Stubs.Reflection.V2.Builtins.inspect_comp",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Reflection.V2.TermEq.faithful_lemma",
"FStar.Stubs.Reflection.Types.term",
"Prims.unit",
... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_comp (c1 c2: comp)
: Lemma (requires faithful_comp c1 /\ faithful_comp c2) (ensures defined (comp_cmp c1 c2)) =
| match inspect_comp c1, inspect_comp c2 with
| C_Total t1, C_Total t2 -> faithful_lemma t1 t2
| C_GTotal t1, C_GTotal t2 -> faithful_lemma t1 t2
| C_Lemma pre1 post1 pat1, C_Lemma pre2 post2 pat2 ->
faithful_lemma pre1 pre2;
faithful_lemma post1 post2;
faithful_lemma pat1 pat2
| C_Eff us1 e1 r1 args1 dec1, C_Eff u... | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_pattern | val faithful_lemma_pattern (p1 p2: pattern)
: Lemma (requires faithful_pattern p1 /\ faithful_pattern p2) (ensures defined (pat_cmp p1 p2)) | val faithful_lemma_pattern (p1 p2: pattern)
: Lemma (requires faithful_pattern p1 /\ faithful_pattern p2) (ensures defined (pat_cmp p1 p2)) | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p1: FStar.Stubs.Reflection.V2.Data.pattern -> p2: FStar.Stubs.Reflection.V2.Data.pattern
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.faithful_pattern p1 /\
FStar.Reflection.V2.TermEq.faithful_pattern p2)
(ensures FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.Te... | FStar.Pervasives.Lemma | [
"lemma"
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"FStar.Stubs.Reflection.V2.Data.pattern",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Sealed.sealed",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Data.ppname_t",
"FStar.Stubs.Reflection.V2.Data.vconst",
"FStar.Reflection.V2.TermEq.faithful_lemma",
"FStar.Stubs.Reflection.Types.fv",
... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_pattern (p1 p2: pattern)
: Lemma (requires faithful_pattern p1 /\ faithful_pattern p2) (ensures defined (pat_cmp p1 p2)) =
| match p1, p2 with
| Pat_Var _ _, Pat_Var _ _ -> ()
| Pat_Constant _, Pat_Constant _ -> ()
| Pat_Dot_Term (Some t1), Pat_Dot_Term (Some t2) -> faithful_lemma t1 t2
| Pat_Cons head1 univs1 subpats1, Pat_Cons head2 univs2 subpats2 ->
faithful_Pat_Cons p1 head1 univs1 subpats1;
faithful_Pat_Cons p2 head2 univs2 subpats... | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_branch | val faithful_lemma_branch (br1 br2: branch)
: Lemma (requires faithful_branch br1 /\ faithful_branch br2) (ensures defined (br_cmp br1 br2)) | val faithful_lemma_branch (br1 br2: branch)
: Lemma (requires faithful_branch br1 /\ faithful_branch br2) (ensures defined (br_cmp br1 br2)) | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | br1: FStar.Stubs.Reflection.V2.Data.branch -> br2: FStar.Stubs.Reflection.V2.Data.branch
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.faithful_branch br1 /\
FStar.Reflection.V2.TermEq.faithful_branch br2)
(ensures FStar.Reflection.V2.TermEq.defined (FStar.Reflection.V2.Te... | FStar.Pervasives.Lemma | [
"lemma"
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"FStar.Stubs.Reflection.V2.Data.branch",
"FStar.Reflection.V2.TermEq.faithful_lemma",
"FStar.Pervasives.Native.snd",
"FStar.Stubs.Reflection.V2.Data.pattern",
"FStar.Stubs.Reflection.Types.term",
"Prims.unit",
"FStar.Reflection.V2.TermEq.faithful_lemma_pattern",
"FStar.Pervasives.Native.fst",
"Prims... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_branch (br1 br2: branch)
: Lemma (requires faithful_branch br1 /\ faithful_branch br2) (ensures defined (br_cmp br1 br2)) =
| faithful_lemma_pattern (fst br1) (fst br2);
faithful_lemma (snd br1) (snd br2) | false |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_pattern_arg | val faithful_lemma_pattern_arg (pb1 pb2: pattern & bool)
: Lemma (requires faithful_pattern_arg pb1 /\ faithful_pattern_arg pb2)
(ensures defined (pat_arg_cmp pb1 pb2)) | val faithful_lemma_pattern_arg (pb1 pb2: pattern & bool)
: Lemma (requires faithful_pattern_arg pb1 /\ faithful_pattern_arg pb2)
(ensures defined (pat_arg_cmp pb1 pb2)) | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
pb1: (FStar.Stubs.Reflection.V2.Data.pattern * Prims.bool) ->
pb2: (FStar.Stubs.Reflection.V2.Data.pattern * Prims.bool)
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.faithful_pattern_arg pb1 /\
FStar.Reflection.V2.TermEq.faithful_pattern_arg pb2)
(ensures FStar.R... | FStar.Pervasives.Lemma | [
"lemma"
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"FStar.Pervasives.Native.tuple2",
"FStar.Stubs.Reflection.V2.Data.pattern",
"Prims.bool",
"FStar.Reflection.V2.TermEq.faithful_lemma_pattern",
"Prims.unit",
"Prims.l_and",
"FStar.Reflection.V2.TermEq.faithful_pattern_arg",
"Prims.squash",
"FStar.Reflection.V2.TermEq.defined",
"FStar.Reflection.V2.... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_pattern_arg (pb1 pb2: pattern & bool)
: Lemma (requires faithful_pattern_arg pb1 /\ faithful_pattern_arg pb2)
(ensures defined (pat_arg_cmp pb1 pb2)) =
| let p1, _ = pb1 in
let p2, _ = pb2 in
faithful_lemma_pattern p1 p2 | false |
PulseCore.Observability.fst | PulseCore.Observability.at_most_one_observable | val at_most_one_observable : o1: PulseCore.Observability.observability -> o2: PulseCore.Observability.observability -> Prims.bool | let at_most_one_observable o1 o2 =
match o1, o2 with
| Observable, Observable -> false
| _ -> true | {
"file_name": "lib/pulse_core/PulseCore.Observability.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 23,
"start_col": 0,
"start_line": 20
} | module PulseCore.Observability
(*
obs > unobs >----.
|
v
ghost > neutral > ghost non_info
ghost info , neutral info |> ghost info
ghost non_info, neutral info |> neutral info
ghost info , neutral non_info |> ghost non_info
ghost non_info, neutral non_info |> ghost ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseCore.Observability.fst"
} | [
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | o1: PulseCore.Observability.observability -> o2: PulseCore.Observability.observability -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Observability.observability",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Pervasives.Native.tuple2",
"Prims.bool"
] | [] | false | false | false | true | false | let at_most_one_observable o1 o2 =
| match o1, o2 with
| Observable, Observable -> false
| _ -> true | false | |
PulseCore.Observability.fst | PulseCore.Observability.join_obs | val join_obs : o1: PulseCore.Observability.observability -> o2: PulseCore.Observability.observability
-> PulseCore.Observability.observability | let join_obs o1 o2 =
match o1, o2 with
| Observable, _
| _, Observable -> Observable
| Neutral, n
| n, Neutral -> n
| _ -> Unobservable | {
"file_name": "lib/pulse_core/PulseCore.Observability.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 21,
"end_line": 31,
"start_col": 0,
"start_line": 25
} | module PulseCore.Observability
(*
obs > unobs >----.
|
v
ghost > neutral > ghost non_info
ghost info , neutral info |> ghost info
ghost non_info, neutral info |> neutral info
ghost info , neutral non_info |> ghost non_info
ghost non_info, neutral non_info |> ghost ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file": "PulseCore.Observability.fst"
} | [
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "PulseCore",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | o1: PulseCore.Observability.observability -> o2: PulseCore.Observability.observability
-> PulseCore.Observability.observability | Prims.Tot | [
"total"
] | [] | [
"PulseCore.Observability.observability",
"FStar.Pervasives.Native.Mktuple2",
"PulseCore.Observability.Observable",
"FStar.Pervasives.Native.tuple2",
"PulseCore.Observability.Unobservable"
] | [] | false | false | false | true | false | let join_obs o1 o2 =
| match o1, o2 with
| Observable, _ | _, Observable -> Observable
| Neutral, n | n, Neutral -> n
| _ -> Unobservable | false | |
FStar.Reflection.V2.TermEq.fst | FStar.Reflection.V2.TermEq.faithful_lemma_branches | val faithful_lemma_branches
(#b: _)
(top1 top2: b)
(brs1: list branch {brs1 << top1})
(brs2: list branch {brs2 << top2})
: Lemma (requires allP top1 faithful_branch brs1 /\ allP top2 faithful_branch brs2)
(ensures defined (list_dec_cmp top1 top2 br_cmp brs1 brs2))
(decreases brs1... | val faithful_lemma_branches
(#b: _)
(top1 top2: b)
(brs1: list branch {brs1 << top1})
(brs2: list branch {brs2 << top2})
: Lemma (requires allP top1 faithful_branch brs1 /\ allP top2 faithful_branch brs2)
(ensures defined (list_dec_cmp top1 top2 br_cmp brs1 brs2))
(decreases brs1... | let rec faithful_lemma (t1 t2 : term) =
match inspect_ln t1, inspect_ln t2 with
| Tv_Var _, Tv_Var _
| Tv_BVar _, Tv_BVar _
| Tv_FVar _, Tv_FVar _ -> ()
| Tv_UInst f1 us1, Tv_UInst f2 us2 ->
let tv1 = inspect_ln t1 in
let tv2 = inspect_ln t2 in
univ_faithful_lemma_list t1 t2 us1 us2;
()
| T... | {
"file_name": "ulib/FStar.Reflection.V2.TermEq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 811,
"start_col": 0,
"start_line": 614
} | module FStar.Reflection.V2.TermEq
open FStar.Stubs.Reflection.Types
open FStar.Stubs.Reflection.V2.Data
open FStar.Stubs.Reflection.V2.Builtins
module L = FStar.List.Tot
(* "SMT may not be able to prove the types of ... and ... to be equal,
if the proof fails, try annotating these with the same type" *)
#set-options... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Stubs.Reflection.V2.Data.fsti.checked",
"FStar.Stubs.Reflection.V2.Builtins.fsti.checked",
"FStar.Stubs.Reflection.Types.fsti.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Sealed.fsti.checked",
"FStar.Perva... | [
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Builtins",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Stubs.Reflection.V2.Data",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
top1: b ->
top2: b ->
brs1: Prims.list FStar.Stubs.Reflection.V2.Data.branch {brs1 << top1} ->
brs2: Prims.list FStar.Stubs.Reflection.V2.Data.branch {brs2 << top2}
-> FStar.Pervasives.Lemma
(requires
FStar.Reflection.V2.TermEq.allP top1 FStar.Reflection.V2.TermEq.faithful_branch brs1 /... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [
"faithful_lemma",
"faithful_lemma_pattern",
"faithful_lemma_pattern_arg",
"faithful_lemma_pattern_args",
"faithful_lemma_branch",
"faithful_lemma_branches",
"faithful_lemma_arg",
"faithful_lemma_binder",
"faithful_lemma_qual",
"faithful_lemma_attrs_dec",
"faithful_lemma_comp"
] | [
"Prims.list",
"FStar.Stubs.Reflection.V2.Data.branch",
"Prims.precedes",
"FStar.Reflection.V2.TermEq.defined_list_dec",
"FStar.Reflection.V2.TermEq.br_cmp",
"Prims.unit",
"FStar.Classical.Sugar.forall_intro",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"FStar.List.Tot.Base.memP",
"FStar.Re... | [
"mutual recursion"
] | false | false | true | false | false | let rec faithful_lemma_branches
#b
(top1: b)
(top2: b)
(brs1: list branch {brs1 << top1})
(brs2: list branch {brs2 << top2})
: Lemma (requires allP top1 faithful_branch brs1 /\ allP top2 faithful_branch brs2)
(ensures defined (list_dec_cmp top1 top2 br_cmp brs1 brs2))
(decr... | introduce forall x y . L.memP x brs1 /\ L.memP y brs2 ==> defined (br_cmp x y)
with (introduce forall y . L.memP x brs1 /\ L.memP y brs2 ==> defined (br_cmp x y)
with (introduce (L.memP x brs1 /\ L.memP y brs2) ==> (defined (br_cmp x y))
with h. (faithful_lemma_branch x y)));
defined_list_dec top1 top2 br_cmp brs... | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT64BE | val ___UINT64BE:eqtype | val ___UINT64BE:eqtype | let ___UINT64BE : eqtype = U64.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 32,
"end_line": 214,
"start_col": 0,
"start_line": 214
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt64.t"
] | [] | false | false | false | true | false | let ___UINT64BE:eqtype =
| U64.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___Bool | val ___Bool : Prims.eqtype | let ___Bool = bool | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 189,
"start_col": 0,
"start_line": 189
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"Prims.bool"
] | [] | false | false | false | true | false | let ___Bool =
| bool | false | |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.refine | val refine : t: Type -> f: (_: t -> Prims.bool) -> Type | let refine t (f:t -> bool) = x:t{f x} | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 37,
"end_line": 76,
"start_col": 0,
"start_line": 76
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FStar.UInt16",
"short_module": "U16"
},
{
"abbrev": true,
"full_module": "LowP... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: Type -> f: (_: t -> Prims.bool) -> Type | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.b2t"
] | [] | false | false | false | true | true | let refine t (f: (t -> bool)) =
| x: t{f x} | false | |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT16BE | val ___UINT16BE:eqtype | val ___UINT16BE:eqtype | let ___UINT16BE : eqtype = U16.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 32,
"end_line": 204,
"start_col": 0,
"start_line": 204
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt16.t"
] | [] | false | false | false | true | false | let ___UINT16BE:eqtype =
| U16.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT8BE | val ___UINT8BE:eqtype | val ___UINT8BE:eqtype | let ___UINT8BE : eqtype = FStar.UInt8.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 39,
"end_line": 199,
"start_col": 0,
"start_line": 199
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt8.t"
] | [] | false | false | false | true | false | let ___UINT8BE:eqtype =
| FStar.UInt8.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT8 | val ___UINT8:eqtype | val ___UINT8:eqtype | let ___UINT8 : eqtype = FStar.UInt8.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 37,
"end_line": 192,
"start_col": 0,
"start_line": 192
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt8.t"
] | [] | false | false | false | true | false | let ___UINT8:eqtype =
| FStar.UInt8.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT16 | val ___UINT16:eqtype | val ___UINT16:eqtype | let ___UINT16 : eqtype = U16.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 30,
"end_line": 221,
"start_col": 0,
"start_line": 221
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt16.t"
] | [] | false | false | false | true | false | let ___UINT16:eqtype =
| U16.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT32 | val ___UINT32:eqtype | val ___UINT32:eqtype | let ___UINT32 : eqtype = U32.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 30,
"end_line": 226,
"start_col": 0,
"start_line": 226
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt32.t"
] | [] | false | false | false | true | false | let ___UINT32:eqtype =
| U32.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT32BE | val ___UINT32BE:eqtype | val ___UINT32BE:eqtype | let ___UINT32BE : eqtype = U32.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 32,
"end_line": 209,
"start_col": 0,
"start_line": 209
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt32.t"
] | [] | false | false | false | true | false | let ___UINT32BE:eqtype =
| U32.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.parse_unit | val parse_unit:parser kind_unit unit | val parse_unit:parser kind_unit unit | let parse_unit
: parser kind_unit unit
= parse_ret () | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 16,
"end_line": 237,
"start_col": 0,
"start_line": 235
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | EverParse3d.Prelude.parser EverParse3d.Kinds.kind_unit Prims.unit | Prims.Tot | [
"total"
] | [] | [
"EverParse3d.Prelude.parse_ret",
"Prims.unit"
] | [] | false | false | false | false | false | let parse_unit:parser kind_unit unit =
| parse_ret () | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.___UINT64 | val ___UINT64:eqtype | val ___UINT64:eqtype | let ___UINT64 : eqtype = U64.t | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 30,
"end_line": 231,
"start_col": 0,
"start_line": 231
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt64.t"
] | [] | false | false | false | true | false | let ___UINT64:eqtype =
| U64.t | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.pow2_values | val pow2_values (x: nat)
: Lemma
(let p = pow2 x in
match x with
| 0 -> p = 1
| 1 -> p = 2
| 2 -> p = 4
| 3 -> p = 8
| 4 -> p = 16
| 5 -> p = 32
| 6 -> p = 64
| 7 -> p = 128
| 8 -> p = 256
| _ -> True) [SMTPat (pow2 x)] | val pow2_values (x: nat)
: Lemma
(let p = pow2 x in
match x with
| 0 -> p = 1
| 1 -> p = 2
| 2 -> p = 4
| 3 -> p = 8
| 4 -> p = 16
| 5 -> p = 32
| 6 -> p = 64
| 7 -> p = 128
| 8 -> p = 256
| _ -> True) [SMTPat (pow2 x)] | let pow2_values (x:nat) : Lemma
(let p = pow2 x in
match x with
| 0 -> p=1
| 1 -> p=2
| 2 -> p=4
| 3 -> p=8
| 4 -> p=16
| 5 -> p=32
| 6 -> p=64
| 7 -> p=128
| 8 -> p=256
| _ -> True)
[SMTPat (pow2 x)]
= norm_spec [delta;zeta;primops] (pow2 0);
norm_spec... | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 43,
"end_line": 48,
"start_col": 0,
"start_line": 26
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "FStar.Int.Cast",
"short_module": "C"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": true,
"full_module": "FSta... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: Prims.nat
-> FStar.Pervasives.Lemma
(ensures
(let p = Prims.pow2 x in
(match x with
| 0 -> p = 1
| 1 -> p = 2
| 2 -> p = 4
| 3 -> p = 8
| 4 -> p = 16
| 5 -> p = 32
| 6 -> p = 64
| 7 -> p = 128
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Pervasives.norm_spec",
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.delta",
"FStar.Pervasives.zeta",
"FStar.Pervasives.primops",
"Prims.Nil",
"Prims.pos",
"Prims.pow2",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.b2t",
"Prims.op_Equality",
... | [] | true | false | true | false | false | let pow2_values (x: nat)
: Lemma
(let p = pow2 x in
match x with
| 0 -> p = 1
| 1 -> p = 2
| 2 -> p = 4
| 3 -> p = 8
| 4 -> p = 16
| 5 -> p = 32
| 6 -> p = 64
| 7 -> p = 128
| 8 -> p = 256
| _ -> True) [SMTPat (pow2 x)] =
... | norm_spec [delta; zeta; primops] (pow2 0);
norm_spec [delta; zeta; primops] (pow2 1);
norm_spec [delta; zeta; primops] (pow2 2);
norm_spec [delta; zeta; primops] (pow2 3);
norm_spec [delta; zeta; primops] (pow2 4);
norm_spec [delta; zeta; primops] (pow2 5);
norm_spec [delta; zeta; primops] (pow2 6);
norm_spec [delta; z... | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_div | val u8_div (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 division" (UInt8.v y =!= 0))
(ensures fun z -> UInt8.v z == UInt8.v x / UInt8.v y) | val u8_div (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 division" (UInt8.v y =!= 0))
(ensures fun z -> UInt8.v z == UInt8.v x / UInt8.v y) | let u8_div (r:range) (x y:UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 division" (UInt8.v y =!= 0))
(ensures fun z -> UInt8.v z == UInt8.v x / UInt8.v y)
= UInt8.div x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 17,
"end_line": 287,
"start_col": 0,
"start_line": 283
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.div",
"FStar.Range.labeled",
"Prims.l_not",
"Prims.eq2",
"Prims.int",
"FStar.UInt8.v",
"Prims.op_Division"
] | [] | false | false | false | false | false | let u8_div (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 division" (UInt8.v y =!= 0))
(ensures fun z -> UInt8.v z == UInt8.v x / UInt8.v y) =
| UInt8.div x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.max_int_sizes | val max_int_sizes:squash FStar.UInt.(max_int 10 == 1023 /\ max_int 8 == 255) | val max_int_sizes:squash FStar.UInt.(max_int 10 == 1023 /\ max_int 8 == 255) | let max_int_sizes
: squash FStar.UInt.(
max_int 10 == 1023 /\
max_int 8 == 255
)
= let open FStar.UInt in
normalize_term_spec (max_int 10) | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 36,
"end_line": 253,
"start_col": 0,
"start_line": 247
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.squash (FStar.UInt.max_int 10 == 1023 /\ FStar.UInt.max_int 8 == 255) | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.normalize_term_spec",
"Prims.int",
"FStar.UInt.max_int"
] | [] | false | false | true | false | false | let max_int_sizes:squash FStar.UInt.(max_int 10 == 1023 /\ max_int 8 == 255) =
| let open FStar.UInt in normalize_term_spec (max_int 10) | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_add | val u8_add (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 addition" (UInt.size (UInt8.v x + UInt8.v y) UInt8.n))
(ensures fun z -> UInt8.v z == UInt8.v x + UInt8.v y) | val u8_add (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 addition" (UInt.size (UInt8.v x + UInt8.v y) UInt8.n))
(ensures fun z -> UInt8.v z == UInt8.v x + UInt8.v y) | let u8_add (r:range) (x y:UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 addition" (UInt.size (UInt8.v x + UInt8.v y) UInt8.n))
(ensures fun z -> UInt8.v z == UInt8.v x + UInt8.v y)
= UInt8.add x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 17,
"end_line": 266,
"start_col": 0,
"start_line": 262
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.add",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Addition",
"FStar.UInt8.v",
"FStar.UInt8.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u8_add (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 addition" (UInt.size (UInt8.v x + UInt8.v y) UInt8.n))
(ensures fun z -> UInt8.v z == UInt8.v x + UInt8.v y) =
| UInt8.add x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_mul | val u8_mul (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires
labeled r
"Cannot verify u8 multiplication"
(UInt.size ((UInt8.v x) `Prims.op_Multiply` (UInt8.v y)) UInt8.n))
(ensures fun z -> UInt8.v z == (UInt8.v x) `Prims.op_Multiply` (UInt8.v y)) | val u8_mul (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires
labeled r
"Cannot verify u8 multiplication"
(UInt.size ((UInt8.v x) `Prims.op_Multiply` (UInt8.v y)) UInt8.n))
(ensures fun z -> UInt8.v z == (UInt8.v x) `Prims.op_Multiply` (UInt8.v y)) | let u8_mul (r:range) (x y:UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 multiplication" (UInt.size (UInt8.v x `Prims.op_Multiply` UInt8.v y) UInt8.n))
(ensures fun z -> UInt8.v z == UInt8.v x `Prims.op_Multiply` UInt8.v y)
= UInt8.mul x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 17,
"end_line": 280,
"start_col": 0,
"start_line": 276
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.mul",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Multiply",
"FStar.UInt8.v",
"FStar.UInt8.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u8_mul (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires
labeled r
"Cannot verify u8 multiplication"
(UInt.size ((UInt8.v x) `Prims.op_Multiply` (UInt8.v y)) UInt8.n))
(ensures fun z -> UInt8.v z == (UInt8.v x) `Prims.op_Multiply` (UInt8.v y)) =
| UInt8.mul x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_logand | val u8_logand (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logand` (UInt8.v y) == UInt8.v z)) | val u8_logand (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logand` (UInt8.v y) == UInt8.v z)) | let u8_logand (r:range) (x:UInt8.t) (y:UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> UInt8.v x `UInt.logand` UInt8.v y == UInt8.v z))
= UInt8.logand x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 20,
"end_line": 303,
"start_col": 0,
"start_line": 299
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.logand",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt8.n",
"FStar.UInt.logand",
"FStar.UInt8.v"
] | [] | false | false | false | false | false | let u8_logand (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logand` (UInt8.v y) == UInt8.v z)) =
| UInt8.logand x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_logor | val u8_logor (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logor` (UInt8.v y) == UInt8.v z)) | val u8_logor (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logor` (UInt8.v y) == UInt8.v z)) | let u8_logor (r:range) (x:UInt8.t) (y:UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> UInt8.v x `UInt.logor` UInt8.v y == UInt8.v z))
= UInt8.logor x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 19,
"end_line": 319,
"start_col": 0,
"start_line": 315
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.logor",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt8.n",
"FStar.UInt.logor",
"FStar.UInt8.v"
] | [] | false | false | false | false | false | let u8_logor (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logor` (UInt8.v y) == UInt8.v z)) =
| UInt8.logor x y | false |
Hacl.Impl.K256.PointMul.fst | Hacl.Impl.K256.PointMul.point_mul_g | val point_mul_g: out:point -> scalar:qelem -> Stack unit
(requires fun h ->
live h scalar /\ live h out /\ disjoint out scalar /\
qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out /\
S.to_aff_point (point_eval h1 out) ==
S.to_aff_point (S.point_mul_g (... | val point_mul_g: out:point -> scalar:qelem -> Stack unit
(requires fun h ->
live h scalar /\ live h out /\ disjoint out scalar /\
qas_nat h scalar < S.q)
(ensures fun h0 _ h1 -> modifies (loc out) h0 h1 /\
point_inv h1 out /\
S.to_aff_point (point_eval h1 out) ==
S.to_aff_point (S.point_mul_g (... | let point_mul_g out scalar =
push_frame ();
let h0 = ST.get () in
let q1 = create 15ul (u64 0) in
make_g q1;
let q2 = mk_proj_g_pow2_64 () in
let q3 = mk_proj_g_pow2_128 () in
let q4 = mk_proj_g_pow2_192 () in
proj_g_pow2_64_lseq_lemma ();
proj_g_pow2_128_lseq_lemma ();
proj_g_pow2_192_lseq_lemma ()... | {
"file_name": "code/k256/Hacl.Impl.K256.PointMul.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 176,
"start_col": 0,
"start_line": 163
} | module Hacl.Impl.K256.PointMul
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
module ST = FStar.HyperStack.ST
module LSeq = Lib.Sequence
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module BE = Hacl.Impl.Exponentiation
module ME = Hacl.Impl.MultiExp... | {
"checked_file": "/",
"dependencies": [
"Spec.K256.fst.checked",
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.PrecompBaseTable256.fsti.check... | [
{
"abbrev": false,
"full_module": "Hacl.K256.PrecompTable",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Group",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.K256.Point",
"short_module": null
},
{
"abbrev": fals... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | out: Hacl.Impl.K256.Point.point -> scalar: Hacl.K256.Scalar.qelem
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Hacl.Impl.K256.Point.point",
"Hacl.K256.Scalar.qelem",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.K256.PointMul.lemma_exp_four_fw_local",
"Lib.Buffer.as_seq",
"Lib.Buffer.MUT",
"Lib.IntTypes.uint64",
"Hacl.K256.Scalar.qnlimb",
"Hacl.Impl.K256.PointMul.point_mul_g_noalloc",
"Hacl.... | [] | false | true | false | false | false | let point_mul_g out scalar =
| push_frame ();
let h0 = ST.get () in
let q1 = create 15ul (u64 0) in
make_g q1;
let q2 = mk_proj_g_pow2_64 () in
let q3 = mk_proj_g_pow2_128 () in
let q4 = mk_proj_g_pow2_192 () in
proj_g_pow2_64_lseq_lemma ();
proj_g_pow2_128_lseq_lemma ();
proj_g_pow2_192_lseq_lemma ();
point_mul_g_noalloc out scalar q1 q2 q3 q4;
lem... | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_rem | val u8_rem (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 remainder" (UInt8.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt8.v x) (UInt8.v y) == UInt8.v z)) | val u8_rem (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 remainder" (UInt8.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt8.v x) (UInt8.v y) == UInt8.v z)) | let u8_rem (r:range) (x y:UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 remainder" (UInt8.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt8.v x) (UInt8.v y) == UInt8.v z))
= UInt8.rem x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 17,
"end_line": 295,
"start_col": 0,
"start_line": 291
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.rem",
"FStar.Range.labeled",
"Prims.l_not",
"Prims.eq2",
"Prims.int",
"FStar.UInt8.v",
"FStar.UInt.uint_t",
"FStar.UInt8.n",
"FStar.UInt.mod"
] | [] | false | false | false | false | false | let u8_rem (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 remainder" (UInt8.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt8.v x) (UInt8.v y) == UInt8.v z)) =
| UInt8.rem x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_shift_right | val u8_shift_right (r: range) (a: UInt8.t) (s: UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift right" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt8.v a) (UInt32.v s) = UInt8.v c)) | val u8_shift_right (r: range) (a: UInt8.t) (s: UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift right" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt8.v a) (UInt32.v s) = UInt8.v c)) | let u8_shift_right (r:range) (a:UInt8.t) (s:UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift right" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt8.v a) (UInt32.v s) = UInt8.v c))
= UInt8.shift_right a s | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 25,
"end_line": 335,
"start_col": 0,
"start_line": 331
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> a: FStar.UInt8.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt32.t",
"FStar.UInt8.shift_right",
"FStar.Range.labeled",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt32.v",
"FStar.UInt8.n",
"Prims.op_Equality",
"FStar.UInt.uint_t",
"FStar.UInt.shift_right",
"FStar.UInt8.v"
] | [] | false | false | false | false | false | let u8_shift_right (r: range) (a: UInt8.t) (s: UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift right" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt8.v a) (UInt32.v s) = UInt8.v c)) =
| UInt8.shift_right a s | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_lognot | val u8_lognot (r: range) (x: UInt8.t)
: Pure UInt8.t (requires True) (ensures (fun z -> UInt.lognot (UInt8.v x) == UInt8.v z)) | val u8_lognot (r: range) (x: UInt8.t)
: Pure UInt8.t (requires True) (ensures (fun z -> UInt.lognot (UInt8.v x) == UInt8.v z)) | let u8_lognot (r:range) (x:UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> UInt.lognot (UInt8.v x) == UInt8.v z))
= UInt8.lognot x | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 327,
"start_col": 0,
"start_line": 323
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.lognot",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt8.n",
"FStar.UInt.lognot",
"FStar.UInt8.v"
] | [] | false | false | false | false | false | let u8_lognot (r: range) (x: UInt8.t)
: Pure UInt8.t (requires True) (ensures (fun z -> UInt.lognot (UInt8.v x) == UInt8.v z)) =
| UInt8.lognot x | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_sub | val u8_sub (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 subtraction" (UInt.size (UInt8.v x - UInt8.v y) UInt8.n)
)
(ensures fun z -> UInt8.v z == UInt8.v x - UInt8.v y) | val u8_sub (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 subtraction" (UInt.size (UInt8.v x - UInt8.v y) UInt8.n)
)
(ensures fun z -> UInt8.v z == UInt8.v x - UInt8.v y) | let u8_sub (r:range) (x y:UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 subtraction" (UInt.size (UInt8.v x - UInt8.v y) UInt8.n))
(ensures fun z -> UInt8.v z == UInt8.v x - UInt8.v y)
= UInt8.sub x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 17,
"end_line": 273,
"start_col": 0,
"start_line": 269
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.sub",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Subtraction",
"FStar.UInt8.v",
"FStar.UInt8.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u8_sub (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 subtraction" (UInt.size (UInt8.v x - UInt8.v y) UInt8.n)
)
(ensures fun z -> UInt8.v z == UInt8.v x - UInt8.v y) =
| UInt8.sub x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_mul | val u16_mul (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r
"Cannot verify u16 multiplication"
(UInt.size ((UInt16.v x) `Prims.op_Multiply` (UInt16.v y)) UInt16.n))
(ensures fun z -> UInt16.v z == (UInt16.v x) `Prims.op_Multiply` (UInt16.v y)) | val u16_mul (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r
"Cannot verify u16 multiplication"
(UInt.size ((UInt16.v x) `Prims.op_Multiply` (UInt16.v y)) UInt16.n))
(ensures fun z -> UInt16.v z == (UInt16.v x) `Prims.op_Multiply` (UInt16.v y)) | let u16_mul (r:range) (x y:UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 multiplication" (UInt.size (UInt16.v x `Prims.op_Multiply` UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x `Prims.op_Multiply` UInt16.v y)
= UInt16.mul x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 366,
"start_col": 0,
"start_line": 362
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.mul",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Multiply",
"FStar.UInt16.v",
"FStar.UInt16.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u16_mul (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r
"Cannot verify u16 multiplication"
(UInt.size ((UInt16.v x) `Prims.op_Multiply` (UInt16.v y)) UInt16.n))
(ensures fun z -> UInt16.v z == (UInt16.v x) `Prims.op_Multiply` (UInt16.v y)) =
| UInt16.mul x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_sub | val u16_sub (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r "Cannot verify u16 subtraction" (UInt.size (UInt16.v x - UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x - UInt16.v y) | val u16_sub (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r "Cannot verify u16 subtraction" (UInt.size (UInt16.v x - UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x - UInt16.v y) | let u16_sub (r:range) (x y:UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 subtraction" (UInt.size (UInt16.v x - UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x - UInt16.v y)
= UInt16.sub x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 359,
"start_col": 0,
"start_line": 355
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.sub",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Subtraction",
"FStar.UInt16.v",
"FStar.UInt16.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u16_sub (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r "Cannot verify u16 subtraction" (UInt.size (UInt16.v x - UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x - UInt16.v y) =
| UInt16.sub x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_logxor | val u8_logxor (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logxor` (UInt8.v y) == UInt8.v z)) | val u8_logxor (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logxor` (UInt8.v y) == UInt8.v z)) | let u8_logxor (r:range) (x:UInt8.t) (y:UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> UInt8.v x `UInt.logxor` UInt8.v y == UInt8.v z))
= UInt8.logxor x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 20,
"end_line": 311,
"start_col": 0,
"start_line": 307
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt8.t -> y: FStar.UInt8.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt8.logxor",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt8.n",
"FStar.UInt.logxor",
"FStar.UInt8.v"
] | [] | false | false | false | false | false | let u8_logxor (r: range) (x y: UInt8.t)
: Pure UInt8.t
(requires True)
(ensures (fun z -> (UInt8.v x) `UInt.logxor` (UInt8.v y) == UInt8.v z)) =
| UInt8.logxor x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u8_shift_left | val u8_shift_left (r: range) (a: UInt8.t) (s: UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift left" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt8.v a) (UInt32.v s) = UInt8.v c)) | val u8_shift_left (r: range) (a: UInt8.t) (s: UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift left" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt8.v a) (UInt32.v s) = UInt8.v c)) | let u8_shift_left (r:range) (a:UInt8.t) (s:UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift left" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt8.v a) (UInt32.v s) = UInt8.v c))
= UInt8.shift_left a s | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 24,
"end_line": 343,
"start_col": 0,
"start_line": 339
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> a: FStar.UInt8.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt8.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt8.t",
"FStar.UInt32.t",
"FStar.UInt8.shift_left",
"FStar.Range.labeled",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt32.v",
"FStar.UInt8.n",
"Prims.op_Equality",
"FStar.UInt.uint_t",
"FStar.UInt.shift_left",
"FStar.UInt8.v"
] | [] | false | false | false | false | false | let u8_shift_left (r: range) (a: UInt8.t) (s: UInt32.t)
: Pure UInt8.t
(requires labeled r "Cannot verify u8 shift left" (UInt32.v s < UInt8.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt8.v a) (UInt32.v s) = UInt8.v c)) =
| UInt8.shift_left a s | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_add | val u16_add (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r "Cannot verify u16 addition" (UInt.size (UInt16.v x + UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x + UInt16.v y) | val u16_add (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r "Cannot verify u16 addition" (UInt.size (UInt16.v x + UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x + UInt16.v y) | let u16_add (r:range) (x y:UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 addition" (UInt.size (UInt16.v x + UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x + UInt16.v y)
= UInt16.add x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 352,
"start_col": 0,
"start_line": 348
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.add",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Addition",
"FStar.UInt16.v",
"FStar.UInt16.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u16_add (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires
labeled r "Cannot verify u16 addition" (UInt.size (UInt16.v x + UInt16.v y) UInt16.n))
(ensures fun z -> UInt16.v z == UInt16.v x + UInt16.v y) =
| UInt16.add x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_logand | val u16_logand (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logand` (UInt16.v y) == UInt16.v z)) | val u16_logand (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logand` (UInt16.v y) == UInt16.v z)) | let u16_logand (r:range) (x:UInt16.t) (y:UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> UInt16.v x `UInt.logand` UInt16.v y == UInt16.v z))
= UInt16.logand x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 21,
"end_line": 389,
"start_col": 0,
"start_line": 385
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.logand",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt16.n",
"FStar.UInt.logand",
"FStar.UInt16.v"
] | [] | false | false | false | false | false | let u16_logand (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logand` (UInt16.v y) == UInt16.v z)) =
| UInt16.logand x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_sub | val u32_sub (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r "Cannot verify u32 subtraction" (UInt.size (UInt32.v x - UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x - UInt32.v y) | val u32_sub (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r "Cannot verify u32 subtraction" (UInt.size (UInt32.v x - UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x - UInt32.v y) | let u32_sub (r:range) (x y:UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 subtraction" (UInt.size (UInt32.v x - UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x - UInt32.v y)
= UInt32.sub x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 446,
"start_col": 0,
"start_line": 442
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.sub",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Subtraction",
"FStar.UInt32.v",
"FStar.UInt32.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u32_sub (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r "Cannot verify u32 subtraction" (UInt.size (UInt32.v x - UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x - UInt32.v y) =
| UInt32.sub x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_logxor | val u16_logxor (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logxor` (UInt16.v y) == UInt16.v z)) | val u16_logxor (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logxor` (UInt16.v y) == UInt16.v z)) | let u16_logxor (r:range) (x:UInt16.t) (y:UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> UInt16.v x `UInt.logxor` UInt16.v y == UInt16.v z))
= UInt16.logxor x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 21,
"end_line": 397,
"start_col": 0,
"start_line": 393
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.logxor",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt16.n",
"FStar.UInt.logxor",
"FStar.UInt16.v"
] | [] | false | false | false | false | false | let u16_logxor (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logxor` (UInt16.v y) == UInt16.v z)) =
| UInt16.logxor x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_mul | val u32_mul (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r
"Cannot verify u32 multiplication"
(UInt.size ((UInt32.v x) `Prims.op_Multiply` (UInt32.v y)) UInt32.n))
(ensures fun z -> UInt32.v z == (UInt32.v x) `Prims.op_Multiply` (UInt32.v y)) | val u32_mul (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r
"Cannot verify u32 multiplication"
(UInt.size ((UInt32.v x) `Prims.op_Multiply` (UInt32.v y)) UInt32.n))
(ensures fun z -> UInt32.v z == (UInt32.v x) `Prims.op_Multiply` (UInt32.v y)) | let u32_mul (r:range) (x y:UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 multiplication" (UInt.size (UInt32.v x `Prims.op_Multiply` UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x `Prims.op_Multiply` UInt32.v y)
= UInt32.mul x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 453,
"start_col": 0,
"start_line": 449
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.mul",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Multiply",
"FStar.UInt32.v",
"FStar.UInt32.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u32_mul (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r
"Cannot verify u32 multiplication"
(UInt.size ((UInt32.v x) `Prims.op_Multiply` (UInt32.v y)) UInt32.n))
(ensures fun z -> UInt32.v z == (UInt32.v x) `Prims.op_Multiply` (UInt32.v y)) =
| UInt32.mul x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_logxor | val u32_logxor (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logxor` (UInt32.v y) == UInt32.v z)) | val u32_logxor (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logxor` (UInt32.v y) == UInt32.v z)) | let u32_logxor (r:range) (x:UInt32.t) (y:UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> UInt32.v x `UInt.logxor` UInt32.v y == UInt32.v z))
= UInt32.logxor x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 21,
"end_line": 484,
"start_col": 0,
"start_line": 480
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.logxor",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt32.n",
"FStar.UInt.logxor",
"FStar.UInt32.v"
] | [] | false | false | false | false | false | let u32_logxor (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logxor` (UInt32.v y) == UInt32.v z)) =
| UInt32.logxor x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.id | val id (#t: Type) (x: t) : Tot t | val id (#t: Type) (x: t) : Tot t | let id (#t: Type) (x: t) : Tot t = x | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 36,
"end_line": 611,
"start_col": 0,
"start_line": 611
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: t -> t | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let id (#t: Type) (x: t) : Tot t =
| x | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_logor | val u32_logor (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logor` (UInt32.v y) == UInt32.v z)) | val u32_logor (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logor` (UInt32.v y) == UInt32.v z)) | let u32_logor (r:range) (x:UInt32.t) (y:UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> UInt32.v x `UInt.logor` UInt32.v y == UInt32.v z))
= UInt32.logor x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 20,
"end_line": 492,
"start_col": 0,
"start_line": 488
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.logor",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt32.n",
"FStar.UInt.logor",
"FStar.UInt32.v"
] | [] | false | false | false | false | false | let u32_logor (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logor` (UInt32.v y) == UInt32.v z)) =
| UInt32.logor x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_lognot | val u16_lognot (r: range) (x: UInt16.t)
: Pure UInt16.t (requires True) (ensures (fun z -> UInt.lognot (UInt16.v x) == UInt16.v z)) | val u16_lognot (r: range) (x: UInt16.t)
: Pure UInt16.t (requires True) (ensures (fun z -> UInt.lognot (UInt16.v x) == UInt16.v z)) | let u16_lognot (r:range) (x:UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> UInt.lognot (UInt16.v x) == UInt16.v z))
= UInt16.lognot x | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 19,
"end_line": 413,
"start_col": 0,
"start_line": 409
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.lognot",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt16.n",
"FStar.UInt.lognot",
"FStar.UInt16.v"
] | [] | false | false | false | false | false | let u16_lognot (r: range) (x: UInt16.t)
: Pure UInt16.t (requires True) (ensures (fun z -> UInt.lognot (UInt16.v x) == UInt16.v z)) =
| UInt16.lognot x | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_logor | val u16_logor (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logor` (UInt16.v y) == UInt16.v z)) | val u16_logor (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logor` (UInt16.v y) == UInt16.v z)) | let u16_logor (r:range) (x:UInt16.t) (y:UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> UInt16.v x `UInt.logor` UInt16.v y == UInt16.v z))
= UInt16.logor x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 20,
"end_line": 405,
"start_col": 0,
"start_line": 401
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.logor",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt16.n",
"FStar.UInt.logor",
"FStar.UInt16.v"
] | [] | false | false | false | false | false | let u16_logor (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires True)
(ensures (fun z -> (UInt16.v x) `UInt.logor` (UInt16.v y) == UInt16.v z)) =
| UInt16.logor x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_rem | val u16_rem (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 remainder" (UInt16.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt16.v x) (UInt16.v y) == UInt16.v z)) | val u16_rem (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 remainder" (UInt16.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt16.v x) (UInt16.v y) == UInt16.v z)) | let u16_rem (r:range) (x y:UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 remainder" (UInt16.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt16.v x) (UInt16.v y) == UInt16.v z))
= UInt16.rem x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 381,
"start_col": 0,
"start_line": 377
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.rem",
"FStar.Range.labeled",
"Prims.l_not",
"Prims.eq2",
"Prims.int",
"FStar.UInt16.v",
"FStar.UInt.uint_t",
"FStar.UInt16.n",
"FStar.UInt.mod"
] | [] | false | false | false | false | false | let u16_rem (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 remainder" (UInt16.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt16.v x) (UInt16.v y) == UInt16.v z)) =
| UInt16.rem x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_div | val u16_div (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 division" (UInt16.v y =!= 0))
(ensures fun z -> UInt16.v z == UInt16.v x / UInt16.v y) | val u16_div (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 division" (UInt16.v y =!= 0))
(ensures fun z -> UInt16.v z == UInt16.v x / UInt16.v y) | let u16_div (r:range) (x y:UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 division" (UInt16.v y =!= 0))
(ensures fun z -> UInt16.v z == UInt16.v x / UInt16.v y)
= UInt16.div x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 373,
"start_col": 0,
"start_line": 369
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt16.t -> y: FStar.UInt16.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt16.div",
"FStar.Range.labeled",
"Prims.l_not",
"Prims.eq2",
"Prims.int",
"FStar.UInt16.v",
"Prims.op_Division"
] | [] | false | false | false | false | false | let u16_div (r: range) (x y: UInt16.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 division" (UInt16.v y =!= 0))
(ensures fun z -> UInt16.v z == UInt16.v x / UInt16.v y) =
| UInt16.div x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_add | val u32_add (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r "Cannot verify u32 addition" (UInt.size (UInt32.v x + UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x + UInt32.v y) | val u32_add (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r "Cannot verify u32 addition" (UInt.size (UInt32.v x + UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x + UInt32.v y) | let u32_add (r:range) (x y:UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 addition" (UInt.size (UInt32.v x + UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x + UInt32.v y)
= UInt32.add x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 439,
"start_col": 0,
"start_line": 435
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.add",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Addition",
"FStar.UInt32.v",
"FStar.UInt32.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u32_add (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires
labeled r "Cannot verify u32 addition" (UInt.size (UInt32.v x + UInt32.v y) UInt32.n))
(ensures fun z -> UInt32.v z == UInt32.v x + UInt32.v y) =
| UInt32.add x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_rem | val u32_rem (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 remainder" (UInt32.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt32.v x) (UInt32.v y) == UInt32.v z)) | val u32_rem (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 remainder" (UInt32.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt32.v x) (UInt32.v y) == UInt32.v z)) | let u32_rem (r:range) (x y:UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 remainder" (UInt32.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt32.v x) (UInt32.v y) == UInt32.v z))
= UInt32.rem x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 468,
"start_col": 0,
"start_line": 464
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.rem",
"FStar.Range.labeled",
"Prims.l_not",
"Prims.eq2",
"Prims.int",
"FStar.UInt32.v",
"FStar.UInt.uint_t",
"FStar.UInt32.n",
"FStar.UInt.mod"
] | [] | false | false | false | false | false | let u32_rem (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 remainder" (UInt32.v y =!= 0))
(ensures (fun z -> FStar.UInt.mod (UInt32.v x) (UInt32.v y) == UInt32.v z)) =
| UInt32.rem x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_logand | val u32_logand (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logand` (UInt32.v y) == UInt32.v z)) | val u32_logand (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logand` (UInt32.v y) == UInt32.v z)) | let u32_logand (r:range) (x:UInt32.t) (y:UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> UInt32.v x `UInt.logand` UInt32.v y == UInt32.v z))
= UInt32.logand x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 21,
"end_line": 476,
"start_col": 0,
"start_line": 472
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.logand",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt32.n",
"FStar.UInt.logand",
"FStar.UInt32.v"
] | [] | false | false | false | false | false | let u32_logand (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> (UInt32.v x) `UInt.logand` (UInt32.v y) == UInt32.v z)) =
| UInt32.logand x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u64_sub | val u64_sub (r: range) (x y: UInt64.t)
: Pure UInt64.t
(requires
labeled r "Cannot verify u64 subtraction" (UInt.size (UInt64.v x - UInt64.v y) UInt64.n))
(ensures fun z -> UInt64.v z == UInt64.v x - UInt64.v y) | val u64_sub (r: range) (x y: UInt64.t)
: Pure UInt64.t
(requires
labeled r "Cannot verify u64 subtraction" (UInt.size (UInt64.v x - UInt64.v y) UInt64.n))
(ensures fun z -> UInt64.v z == UInt64.v x - UInt64.v y) | let u64_sub (r:range) (x y:UInt64.t)
: Pure UInt64.t
(requires labeled r "Cannot verify u64 subtraction" (UInt.size (UInt64.v x - UInt64.v y) UInt64.n))
(ensures fun z -> UInt64.v z == UInt64.v x - UInt64.v y)
= UInt64.sub x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 532,
"start_col": 0,
"start_line": 528
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt64.t -> y: FStar.UInt64.t -> Prims.Pure FStar.UInt64.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt64.t",
"FStar.UInt64.sub",
"FStar.Range.labeled",
"FStar.UInt.size",
"Prims.op_Subtraction",
"FStar.UInt64.v",
"FStar.UInt64.n",
"Prims.eq2",
"Prims.int"
] | [] | false | false | false | false | false | let u64_sub (r: range) (x y: UInt64.t)
: Pure UInt64.t
(requires
labeled r "Cannot verify u64 subtraction" (UInt.size (UInt64.v x - UInt64.v y) UInt64.n))
(ensures fun z -> UInt64.v z == UInt64.v x - UInt64.v y) =
| UInt64.sub x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_lognot | val u32_lognot (r: range) (x: UInt32.t)
: Pure UInt32.t (requires True) (ensures (fun z -> UInt.lognot (UInt32.v x) == UInt32.v z)) | val u32_lognot (r: range) (x: UInt32.t)
: Pure UInt32.t (requires True) (ensures (fun z -> UInt.lognot (UInt32.v x) == UInt32.v z)) | let u32_lognot (r:range) (x:UInt32.t)
: Pure UInt32.t
(requires True)
(ensures (fun z -> UInt.lognot (UInt32.v x) == UInt32.v z))
= UInt32.lognot x | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 19,
"end_line": 500,
"start_col": 0,
"start_line": 496
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.lognot",
"Prims.l_True",
"Prims.eq2",
"FStar.UInt.uint_t",
"FStar.UInt32.n",
"FStar.UInt.lognot",
"FStar.UInt32.v"
] | [] | false | false | false | false | false | let u32_lognot (r: range) (x: UInt32.t)
: Pure UInt32.t (requires True) (ensures (fun z -> UInt.lognot (UInt32.v x) == UInt32.v z)) =
| UInt32.lognot x | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_shift_left | val u16_shift_left (r: range) (a: UInt16.t) (s: UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift left" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt16.v a) (UInt32.v s) = UInt16.v c)) | val u16_shift_left (r: range) (a: UInt16.t) (s: UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift left" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt16.v a) (UInt32.v s) = UInt16.v c)) | let u16_shift_left (r:range) (a:UInt16.t) (s:UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift left" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt16.v a) (UInt32.v s) = UInt16.v c))
= UInt16.shift_left a s | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 25,
"end_line": 429,
"start_col": 0,
"start_line": 425
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> a: FStar.UInt16.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt32.t",
"FStar.UInt16.shift_left",
"FStar.Range.labeled",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt32.v",
"FStar.UInt16.n",
"Prims.op_Equality",
"FStar.UInt.uint_t",
"FStar.UInt.shift_left",
"FStar.UInt16.v"
] | [] | false | false | false | false | false | let u16_shift_left (r: range) (a: UInt16.t) (s: UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift left" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt16.v a) (UInt32.v s) = UInt16.v c)) =
| UInt16.shift_left a s | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u16_shift_right | val u16_shift_right (r: range) (a: UInt16.t) (s: UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift right" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt16.v a) (UInt32.v s) = UInt16.v c)) | val u16_shift_right (r: range) (a: UInt16.t) (s: UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift right" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt16.v a) (UInt32.v s) = UInt16.v c)) | let u16_shift_right (r:range) (a:UInt16.t) (s:UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift right" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt16.v a) (UInt32.v s) = UInt16.v c))
= UInt16.shift_right a s | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 26,
"end_line": 421,
"start_col": 0,
"start_line": 417
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> a: FStar.UInt16.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt16.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt16.t",
"FStar.UInt32.t",
"FStar.UInt16.shift_right",
"FStar.Range.labeled",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt32.v",
"FStar.UInt16.n",
"Prims.op_Equality",
"FStar.UInt.uint_t",
"FStar.UInt.shift_right",
"FStar.UInt16.v"
] | [] | false | false | false | false | false | let u16_shift_right (r: range) (a: UInt16.t) (s: UInt32.t)
: Pure UInt16.t
(requires labeled r "Cannot verify u16 shift right" (UInt32.v s < UInt16.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt16.v a) (UInt32.v s) = UInt16.v c)) =
| UInt16.shift_right a s | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_div | val u32_div (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 division" (UInt32.v y =!= 0))
(ensures fun z -> UInt32.v z == UInt32.v x / UInt32.v y) | val u32_div (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 division" (UInt32.v y =!= 0))
(ensures fun z -> UInt32.v z == UInt32.v x / UInt32.v y) | let u32_div (r:range) (x y:UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 division" (UInt32.v y =!= 0))
(ensures fun z -> UInt32.v z == UInt32.v x / UInt32.v y)
= UInt32.div x y | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 18,
"end_line": 460,
"start_col": 0,
"start_line": 456
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> x: FStar.UInt32.t -> y: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.div",
"FStar.Range.labeled",
"Prims.l_not",
"Prims.eq2",
"Prims.int",
"FStar.UInt32.v",
"Prims.op_Division"
] | [] | false | false | false | false | false | let u32_div (r: range) (x y: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 division" (UInt32.v y =!= 0))
(ensures fun z -> UInt32.v z == UInt32.v x / UInt32.v y) =
| UInt32.div x y | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_shift_left | val u32_shift_left (r: range) (a s: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift left" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt32.v a) (UInt32.v s) = UInt32.v c)) | val u32_shift_left (r: range) (a s: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift left" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt32.v a) (UInt32.v s) = UInt32.v c)) | let u32_shift_left (r:range) (a:UInt32.t) (s:UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift left" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt32.v a) (UInt32.v s) = UInt32.v c))
= UInt32.shift_left a s | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 25,
"end_line": 516,
"start_col": 0,
"start_line": 512
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> a: FStar.UInt32.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.shift_left",
"FStar.Range.labeled",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt32.v",
"FStar.UInt32.n",
"Prims.op_Equality",
"FStar.UInt.uint_t",
"FStar.UInt.shift_left"
] | [] | false | false | false | false | false | let u32_shift_left (r: range) (a s: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift left" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_left (UInt32.v a) (UInt32.v s) = UInt32.v c)) =
| UInt32.shift_left a s | false |
EverParse3d.Prelude.fsti | EverParse3d.Prelude.u32_shift_right | val u32_shift_right (r: range) (a s: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift right" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt32.v a) (UInt32.v s) = UInt32.v c)) | val u32_shift_right (r: range) (a s: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift right" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt32.v a) (UInt32.v s) = UInt32.v c)) | let u32_shift_right (r:range) (a:UInt32.t) (s:UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift right" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt32.v a) (UInt32.v s) = UInt32.v c))
= UInt32.shift_right a s | {
"file_name": "src/3d/prelude/EverParse3d.Prelude.fsti",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 26,
"end_line": 508,
"start_col": 0,
"start_line": 504
} | (*
Copyright 2019 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.UInt16.fsti.checked",
"FStar.UInt.fsti.checked",
"FStar.Range.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lem... | [
{
"abbrev": true,
"full_module": "LowParse.Spec.ListUpTo",
"short_module": "LUT"
},
{
"abbrev": true,
"full_module": "FStar.Bytes",
"short_module": "B32"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 2,
"max_fuel": 0,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Range.range -> a: FStar.UInt32.t -> s: FStar.UInt32.t -> Prims.Pure FStar.UInt32.t | Prims.Pure | [] | [] | [
"FStar.Range.range",
"FStar.UInt32.t",
"FStar.UInt32.shift_right",
"FStar.Range.labeled",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.UInt32.v",
"FStar.UInt32.n",
"Prims.op_Equality",
"FStar.UInt.uint_t",
"FStar.UInt.shift_right"
] | [] | false | false | false | false | false | let u32_shift_right (r: range) (a s: UInt32.t)
: Pure UInt32.t
(requires labeled r "Cannot verify u32 shift right" (UInt32.v s < UInt32.n))
(ensures (fun c -> FStar.UInt.shift_right (UInt32.v a) (UInt32.v s) = UInt32.v c)) =
| UInt32.shift_right a s | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.