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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
FStar.Int64.fst | FStar.Int64.shift_right | val shift_right (a:t) (s:UInt32.t) : Pure t
(requires (0 <= v a /\ UInt32.v s < n))
(ensures (fun c -> FStar.Int.shift_right (v a) (UInt32.v s) = v c)) | val shift_right (a:t) (s:UInt32.t) : Pure t
(requires (0 <= v a /\ UInt32.v s < n))
(ensures (fun c -> FStar.Int.shift_right (v a) (UInt32.v s) = v c)) | let shift_right a s = Mk (shift_right (v a) (UInt32.v s)) | {
"file_name": "ulib/FStar.Int64.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 67,
"start_col": 0,
"start_line": 67
} | (*
Copyright 2008-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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Int.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Int64.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sho... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 | a: FStar.Int64.t -> s: FStar.UInt32.t -> Prims.Pure FStar.Int64.t | Prims.Pure | [] | [] | [
"FStar.Int64.t",
"FStar.UInt32.t",
"FStar.Int64.Mk",
"FStar.Int.shift_right",
"FStar.Int64.n",
"FStar.Int64.v",
"FStar.UInt32.v"
] | [] | false | false | false | false | false | let shift_right a s =
| Mk (shift_right (v a) (UInt32.v s)) | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wp_Loop_body0 | val va_wp_Loop_body0
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
(va_s0: va_state)
(va_k: (va_state -> nat -> Type0))
: Type0 | val va_wp_Loop_body0
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
(va_s0: va_state)
(va_k: (va_state -> nat -> Type0))
: Type0 | let va_wp_Loop_body0 (va_old:va_state) (va_in_hash_orig:hash256) (va_in_in_b:buffer128)
(va_in_k_b:buffer128) (va_in_count:nat) (va_s0:va_state) (va_k:(va_state -> nat -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ (sha_enabled /\ sse_enabled) /\ Vale.X64.Decls.validSrcAddrs128
(va_get_mem_heaplet 0 va_s0) (va_get_... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 1646,
"start_col": 0,
"start_line": 1605
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_old: Vale.X64.Decls.va_state ->
va_in_hash_orig: Vale.SHA.SHA_helpers.hash256 ->
va_in_in_b: Vale.X64.Memory.buffer128 ->
va_in_k_b: Vale.X64.Memory.buffer128 ->
va_in_count: Prims.nat ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.nat -> Type0)
-> T... | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_state",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.sha_enabled",
"Vale.X64.CPU_Features_s.sse_enabled",
"Vale.X64.Decls.validSrcAddrs128",
"Vale.X64.Decls.va_get_mem... | [] | false | false | false | true | true | let va_wp_Loop_body0
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
(va_s0: va_state)
(va_k: (va_state -> nat -> Type0))
: Type0 =
| (va_get_ok va_s0 /\ (sha_enabled /\ sse_enabled) /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rRsi va_old)
va_in_in_b
(4 `op_Multiply` (va_get_reg64 rRdx va_old))
(va_get_mem_layout va_s0)
Secret /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Loop_rounds | val va_lemma_Loop_rounds : va_b0:va_code -> va_s0:va_state -> in_b:buffer128 -> k_b:buffer128 ->
offset:nat -> hash_orig:hash256
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Loop_rounds ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrsOffse... | val va_lemma_Loop_rounds : va_b0:va_code -> va_s0:va_state -> in_b:buffer128 -> k_b:buffer128 ->
offset:nat -> hash_orig:hash256
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Loop_rounds ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrsOffse... | let va_lemma_Loop_rounds va_b0 va_s0 in_b k_b offset hash_orig =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6;
va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0;
va_Mod_reg64 rRdx; va_Mod_reg64 rRsi; va_Mod_ok] in
let va_qc... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 1420,
"start_col": 0,
"start_line": 1391
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
offset: Prims.nat ->
hash_orig: Vale.SHA.SHA_helpers.hash256
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X6... | [] | false | false | false | false | false | let va_lemma_Loop_rounds va_b0 va_s0 in_b k_b offset hash_orig =
| let va_mods:va_mods_t =
[
va_Mod_flags; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5;
va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg64 rRdx;
va_Mod_reg64 rRsi; va_Mod_ok
]
in
let va_qc = va_qcode_Loop_rounds va_mods in_b k_b offset hash_orig in
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_quick_Loop | val va_quick_Loop (in_b k_b: buffer128) : (va_quickCode unit (va_code_Loop ())) | val va_quick_Loop (in_b k_b: buffer128) : (va_quickCode unit (va_code_Loop ())) | let va_quick_Loop (in_b:buffer128) (k_b:buffer128) : (va_quickCode unit (va_code_Loop ())) =
(va_QProc (va_code_Loop ()) ([va_Mod_flags; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm
6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0;
va_Mod_reg64 rRdx; va_Mod_reg64 ... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 92,
"end_line": 2026,
"start_col": 0,
"start_line": 2023
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | in_b: Vale.X64.Memory.buffer128 -> k_b: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.SHA.X64.va_code_Loop ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCode.va_QProc",
"Prims.unit",
"Vale.SHA.X64.va_code_Loop",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_reg64",
"Vale.X64.Machine_s.rRdx",
"Vale.X64.Machine_s.r... | [] | false | false | false | false | false | let va_quick_Loop (in_b k_b: buffer128) : (va_quickCode unit (va_code_Loop ())) =
| (va_QProc (va_code_Loop ())
([
va_Mod_flags; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5;
va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg64 rRdx;
va_Mod_reg64 rRsi
])
(va_wp_Loop in_b k_b)
(va_wpProof_Loop in_b k_b)) | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_qcode_Loop_while0 | val va_qcode_Loop_while0
(va_mods: va_mods_t)
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
: (va_quickCode (nat) (va_code_Loop_while0 ())) | val va_qcode_Loop_while0
(va_mods: va_mods_t)
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
: (va_quickCode (nat) (va_code_Loop_while0 ())) | let va_qcode_Loop_while0 (va_mods:va_mods_t) (va_old:va_state) (va_in_hash_orig:hash256)
(va_in_in_b:buffer128) (va_in_k_b:buffer128) (va_in_count:nat) : (va_quickCode (nat)
(va_code_Loop_while0 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let (hash_orig:hash256)
= va_in_ha... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 91,
"end_line": 1726,
"start_col": 0,
"start_line": 1697
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_mods: Vale.X64.QuickCode.va_mods_t ->
va_old: Vale.X64.Decls.va_state ->
va_in_hash_orig: Vale.SHA.SHA_helpers.hash256 ->
va_in_in_b: Vale.X64.Memory.buffer128 ->
va_in_k_b: Vale.X64.Memory.buffer128 ->
va_in_count: Prims.nat
-> Vale.X64.QuickCode.va_quickCode Prims.nat (Vale.SHA.X64.va_co... | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.Decls.va_state",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Vale.X64.QuickCodes.qblock",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.Machine_s.While",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp",
"Vale.X64.QuickCod... | [] | false | false | false | false | false | let va_qcode_Loop_while0
(va_mods: va_mods_t)
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
: (va_quickCode (nat) (va_code_Loop_while0 ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let hash_orig:hash256 = va_in_hash_orig in
let in_b:buffer128 = va_in_in_b in
let k_b:buffer128 = va_in_k_b in
let count:nat = va_in_count in
va_QBind va_range1
"***** PRECONDITION NOT ... | false |
FStar.Int64.fst | FStar.Int64.shift_arithmetic_right | val shift_arithmetic_right (a:t) (s:UInt32.t) : Pure t
(requires (UInt32.v s < n))
(ensures (fun c -> FStar.Int.shift_arithmetic_right (v a) (UInt32.v s) = v c)) | val shift_arithmetic_right (a:t) (s:UInt32.t) : Pure t
(requires (UInt32.v s < n))
(ensures (fun c -> FStar.Int.shift_arithmetic_right (v a) (UInt32.v s) = v c)) | let shift_arithmetic_right a s = Mk (shift_arithmetic_right (v a) (UInt32.v s)) | {
"file_name": "ulib/FStar.Int64.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 79,
"end_line": 71,
"start_col": 0,
"start_line": 71
} | (*
Copyright 2008-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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Int.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Int64.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sho... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 | a: FStar.Int64.t -> s: FStar.UInt32.t -> Prims.Pure FStar.Int64.t | Prims.Pure | [] | [] | [
"FStar.Int64.t",
"FStar.UInt32.t",
"FStar.Int64.Mk",
"FStar.Int.shift_arithmetic_right",
"FStar.Int64.n",
"FStar.Int64.v",
"FStar.UInt32.v"
] | [] | false | false | false | false | false | let shift_arithmetic_right a s =
| Mk (shift_arithmetic_right (v a) (UInt32.v s)) | false |
FStar.Int64.fst | FStar.Int64.shift_left | val shift_left (a:t) (s:UInt32.t) : Pure t
(requires (0 <= v a /\ v a * pow2 (UInt32.v s) <= max_int n /\ UInt32.v s < n))
(ensures (fun c -> FStar.Int.shift_left (v a) (UInt32.v s) = v c)) | val shift_left (a:t) (s:UInt32.t) : Pure t
(requires (0 <= v a /\ v a * pow2 (UInt32.v s) <= max_int n /\ UInt32.v s < n))
(ensures (fun c -> FStar.Int.shift_left (v a) (UInt32.v s) = v c)) | let shift_left a s = Mk (shift_left (v a) (UInt32.v s)) | {
"file_name": "ulib/FStar.Int64.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"end_line": 69,
"start_col": 0,
"start_line": 69
} | (*
Copyright 2008-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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Int.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Int64.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Int",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"sho... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"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 | a: FStar.Int64.t -> s: FStar.UInt32.t -> Prims.Pure FStar.Int64.t | Prims.Pure | [] | [] | [
"FStar.Int64.t",
"FStar.UInt32.t",
"FStar.Int64.Mk",
"FStar.Int.shift_left",
"FStar.Int64.n",
"FStar.Int64.v",
"FStar.UInt32.v"
] | [] | false | false | false | false | false | let shift_left a s =
| Mk (shift_left (v a) (UInt32.v s)) | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_codegen_success_Sha_update_bytes_stdcall | val va_codegen_success_Sha_update_bytes_stdcall : win:bool -> Tot va_pbool | val va_codegen_success_Sha_update_bytes_stdcall : win:bool -> Tot va_pbool | let va_codegen_success_Sha_update_bytes_stdcall win =
(va_pbool_and (va_codegen_success_CreateHeaplets ()) (va_pbool_and (if win then va_pbool_and
(va_codegen_success_PushXmm_Secret (va_op_xmm_xmm 15) (va_op_reg_opr64_reg64 rRax))
(va_pbool_and (va_codegen_success_PushXmm_Secret (va_op_xmm_xmm 14) (va_op_reg_... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 77,
"end_line": 2641,
"start_col": 0,
"start_line": 2578
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | win: Prims.bool -> Vale.X64.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Vale.X64.Decls.va_pbool_and",
"Vale.X64.InsMem.va_codegen_success_CreateHeaplets",
"Vale.X64.InsStack.va_codegen_success_PushXmm_Secret",
"Vale.X64.Decls.va_op_xmm_xmm",
"Vale.X64.Decls.va_op_reg_opr64_reg64",
"Vale.X64.Machine_s.rRax",
"Vale.X64.InsStack.va_codegen_success_Push_Secret"... | [] | false | false | false | true | false | let va_codegen_success_Sha_update_bytes_stdcall win =
| (va_pbool_and (va_codegen_success_CreateHeaplets ())
(va_pbool_and (if win
then
va_pbool_and (va_codegen_success_PushXmm_Secret (va_op_xmm_xmm 15)
(va_op_reg_opr64_reg64 rRax))
(va_pbool_and (va_codegen_success_PushXmm_Secret (va_op_xmm_xmm 14)
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wp_Loop | val va_wp_Loop (in_b k_b: buffer128) (va_s0: va_state) (va_k: (va_state -> unit -> Type0)) : Type0 | val va_wp_Loop (in_b k_b: buffer128) (va_s0: va_state) (va_k: (va_state -> unit -> Type0)) : Type0 | let va_wp_Loop (in_b:buffer128) (k_b:buffer128) (va_s0:va_state) (va_k:(va_state -> unit -> Type0))
: Type0 =
(va_get_ok va_s0 /\ (sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128
(va_get_mem_heaplet 0 va_s0) (va_get_reg64 rRsi va_s0) in_b (4 `op_Multiply` va_get_reg64 rRdx
va_s0) (va_get_mem_l... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 56,
"end_line": 1996,
"start_col": 0,
"start_line": 1973
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.sha_enabled",
"Vale.X64.CPU_Features_s.sse_enabled",
"Vale.X64.Decls.validSrcAddrs128",
"Vale.X64.Decls.va_get_mem_heaplet",
"Vale.X64.Decls.va_g... | [] | false | false | false | true | true | let va_wp_Loop (in_b k_b: buffer128) (va_s0: va_state) (va_k: (va_state -> unit -> Type0)) : Type0 =
| (va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rRsi va_s0)
in_b
(4 `op_Multiply` (va_get_reg64 rRdx va_s0))
(va_get_mem_layout va_s0)
Secret /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wpProof_Loop_rounds | val va_wpProof_Loop_rounds : in_b:buffer128 -> k_b:buffer128 -> offset:nat -> hash_orig:hash256 ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Loop_rounds in_b k_b offset hash_orig va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) ... | val va_wpProof_Loop_rounds : in_b:buffer128 -> k_b:buffer128 -> offset:nat -> hash_orig:hash256 ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Loop_rounds in_b k_b offset hash_orig va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) ... | let va_wpProof_Loop_rounds in_b k_b offset hash_orig va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Loop_rounds (va_code_Loop_rounds ()) va_s0 in_b k_b offset
hash_orig in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 10 va_sM (va_update_xmm 9 va_sM
(va_update_xmm ... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 1477,
"start_col": 0,
"start_line": 1464
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
offset: Prims.nat ->
hash_orig: Vale.SHA.SHA_helpers.hash256 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel... | Prims.Ghost | [] | [] | [
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
... | [] | false | false | false | false | false | let va_wpProof_Loop_rounds in_b k_b offset hash_orig va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Loop_rounds (va_code_Loop_rounds ()) va_s0 in_b k_b offset hash_orig in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_xmm 10
va_sM
(va_update_xmm 9
va_sM
(va_update_xmm 7
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_code_Sha_update_bytes_stdcall | val va_code_Sha_update_bytes_stdcall : win:bool -> Tot va_code | val va_code_Sha_update_bytes_stdcall : win:bool -> Tot va_code | let va_code_Sha_update_bytes_stdcall win =
(va_Block (va_CCons (va_code_CreateHeaplets ()) (va_CCons (if win then va_Block (va_CCons
(va_code_PushXmm_Secret (va_op_xmm_xmm 15) (va_op_reg_opr64_reg64 rRax)) (va_CCons
(va_code_PushXmm_Secret (va_op_xmm_xmm 14) (va_op_reg_opr64_reg64 rRax)) (va_CCons
(va_cod... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 2575,
"start_col": 0,
"start_line": 2524
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | win: Prims.bool -> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Vale.X64.Decls.va_Block",
"Vale.X64.Decls.va_CCons",
"Vale.X64.InsMem.va_code_CreateHeaplets",
"Vale.X64.InsStack.va_code_PushXmm_Secret",
"Vale.X64.Decls.va_op_xmm_xmm",
"Vale.X64.Decls.va_op_reg_opr64_reg64",
"Vale.X64.Machine_s.rRax",
"Vale.X64.InsStack.va_code_Push_Secret",
"Val... | [] | false | false | false | true | false | let va_code_Sha_update_bytes_stdcall win =
| (va_Block (va_CCons (va_code_CreateHeaplets ())
(va_CCons (if win
then
va_Block (va_CCons (va_code_PushXmm_Secret (va_op_xmm_xmm 15)
(va_op_reg_opr64_reg64 rRax))
(va_CCons (va_code_PushXmm_Secret (va_op_xmm_xmm 14)
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wp_Loop_while0 | val va_wp_Loop_while0
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
(va_s0: va_state)
(va_k: (va_state -> nat -> Type0))
: Type0 | val va_wp_Loop_while0
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
(va_s0: va_state)
(va_k: (va_state -> nat -> Type0))
: Type0 | let va_wp_Loop_while0 (va_old:va_state) (va_in_hash_orig:hash256) (va_in_in_b:buffer128)
(va_in_k_b:buffer128) (va_in_count:nat) (va_s0:va_state) (va_k:(va_state -> nat -> Type0)) :
Type0 =
(va_get_ok va_s0 /\ (sha_enabled /\ sse_enabled) /\ Vale.X64.Decls.validSrcAddrs128
(va_get_mem_heaplet 0 va_s0) (va_get... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 1862,
"start_col": 0,
"start_line": 1822
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_old: Vale.X64.Decls.va_state ->
va_in_hash_orig: Vale.SHA.SHA_helpers.hash256 ->
va_in_in_b: Vale.X64.Memory.buffer128 ->
va_in_k_b: Vale.X64.Memory.buffer128 ->
va_in_count: Prims.nat ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.nat -> Type0)
-> T... | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_state",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.sha_enabled",
"Vale.X64.CPU_Features_s.sse_enabled",
"Vale.X64.Decls.validSrcAddrs128",
"Vale.X64.Decls.va_get_mem... | [] | false | false | false | true | true | let va_wp_Loop_while0
(va_old: va_state)
(va_in_hash_orig: hash256)
(va_in_in_b va_in_k_b: buffer128)
(va_in_count: nat)
(va_s0: va_state)
(va_k: (va_state -> nat -> Type0))
: Type0 =
| (va_get_ok va_s0 /\ (sha_enabled /\ sse_enabled) /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rRsi va_old)
va_in_in_b
(4 `op_Multiply` (va_get_reg64 rRdx va_old))
(va_get_mem_layout va_s0)
Secret /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_quick_Epilogue | val va_quick_Epilogue (ctx_b: buffer128) : (va_quickCode unit (va_code_Epilogue ())) | val va_quick_Epilogue (ctx_b: buffer128) : (va_quickCode unit (va_code_Epilogue ())) | let va_quick_Epilogue (ctx_b:buffer128) : (va_quickCode unit (va_code_Epilogue ())) =
(va_QProc (va_code_Epilogue ()) ([va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 7; va_Mod_xmm 2;
va_Mod_xmm 1; va_Mod_mem]) (va_wp_Epilogue ctx_b) (va_wpProof_Epilogue ctx_b)) | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 2166,
"start_col": 0,
"start_line": 2164
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | ctx_b: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.SHA.X64.va_code_Epilogue ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCode.va_QProc",
"Prims.unit",
"Vale.SHA.X64.va_code_Epilogue",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_mem",
"Prim... | [] | false | false | false | false | false | let va_quick_Epilogue (ctx_b: buffer128) : (va_quickCode unit (va_code_Epilogue ())) =
| (va_QProc (va_code_Epilogue ())
([va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 7; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_mem])
(va_wp_Epilogue ctx_b)
(va_wpProof_Epilogue ctx_b)) | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wpProof_Loop_while0 | val va_wpProof_Loop_while0 : va_old:va_state -> va_in_hash_orig:hash256 -> va_in_in_b:buffer128 ->
va_in_k_b:buffer128 -> va_in_count:nat -> va_s0:va_state -> va_k:(va_state -> nat -> Type0)
-> Ghost (va_state & va_fuel & nat)
(requires (va_t_require va_s0 /\ va_wp_Loop_while0 va_old va_in_hash_orig va_in_in_b va... | val va_wpProof_Loop_while0 : va_old:va_state -> va_in_hash_orig:hash256 -> va_in_in_b:buffer128 ->
va_in_k_b:buffer128 -> va_in_count:nat -> va_s0:va_state -> va_k:(va_state -> nat -> Type0)
-> Ghost (va_state & va_fuel & nat)
(requires (va_t_require va_s0 /\ va_wp_Loop_while0 va_old va_in_hash_orig va_in_in_b va... | let va_wpProof_Loop_while0 va_old va_in_hash_orig va_in_in_b va_in_k_b va_in_count va_s0 va_k =
let (va_sM, va_f0, count) = va_lemma_Loop_while0 (va_code_Loop_while0 ()) va_s0 va_old
va_in_hash_orig va_in_in_b va_in_k_b va_in_count in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_xmm 9 va_sM... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 1888,
"start_col": 0,
"start_line": 1875
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_old: Vale.X64.Decls.va_state ->
va_in_hash_orig: Vale.SHA.SHA_helpers.hash256 ->
va_in_in_b: Vale.X64.Memory.buffer128 ->
va_in_k_b: Vale.X64.Memory.buffer128 ->
va_in_count: Prims.nat ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.nat -> Type0)
-> P... | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_state",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Prims.unit",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_xmm",
"... | [] | false | false | false | false | false | let va_wpProof_Loop_while0 va_old va_in_hash_orig va_in_in_b va_in_k_b va_in_count va_s0 va_k =
| let va_sM, va_f0, count =
va_lemma_Loop_while0 (va_code_Loop_while0 ())
va_s0
va_old
va_in_hash_orig
va_in_in_b
va_in_k_b
va_in_count
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_xmm 9
va_sM
(va_update_xmm 7
va_sM
(va_... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wpProof_Loop | val va_wpProof_Loop : in_b:buffer128 -> k_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Loop in_b k_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Loop ()) ([va_Mod_flags; va_Mod_xmm
10... | val va_wpProof_Loop : in_b:buffer128 -> k_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit
-> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Loop in_b k_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Loop ()) ([va_Mod_flags; va_Mod_xmm
10... | let va_wpProof_Loop in_b k_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Loop (va_code_Loop ()) va_s0 in_b k_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_xmm 10 va_sM (va_update_xmm 9 va_sM
(va_update_xmm 7 va_sM (va_update_xmm 6 va_sM (va_update_xmm 5 va_sM (va_u... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2020,
"start_col": 0,
"start_line": 2008
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.Qui... | [] | false | false | false | false | false | let va_wpProof_Loop in_b k_b va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Loop (va_code_Loop ()) va_s0 in_b k_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_xmm 10
va_sM
(va_update_xmm 9
va_sM
(va_update_xmm 7
va_sM
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Loop | val va_lemma_Loop : va_b0:va_code -> va_s0:va_state -> in_b:buffer128 -> k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Loop ()) va_s0 /\ va_get_ok va_s0 /\ (sha_enabled /\
sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rRsi
... | val va_lemma_Loop : va_b0:va_code -> va_s0:va_state -> in_b:buffer128 -> k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Loop ()) va_s0 /\ va_get_ok va_s0 /\ (sha_enabled /\
sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rRsi
... | let va_lemma_Loop va_b0 va_s0 in_b k_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6;
va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0;
va_Mod_reg64 rRdx; va_Mod_reg64 rRsi; va_Mod_ok] in
let va_qc = va_qcode_Loop va_mods... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 1970,
"start_col": 0,
"start_line": 1946
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_... | [] | false | false | false | false | false | let va_lemma_Loop va_b0 va_s0 in_b k_b =
| let va_mods:va_mods_t =
[
va_Mod_flags; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5;
va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg64 rRdx;
va_Mod_reg64 rRsi; va_Mod_ok
]
in
let va_qc = va_qcode_Loop va_mods in_b k_b in
let va_sM, va_fM, va_g =... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wpProof_Epilogue | val va_wpProof_Epilogue : ctx_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Epilogue ctx_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Epilogue ()) ([va_Mod_flags;
va_Mod_mem_heaplet 0; ... | val va_wpProof_Epilogue : ctx_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Epilogue ctx_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Epilogue ()) ([va_Mod_flags;
va_Mod_mem_heaplet 0; ... | let va_wpProof_Epilogue ctx_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Epilogue (va_code_Epilogue ()) va_s0 ctx_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_mem_heaplet 0 va_sM (va_update_xmm 7
va_sM (va_update_xmm 2 va_sM (va_update_xmm 1 va_sM (va_update_ok v... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2161,
"start_col": 0,
"start_line": 2152
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
ctx_b: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale... | [] | false | false | false | false | false | let va_wpProof_Epilogue ctx_b va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Epilogue (va_code_Epilogue ()) va_s0 ctx_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_mem_heaplet 0
va_sM
(va_update_xmm 7
va_sM
(va_update_xmm 2
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wp_Sha_update | val va_wp_Sha_update
(ctx_b in_b k_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_Sha_update
(ctx_b in_b k_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_Sha_update (ctx_b:buffer128) (in_b:buffer128) (k_b:buffer128) (va_s0:va_state)
(va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128
(va_get_mem_heaplet 0 va_s0) (va_get_reg64 rRsi va_s0) in_b (4 `op_Multiply` va_get_reg64 rRdx
... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 2289,
"start_col": 0,
"start_line": 2259
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.sha_enabled",
"Vale.X64.CPU_Features_s.sse_enabled",
"Vale.X64.Decls.validSrcAddrs128",
"Vale.X64.Decls.va_get_mem_heaplet",
"Vale.X64.Decls.va_g... | [] | false | false | false | true | true | let va_wp_Sha_update
(ctx_b in_b k_b: buffer128)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\
Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet 0 va_s0)
(va_get_reg64 rRsi va_s0)
in_b
(4 `op_Multiply` (va_get_reg64 rRdx va_s0))
(va_get_mem_layout va_s0)
Secret /\
Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 0 va_... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.list_disjoint_or_eq_def | val list_disjoint_or_eq_def : ptrs: Prims.list Vale.Interop.Types.b8 -> Prims.logical | let list_disjoint_or_eq_def (ptrs:list b8) =
forall (p1 p2:b8).{:pattern (L.memP p1 ptrs); (L.memP p2 ptrs)}
L.memP p1 ptrs /\
L.memP p2 ptrs ==> disjoint_or_eq_b8 p1 p2 | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 20,
"start_col": 0,
"start_line": 17
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | ptrs: Prims.list Vale.Interop.Types.b8 -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Vale.Interop.Types.b8",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"FStar.List.Tot.Base.memP",
"Vale.Interop.Heap_s.disjoint_or_eq_b8",
"Prims.logical"
] | [] | false | false | false | true | true | let list_disjoint_or_eq_def (ptrs: list b8) =
| forall (p1: b8) (p2: b8). {:pattern (L.memP p1 ptrs); (L.memP p2 ptrs)}
L.memP p1 ptrs /\ L.memP p2 ptrs ==> disjoint_or_eq_b8 p1 p2 | false | |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.disjoint_or_eq_b8 | val disjoint_or_eq_b8 : ptr1: Vale.Interop.Types.b8 -> ptr2: Vale.Interop.Types.b8 -> Prims.logical | let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.loc_disjoint (B.loc_buffer ptr1.bsrc) (B.loc_buffer ptr2.bsrc) \/
ptr1 == ptr2 | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.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 Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | ptr1: Vale.Interop.Types.b8 -> ptr2: Vale.Interop.Types.b8 -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Types.b8",
"Prims.l_or",
"LowStar.Monotonic.Buffer.loc_disjoint",
"LowStar.Monotonic.Buffer.loc_buffer",
"Vale.Interop.Types.base_typ_as_type",
"Vale.Interop.Types.__proj__Buffer__item__src",
"Vale.Interop.Types.b8_preorder",
"Vale.Interop.Types.__proj__Buffer__item__writeable",
"Vale.... | [] | false | false | false | true | true | let disjoint_or_eq_b8 (ptr1 ptr2: b8) =
| B.loc_disjoint (B.loc_buffer ptr1.bsrc) (B.loc_buffer ptr2.bsrc) \/ ptr1 == ptr2 | false | |
Vale.SHA.X64.fst | Vale.SHA.X64.va_qcode_Loop_rounds_0_15 | val va_qcode_Loop_rounds_0_15 (va_mods: va_mods_t) (in_b k_b: buffer128) (offset: nat)
: (va_quickCode unit (va_code_Loop_rounds_0_15 ())) | val va_qcode_Loop_rounds_0_15 (va_mods: va_mods_t) (in_b k_b: buffer128) (offset: nat)
: (va_quickCode unit (va_code_Loop_rounds_0_15 ())) | let va_qcode_Loop_rounds_0_15 (va_mods:va_mods_t) (in_b:buffer128) (k_b:buffer128) (offset:nat) :
(va_quickCode unit (va_code_Loop_rounds_0_15 ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_qAssertSquash
va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 146 c... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 70,
"end_line": 463,
"start_col": 0,
"start_line": 287
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_mods: Vale.X64.QuickCode.va_mods_t ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
offset: Prims.nat
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.SHA.X64.va_code_Loop_rounds_0_15 ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.Machine_s.Block",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp",
"Prims.Nil",
"Vale.X64.Machine_s.precode",
"Vale.X64.InsVecto... | [] | false | false | false | false | false | let va_qcode_Loop_rounds_0_15 (va_mods: va_mods_t) (in_b k_b: buffer128) (offset: nat)
: (va_quickCode unit (va_code_Loop_rounds_0_15 ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_qAssertSquash va_range1
"***** EXPRESSION PRECONDITIONS NOT MET WITHIN line 146 column 5 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/thirdPartyPorts/OpenSSL/sha/Vale.SHA.X64.vaf *****"
... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.list_disjoint_or_eq | val list_disjoint_or_eq : _: Prims.list Vale.Interop.Types.b8 -> Prims.logical | let list_disjoint_or_eq = opaque_make list_disjoint_or_eq_def | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 21,
"start_col": 19,
"start_line": 21
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | _: Prims.list Vale.Interop.Types.b8 -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Opaque_s.opaque_make",
"Prims.list",
"Vale.Interop.Types.b8",
"Prims.logical",
"Vale.Interop.Heap_s.list_disjoint_or_eq_def"
] | [] | false | false | false | true | true | let list_disjoint_or_eq =
| opaque_make list_disjoint_or_eq_def | false | |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Epilogue | val va_lemma_Epilogue : va_b0:va_code -> va_s0:va_state -> ctx_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Epilogue ()) va_s0 /\ va_get_ok va_s0 /\ (sse_enabled
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rRdi va_s0) ctx_b
2 (va_get_... | val va_lemma_Epilogue : va_b0:va_code -> va_s0:va_state -> ctx_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Epilogue ()) va_s0 /\ va_get_ok va_s0 /\ (sse_enabled
/\ Vale.X64.Decls.validDstAddrs128 (va_get_mem_heaplet 0 va_s0) (va_get_reg64 rRdi va_s0) ctx_b
2 (va_get_... | let va_lemma_Epilogue va_b0 va_s0 ctx_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 7; va_Mod_xmm 2;
va_Mod_xmm 1; va_Mod_ok; va_Mod_mem] in
let va_qc = va_qcode_Epilogue va_mods ctx_b in
let (va_sM, va_fM, va_g) = va_wp_sound_code_norm (va_code_Epilogue ()) va_qc va_s0 (fun va... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 2124,
"start_col": 0,
"start_line": 2101
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | va_b0: Vale.X64.Decls.va_code -> va_s0: Vale.X64.Decls.va_state -> ctx_b: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_... | [] | false | false | false | false | false | let va_lemma_Epilogue va_b0 va_s0 ctx_b =
| let va_mods:va_mods_t =
[
va_Mod_flags;
va_Mod_mem_heaplet 0;
va_Mod_xmm 7;
va_Mod_xmm 2;
va_Mod_xmm 1;
va_Mod_ok;
va_Mod_mem
]
in
let va_qc = va_qcode_Epilogue va_mods ctx_b in
let va_sM, va_fM, va_g =
va_wp_sound_code_norm (va_code_Epilogue ())
va_qc
va_s0
(fun va_s0 va_s... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wpProof_Sha_update | val va_wpProof_Sha_update : ctx_b:buffer128 -> in_b:buffer128 -> k_b:buffer128 -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Sha_update ctx_b in_b k_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Sha_u... | val va_wpProof_Sha_update : ctx_b:buffer128 -> in_b:buffer128 -> k_b:buffer128 -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Sha_update ctx_b in_b k_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_Sha_u... | let va_wpProof_Sha_update ctx_b in_b k_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Sha_update (va_code_Sha_update ()) va_s0 ctx_b in_b k_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_mem_heaplet 0 va_sM (va_update_xmm 10
va_sM (va_update_xmm 9 va_sM (va_update_xm... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2316,
"start_col": 0,
"start_line": 2302
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale... | [] | false | false | false | false | false | let va_wpProof_Sha_update ctx_b in_b k_b va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Sha_update (va_code_Sha_update ()) va_s0 ctx_b in_b k_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_mem_heaplet 0
va_sM
(va_update_xmm 10
va_sM
(va_update_xmm 9
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_quick_Sha_update | val va_quick_Sha_update (ctx_b in_b k_b: buffer128) : (va_quickCode unit (va_code_Sha_update ())) | val va_quick_Sha_update (ctx_b in_b k_b: buffer128) : (va_quickCode unit (va_code_Sha_update ())) | let va_quick_Sha_update (ctx_b:buffer128) (in_b:buffer128) (k_b:buffer128) : (va_quickCode unit
(va_code_Sha_update ())) =
(va_QProc (va_code_Sha_update ()) ([va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10; va_Mod_xmm
9; va_Mod_xmm 8; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3;
... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 96,
"end_line": 2324,
"start_col": 0,
"start_line": 2319
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.SHA.X64.va_code_Sha_update ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCode.va_QProc",
"Prims.unit",
"Vale.SHA.X64.va_code_Sha_update",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_reg64",
"... | [] | false | false | false | false | false | let va_quick_Sha_update (ctx_b in_b k_b: buffer128) : (va_quickCode unit (va_code_Sha_update ())) =
| (va_QProc (va_code_Sha_update ())
([
va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 8; va_Mod_xmm 7;
va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_xmm 0; va_Mod_reg64 rRax; va_Mod_reg64 rRdx; va_Mod_reg64 rRsi; va_Mod_... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.mk_addr_map | val mk_addr_map (ptrs: list b8 {list_disjoint_or_eq ptrs}) : GTot addr_map | val mk_addr_map (ptrs: list b8 {list_disjoint_or_eq ptrs}) : GTot addr_map | let mk_addr_map (ptrs:list b8{list_disjoint_or_eq ptrs}) : GTot addr_map =
global_addrs_map | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 18,
"end_line": 31,
"start_col": 0,
"start_line": 30
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | ptrs: Prims.list Vale.Interop.Types.b8 {Vale.Interop.Heap_s.list_disjoint_or_eq ptrs}
-> Prims.GTot Vale.Interop.Types.addr_map | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.list",
"Vale.Interop.Types.b8",
"Vale.Interop.Heap_s.list_disjoint_or_eq",
"Vale.Interop.Heap_s.global_addrs_map",
"Vale.Interop.Types.addr_map"
] | [] | false | false | false | false | false | let mk_addr_map (ptrs: list b8 {list_disjoint_or_eq ptrs}) : GTot addr_map =
| global_addrs_map | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_quick_Sha_update_bytes | val va_quick_Sha_update_bytes (ctx_b in_b k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes ())) | val va_quick_Sha_update_bytes (ctx_b in_b k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes ())) | let va_quick_Sha_update_bytes (ctx_b:buffer128) (in_b:buffer128) (k_b:buffer128) : (va_quickCode
unit (va_code_Sha_update_bytes ())) =
(va_QProc (va_code_Sha_update_bytes ()) ([va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10;
va_Mod_xmm 9; va_Mod_xmm 8; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; ... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 2516,
"start_col": 0,
"start_line": 2510
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.SHA.X64.va_code_Sha_update_bytes ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCode.va_QProc",
"Prims.unit",
"Vale.SHA.X64.va_code_Sha_update_bytes",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale.X64.QuickCode.va_Mod_xmm",
"Vale.X64.QuickCode.va_Mod_reg64... | [] | false | false | false | false | false | let va_quick_Sha_update_bytes (ctx_b in_b k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes ())) =
| (va_QProc (va_code_Sha_update_bytes ())
([
va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 8; va_Mod_xmm 7;
va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1;
va_Mod_xmm 0; va_Mod_reg64 rRax; va_Mod_reg64 rRdx; va_Mod_reg64 rRsi; v... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.list_disjoint_or_eq_reveal | val list_disjoint_or_eq_reveal : _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.Interop.Heap_s.list_disjoint_or_eq == Vale.Interop.Heap_s.list_disjoint_or_eq_def) | let list_disjoint_or_eq_reveal = opaque_revealer (`%list_disjoint_or_eq) list_disjoint_or_eq list_disjoint_or_eq_def | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 128,
"end_line": 22,
"start_col": 12,
"start_line": 22
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures Vale.Interop.Heap_s.list_disjoint_or_eq == Vale.Interop.Heap_s.list_disjoint_or_eq_def) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Opaque_s.opaque_revealer",
"Prims.list",
"Vale.Interop.Types.b8",
"Prims.logical",
"Vale.Interop.Heap_s.list_disjoint_or_eq",
"Vale.Interop.Heap_s.list_disjoint_or_eq_def"
] | [] | true | false | true | false | false | let list_disjoint_or_eq_reveal =
| opaque_revealer (`%list_disjoint_or_eq) list_disjoint_or_eq list_disjoint_or_eq_def | false | |
Vale.SHA.X64.fst | Vale.SHA.X64.va_qcode_Sha_update_bytes | val va_qcode_Sha_update_bytes (va_mods: va_mods_t) (ctx_b in_b k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes ())) | val va_qcode_Sha_update_bytes (va_mods: va_mods_t) (ctx_b in_b k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes ())) | let va_qcode_Sha_update_bytes (va_mods:va_mods_t) (ctx_b:buffer128) (in_b:buffer128)
(k_b:buffer128) : (va_quickCode unit (va_code_Sha_update_bytes ())) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in va_QBind va_range1
"***** PRECONDITION NOT MET AT line 714 column 15 of file /home/... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 55,
"end_line": 2377,
"start_col": 0,
"start_line": 2341
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_mods: Vale.X64.QuickCode.va_mods_t ->
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.SHA.X64.va_code_Sha_update_bytes ()) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.SHA.X64.va_code_Sha_update",
"Vale.X64.Machine_s.Block",
"Vale.X64.Decls.ins",
"Vale.X64.Decls.ocmp",
"Prims.Nil",
"Vale.X64.Machine_s.precode"... | [] | false | false | false | false | false | let va_qcode_Sha_update_bytes (va_mods: va_mods_t) (ctx_b in_b k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes ())) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QBind va_range1
"***** PRECONDITION NOT MET AT line 714 column 15 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/thirdPartyPorts/OpenSSL/sha/Vale.SHA.X64.vaf *****"
(va_quick_Sha_update c... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.hs_of_mem | val hs_of_mem (m: interop_heap) : HS.mem | val hs_of_mem (m: interop_heap) : HS.mem | let hs_of_mem (m:interop_heap) : HS.mem = InteropHeap?.hs m | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 66,
"end_line": 40,
"start_col": 7,
"start_line": 40
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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.Interop.Heap_s.interop_heap -> FStar.Monotonic.HyperStack.mem | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Heap_s.interop_heap",
"Vale.Interop.Heap_s.__proj__InteropHeap__item__hs",
"FStar.Monotonic.HyperStack.mem"
] | [] | false | false | false | true | false | let hs_of_mem (m: interop_heap) : HS.mem =
| InteropHeap?.hs m | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.list_live | val list_live : mem: FStar.Monotonic.HyperStack.mem -> ptrs: Prims.list Vale.Interop.Types.b8 -> Prims.logical | let list_live mem (ptrs:list b8) =
forall (p:b8).{:pattern (L.memP p ptrs)} L.memP p ptrs ==> B.live mem p.bsrc | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 26,
"start_col": 0,
"start_line": 25
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | mem: FStar.Monotonic.HyperStack.mem -> ptrs: Prims.list Vale.Interop.Types.b8 -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Prims.list",
"Vale.Interop.Types.b8",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"LowStar.Monotonic.Buffer.live",
"Vale.Interop.Types.base_typ_as_type",
"Vale.Interop.Types.__proj__Buffer__item__src",
"Vale.Interop.Types.b8_preorder",
"Vale.In... | [] | false | false | false | true | true | let list_live mem (ptrs: list b8) =
| forall (p: b8). {:pattern (L.memP p ptrs)} L.memP p ptrs ==> B.live mem p.bsrc | false | |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Loop_body0 | val va_lemma_Loop_body0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_hash_orig:hash256 -> va_in_in_b:buffer128 -> va_in_k_b:buffer128 -> va_in_count:nat
-> Ghost (va_state & va_fuel & nat)
(requires (va_require_total va_b0 (va_code_Loop_body0 ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ ss... | val va_lemma_Loop_body0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_hash_orig:hash256 -> va_in_in_b:buffer128 -> va_in_k_b:buffer128 -> va_in_count:nat
-> Ghost (va_state & va_fuel & nat)
(requires (va_require_total va_b0 (va_code_Loop_body0 ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ ss... | let va_lemma_Loop_body0 va_b0 va_s0 va_old va_in_hash_orig va_in_in_b va_in_k_b va_in_count =
let va_old = va_expand_state va_old in
let (va_mods:va_mods_t) = [va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 10; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg6... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 1602,
"start_col": 0,
"start_line": 1553
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
va_old: Vale.X64.Decls.va_state ->
va_in_hash_orig: Vale.SHA.SHA_helpers.hash256 ->
va_in_in_b: Vale.X64.Memory.buffer128 ->
va_in_k_b: Vale.X64.Memory.buffer128 ->
va_in_count: Prims.nat
-> Prims.Ghost ((Vale.X64.Decls.va... | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Vale.X64.QuickCodes.fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.Decls.va_fuel",
"Prims.unit",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X6... | [] | false | false | false | false | false | let va_lemma_Loop_body0 va_b0 va_s0 va_old va_in_hash_orig va_in_in_b va_in_k_b va_in_count =
| let va_old = va_expand_state va_old in
let va_mods:va_mods_t =
[
va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_xmm 10; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg64 rRsi; va_Mod_reg64 rRdx; va_Mod_ok;
va_Mod_flags
]
in
let va_qc = va_qcode_Loop_body0... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Sha_update | val va_lemma_Sha_update : va_b0:va_code -> va_s0:va_state -> ctx_b:buffer128 -> in_b:buffer128 ->
k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Sha_update ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet... | val va_lemma_Sha_update : va_b0:va_code -> va_s0:va_state -> ctx_b:buffer128 -> in_b:buffer128 ->
k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Sha_update ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get_mem_heaplet... | let va_lemma_Sha_update va_b0 va_s0 ctx_b in_b k_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10; va_Mod_xmm 9;
va_Mod_xmm 8; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg64 rRax; va_Mod_reg64 rRdx; v... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 2256,
"start_col": 0,
"start_line": 2225
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_... | [] | false | false | false | false | false | let va_lemma_Sha_update va_b0 va_s0 ctx_b in_b k_b =
| let va_mods:va_mods_t =
[
va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 8; va_Mod_xmm 7;
va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0;
va_Mod_reg64 rRax; va_Mod_reg64 rRdx; va_Mod_reg64 rRsi; va_Mod_ok; va_Mod_mem
]
in
let... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.addrs_of_mem | val addrs_of_mem (m: interop_heap) : addr_map | val addrs_of_mem (m: interop_heap) : addr_map | let addrs_of_mem (m:interop_heap) : addr_map = InteropHeap?.addrs m | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 42,
"start_col": 7,
"start_line": 42
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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.Interop.Heap_s.interop_heap -> Vale.Interop.Types.addr_map | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Heap_s.interop_heap",
"Vale.Interop.Heap_s.__proj__InteropHeap__item__addrs",
"Vale.Interop.Types.addr_map"
] | [] | false | false | false | true | false | let addrs_of_mem (m: interop_heap) : addr_map =
| InteropHeap?.addrs m | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.ptrs_of_mem | val ptrs_of_mem (m: interop_heap) : l: list b8 {list_disjoint_or_eq l} | val ptrs_of_mem (m: interop_heap) : l: list b8 {list_disjoint_or_eq l} | let ptrs_of_mem (m:interop_heap) : l:list b8{list_disjoint_or_eq l} = InteropHeap?.ptrs m | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 96,
"end_line": 41,
"start_col": 7,
"start_line": 41
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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.Interop.Heap_s.interop_heap
-> l: Prims.list Vale.Interop.Types.b8 {Vale.Interop.Heap_s.list_disjoint_or_eq l} | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Heap_s.interop_heap",
"Vale.Interop.Heap_s.__proj__InteropHeap__item__ptrs",
"Prims.list",
"Vale.Interop.Types.b8",
"Vale.Interop.Heap_s.list_disjoint_or_eq"
] | [] | false | false | false | false | false | let ptrs_of_mem (m: interop_heap) : l: list b8 {list_disjoint_or_eq l} =
| InteropHeap?.ptrs m | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.correct_down | val correct_down : mem: Vale.Interop.Heap_s.interop_heap -> h: Vale.Arch.MachineHeap_s.machine_heap -> Prims.logical | let correct_down (mem:interop_heap) (h:machine_heap) =
Set.equal (addrs_set mem) (Map.domain h) /\
(forall p.{:pattern (L.memP p (ptrs_of_mem mem))}
L.memP p (ptrs_of_mem mem) ==> correct_down_p mem h p) | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 65,
"start_col": 0,
"start_line": 62
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | mem: Vale.Interop.Heap_s.interop_heap -> h: Vale.Arch.MachineHeap_s.machine_heap -> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Heap_s.interop_heap",
"Vale.Arch.MachineHeap_s.machine_heap",
"Prims.l_and",
"FStar.Set.equal",
"Prims.int",
"Vale.Interop.Heap_s.addrs_set",
"FStar.Map.domain",
"Vale.Def.Types_s.nat8",
"Prims.l_Forall",
"Vale.Interop.Types.b8",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"Vale... | [] | false | false | false | true | true | let correct_down (mem: interop_heap) (h: machine_heap) =
| Set.equal (addrs_set mem) (Map.domain h) /\
(forall p. {:pattern (L.memP p (ptrs_of_mem mem))}
L.memP p (ptrs_of_mem mem) ==> correct_down_p mem h p) | false | |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.down_mem_t | val down_mem_t : Type | let down_mem_t = m:interop_heap -> GTot (h:machine_heap{correct_down m h}) | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 67,
"start_col": 0,
"start_line": 67
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | Type | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Heap_s.interop_heap",
"Vale.Arch.MachineHeap_s.machine_heap",
"Vale.Interop.Heap_s.correct_down"
] | [] | false | false | false | true | true | let down_mem_t =
| m: interop_heap -> GTot (h: machine_heap{correct_down m h}) | false | |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Loop_while0 | val va_lemma_Loop_while0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_hash_orig:hash256 -> va_in_in_b:buffer128 -> va_in_k_b:buffer128 -> va_in_count:nat
-> Ghost (va_state & va_fuel & nat)
(requires (va_require_total va_b0 (va_code_Loop_while0 ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ ... | val va_lemma_Loop_while0 : va_b0:va_code -> va_s0:va_state -> va_old:va_state ->
va_in_hash_orig:hash256 -> va_in_in_b:buffer128 -> va_in_k_b:buffer128 -> va_in_count:nat
-> Ghost (va_state & va_fuel & nat)
(requires (va_require_total va_b0 (va_code_Loop_while0 ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ ... | let va_lemma_Loop_while0 va_b0 va_s0 va_old va_in_hash_orig va_in_in_b va_in_k_b va_in_count =
let va_old = va_expand_state va_old in
let (va_mods:va_mods_t) = [va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4;
va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 10; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 23,
"end_line": 1819,
"start_col": 0,
"start_line": 1769
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
va_old: Vale.X64.Decls.va_state ->
va_in_hash_orig: Vale.SHA.SHA_helpers.hash256 ->
va_in_in_b: Vale.X64.Memory.buffer128 ->
va_in_k_b: Vale.X64.Memory.buffer128 ->
va_in_count: Prims.nat
-> Prims.Ghost ((Vale.X64.Decls.va... | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Memory.buffer128",
"Prims.nat",
"Vale.X64.QuickCodes.fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.Decls.va_fuel",
"Prims.unit",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X6... | [] | false | false | false | false | false | let va_lemma_Loop_while0 va_b0 va_s0 va_old va_in_hash_orig va_in_in_b va_in_k_b va_in_count =
| let va_old = va_expand_state va_old in
let va_mods:va_mods_t =
[
va_Mod_xmm 9; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2;
va_Mod_xmm 10; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg64 rRsi; va_Mod_reg64 rRdx; va_Mod_ok;
va_Mod_flags
]
in
let va_qc = va_qcode_Loop_while... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wpProof_Sha_update_bytes | val va_wpProof_Sha_update_bytes : ctx_b:buffer128 -> in_b:buffer128 -> k_b:buffer128 ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Sha_update_bytes ctx_b in_b k_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (v... | val va_wpProof_Sha_update_bytes : ctx_b:buffer128 -> in_b:buffer128 -> k_b:buffer128 ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Sha_update_bytes ctx_b in_b k_b va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (v... | let va_wpProof_Sha_update_bytes ctx_b in_b k_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Sha_update_bytes (va_code_Sha_update_bytes ()) va_s0 ctx_b in_b k_b
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_mem_heaplet 0 va_sM (va_update_xmm 10
va_sM (va_update_xmm... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2507,
"start_col": 0,
"start_line": 2492
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Memory.buffer128",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_Mod_mem_heaplet",
"Vale... | [] | false | false | false | false | false | let va_wpProof_Sha_update_bytes ctx_b in_b k_b va_s0 va_k =
| let va_sM, va_f0 = va_lemma_Sha_update_bytes (va_code_Sha_update_bytes ()) va_s0 ctx_b in_b k_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM
(va_update_mem_heaplet 0
va_sM
(va_update_xmm 10
va_sM
(va_update... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.mem_of_hs_roots | val mem_of_hs_roots (ptrs: list b8 {list_disjoint_or_eq ptrs}) (h: HS.mem{list_live h ptrs})
: GTot interop_heap | val mem_of_hs_roots (ptrs: list b8 {list_disjoint_or_eq ptrs}) (h: HS.mem{list_live h ptrs})
: GTot interop_heap | let mem_of_hs_roots (ptrs:list b8{list_disjoint_or_eq ptrs}) (h:HS.mem{list_live h ptrs})
: GTot interop_heap
=
InteropHeap ptrs (mk_addr_map ptrs) h | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 72,
"start_col": 0,
"start_line": 69
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
ptrs: Prims.list Vale.Interop.Types.b8 {Vale.Interop.Heap_s.list_disjoint_or_eq ptrs} ->
h: FStar.Monotonic.HyperStack.mem{Vale.Interop.Heap_s.list_live h ptrs}
-> Prims.GTot Vale.Interop.Heap_s.interop_heap | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.list",
"Vale.Interop.Types.b8",
"Vale.Interop.Heap_s.list_disjoint_or_eq",
"FStar.Monotonic.HyperStack.mem",
"Vale.Interop.Heap_s.list_live",
"Vale.Interop.Heap_s.InteropHeap",
"Vale.Interop.Heap_s.mk_addr_map",
"Vale.Interop.Heap_s.interop_heap"
] | [] | false | false | false | false | false | let mem_of_hs_roots (ptrs: list b8 {list_disjoint_or_eq ptrs}) (h: HS.mem{list_live h ptrs})
: GTot interop_heap =
| InteropHeap ptrs (mk_addr_map ptrs) h | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Sha_update_bytes | val va_lemma_Sha_update_bytes : va_b0:va_code -> va_s0:va_state -> ctx_b:buffer128 ->
in_b:buffer128 -> k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Sha_update_bytes ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get... | val va_lemma_Sha_update_bytes : va_b0:va_code -> va_s0:va_state -> ctx_b:buffer128 ->
in_b:buffer128 -> k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Sha_update_bytes ()) va_s0 /\ va_get_ok va_s0 /\
(sha_enabled /\ sse_enabled /\ Vale.X64.Decls.validSrcAddrs128 (va_get... | let va_lemma_Sha_update_bytes va_b0 va_s0 ctx_b in_b k_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10; va_Mod_xmm 9;
va_Mod_xmm 8; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm
2; va_Mod_xmm 1; va_Mod_xmm 0; va_Mod_reg64 rRax; va_Mod_reg64 r... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 2445,
"start_col": 0,
"start_line": 2412
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
k_b: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer128",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_... | [] | false | false | false | false | false | let va_lemma_Sha_update_bytes va_b0 va_s0 ctx_b in_b k_b =
| let va_mods:va_mods_t =
[
va_Mod_flags; va_Mod_mem_heaplet 0; va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 8; va_Mod_xmm 7;
va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2; va_Mod_xmm 1; va_Mod_xmm 0;
va_Mod_reg64 rRax; va_Mod_reg64 rRdx; va_Mod_reg64 rRsi; va_Mod_ok; va_Mod_mem
]
in
let... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.correct_down_p | val correct_down_p : mem: Vale.Interop.Heap_s.interop_heap ->
h: Vale.Arch.MachineHeap_s.machine_heap ->
p: Vale.Interop.Types.b8
-> Prims.GTot Prims.logical | let correct_down_p (mem:interop_heap) (h:machine_heap) (p:b8) =
let b = get_downview p.bsrc in
let length = DV.length b in
let contents = DV.as_seq (hs_of_mem mem) b in
let addr = addrs_of_mem mem p in
(forall i.{:pattern (Seq.index contents i)} 0 <= i /\ i < length ==>
h.[addr + i] == UInt8.v (FStar.Seq.... | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 57,
"end_line": 60,
"start_col": 0,
"start_line": 54
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
mem: Vale.Interop.Heap_s.interop_heap ->
h: Vale.Arch.MachineHeap_s.machine_heap ->
p: Vale.Interop.Types.b8
-> Prims.GTot Prims.logical | Prims.GTot | [
"sometrivial"
] | [] | [
"Vale.Interop.Heap_s.interop_heap",
"Vale.Arch.MachineHeap_s.machine_heap",
"Vale.Interop.Types.b8",
"Prims.l_Forall",
"Prims.int",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"Prims.l_imp",
"Prims.op_LessThanOrEqu... | [] | false | false | false | false | true | let correct_down_p (mem: interop_heap) (h: machine_heap) (p: b8) =
| let b = get_downview p.bsrc in
let length = DV.length b in
let contents = DV.as_seq (hs_of_mem mem) b in
let addr = addrs_of_mem mem p in
(forall i. {:pattern (Seq.index contents i)}
0 <= i /\ i < length ==> h.[ addr + i ] == UInt8.v (FStar.Seq.index contents i)) | false | |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.addrs_ptr | val addrs_ptr
(i: nat)
(addrs: addr_map)
(ptr: b8{i <= DV.length (get_downview ptr.bsrc)})
(acc: Set.set int)
: GTot (Set.set int) (decreases (DV.length (get_downview ptr.bsrc) - i)) | val addrs_ptr
(i: nat)
(addrs: addr_map)
(ptr: b8{i <= DV.length (get_downview ptr.bsrc)})
(acc: Set.set int)
: GTot (Set.set int) (decreases (DV.length (get_downview ptr.bsrc) - i)) | let rec addrs_ptr (i:nat) (addrs:addr_map) (ptr:b8{i <= DV.length (get_downview ptr.bsrc)}) (acc:Set.set int)
: GTot (Set.set int)
(decreases (DV.length (get_downview ptr.bsrc) - i))
=
if i = DV.length (get_downview ptr.bsrc) then acc
else addrs_ptr (i + 1) addrs ptr (Set.union (Set.singleton (addrs ptr + i... | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 49,
"start_col": 0,
"start_line": 44
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
i: Prims.nat ->
addrs: Vale.Interop.Types.addr_map ->
ptr:
Vale.Interop.Types.b8
{i <= LowStar.BufferView.Down.length (Vale.Interop.Types.get_downview (Buffer?.bsrc ptr))} ->
acc: FStar.Set.set Prims.int
-> Prims.GTot (FStar.Set.set Prims.int) | Prims.GTot | [
"sometrivial",
""
] | [] | [
"Prims.nat",
"Vale.Interop.Types.addr_map",
"Vale.Interop.Types.b8",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"LowStar.BufferView.Down.length",
"FStar.UInt8.t",
"Vale.Interop.Types.get_downview",
"Vale.Interop.Types.__proj__Buffer__item__src",
"Vale.Interop.Types.b8_preorder",
"Vale.Interop.Type... | [
"recursion"
] | false | false | false | false | false | let rec addrs_ptr
(i: nat)
(addrs: addr_map)
(ptr: b8{i <= DV.length (get_downview ptr.bsrc)})
(acc: Set.set int)
: GTot (Set.set int) (decreases (DV.length (get_downview ptr.bsrc) - i)) =
| if i = DV.length (get_downview ptr.bsrc)
then acc
else addrs_ptr (i + 1) addrs ptr (Set.union (Set.singleton (addrs ptr + i)) acc) | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_wpProof_Sha_update_bytes_stdcall | val va_wpProof_Sha_update_bytes_stdcall : win:bool -> ctx_b:buffer128 -> in_b:buffer128 ->
num_val:nat64 -> k_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Sha_update_bytes_stdcall win ctx_b in_b num_val k_b va_s0
... | val va_wpProof_Sha_update_bytes_stdcall : win:bool -> ctx_b:buffer128 -> in_b:buffer128 ->
num_val:nat64 -> k_b:buffer128 -> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Sha_update_bytes_stdcall win ctx_b in_b num_val k_b va_s0
... | let va_wpProof_Sha_update_bytes_stdcall win ctx_b in_b num_val k_b va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Sha_update_bytes_stdcall (va_code_Sha_update_bytes_stdcall win)
va_s0 win ctx_b in_b num_val k_b in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_stackTaint va_sM (va_update_stack va... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 2931,
"start_col": 0,
"start_line": 2905
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
win: Prims.bool ->
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
num_val: Vale.X64.Memory.nat64 ->
k_b: Vale.X64.Memory.buffer128 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_s... | Prims.Ghost | [] | [] | [
"Prims.bool",
"Vale.X64.Memory.buffer128",
"Vale.X64.Memory.nat64",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_stackTaint",
... | [] | false | false | false | false | false | let va_wpProof_Sha_update_bytes_stdcall win ctx_b in_b num_val k_b va_s0 va_k =
| let va_sM, va_f0 =
va_lemma_Sha_update_bytes_stdcall (va_code_Sha_update_bytes_stdcall win)
va_s0
win
ctx_b
in_b
num_val
k_b
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_stackTaint va_sM
(va_update_stack va_sM
(va_update_mem_layout va_sM
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_qcode_Sha_update_bytes_stdcall | val va_qcode_Sha_update_bytes_stdcall
(va_mods: va_mods_t)
(win: bool)
(ctx_b in_b: buffer128)
(num_val: nat64)
(k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes_stdcall win)) | val va_qcode_Sha_update_bytes_stdcall
(va_mods: va_mods_t)
(win: bool)
(ctx_b in_b: buffer128)
(num_val: nat64)
(k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes_stdcall win)) | let va_qcode_Sha_update_bytes_stdcall (va_mods:va_mods_t) (win:bool) (ctx_b:buffer128)
(in_b:buffer128) (num_val:nat64) (k_b:buffer128) : (va_quickCode unit
(va_code_Sha_update_bytes_stdcall win)) =
(qblock va_mods (fun (va_s:va_state) -> let (va_old_s:va_state) = va_s in let
(ctx_ptr:(va_int_range 0 18446744... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 58,
"end_line": 2803,
"start_col": 0,
"start_line": 2644
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_mods: Vale.X64.QuickCode.va_mods_t ->
win: Prims.bool ->
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
num_val: Vale.X64.Memory.nat64 ->
k_b: Vale.X64.Memory.buffer128
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.SHA.X64.va_code_Sha_update_bytes_stdcall win) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Prims.bool",
"Vale.X64.Memory.buffer128",
"Vale.X64.Memory.nat64",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.InsMem.va_code_CreateHeaplets",
"Vale.X64.QuickCodes.if_code",
"Vale.X64.QuickCodes.block",
"Vale.X6... | [] | false | false | false | false | false | let va_qcode_Sha_update_bytes_stdcall
(va_mods: va_mods_t)
(win: bool)
(ctx_b in_b: buffer128)
(num_val: nat64)
(k_b: buffer128)
: (va_quickCode unit (va_code_Sha_update_bytes_stdcall win)) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
let ctx_ptr:(va_int_range 0 18446744073709551615) =
va_if win (fun _ -> va_get_reg64 rRcx va_s) (fun _ -> va_get_reg64 rRdi va_s)
in
let in_ptr:(va_int_range 0 18446744073709551615) =
va_if w... | false |
Vale.Interop.Heap_s.fst | Vale.Interop.Heap_s.addrs_set | val addrs_set (mem: interop_heap) : GTot (Set.set int) | val addrs_set (mem: interop_heap) : GTot (Set.set int) | let addrs_set (mem:interop_heap) : GTot (Set.set int) =
L.fold_right_gtot (ptrs_of_mem mem) (addrs_ptr 0 (addrs_of_mem mem)) Set.empty | {
"file_name": "vale/specs/interop/Vale.Interop.Heap_s.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 52,
"start_col": 0,
"start_line": 51
} | module Vale.Interop.Heap_s
open FStar.Mul
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Arch.MachineHeap_s
include Vale.Interop.Types
module L = FStar.List.Tot
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
module HS = FStar.HyperStack
[@__reduce__]
let disjoint_or_eq_b8 (ptr1 ptr2:b8) =
B.lo... | {
"checked_file": "/",
"dependencies": [
"Vale.Interop.Types.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.MachineHeap_s.fst.checked",
"prims.fst.checked",
"LowStar.BufferView.Down.fsti.checked",
"LowStar.Buffer.fst.checked",
"FStar.UInt8... | [
{
"abbrev": true,
"full_module": "FStar.HyperStack",
"short_module": "HS"
},
{
"abbrev": true,
"full_module": "LowStar.BufferView.Down",
"short_module": "DV"
},
{
"abbrev": true,
"full_module": "LowStar.Buffer",
"short_module": "B"
},
{
"abbrev": true,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 | mem: Vale.Interop.Heap_s.interop_heap -> Prims.GTot (FStar.Set.set Prims.int) | Prims.GTot | [
"sometrivial"
] | [] | [
"Vale.Interop.Heap_s.interop_heap",
"FStar.List.Tot.Base.fold_right_gtot",
"Vale.Interop.Types.b8",
"FStar.Set.set",
"Prims.int",
"Vale.Interop.Heap_s.ptrs_of_mem",
"Vale.Interop.Heap_s.addrs_ptr",
"Vale.Interop.Heap_s.addrs_of_mem",
"FStar.Set.empty"
] | [] | false | false | false | false | false | let addrs_set (mem: interop_heap) : GTot (Set.set int) =
| L.fold_right_gtot (ptrs_of_mem mem) (addrs_ptr 0 (addrs_of_mem mem)) Set.empty | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Loop_rounds_16_51_recursive | val va_lemma_Loop_rounds_16_51_recursive : va_b0:va_code -> va_s0:va_state -> i:nat ->
k_b:buffer128 -> block:block_w -> hash_orig:hash256
-> Ghost (va_state & va_fuel)(decreases %[va_b0;va_s0;i;k_b;block;hash_orig])
(requires (va_require_total va_b0 (va_code_Loop_rounds_16_51_recursive i) va_s0 /\ va_get_ok
... | val va_lemma_Loop_rounds_16_51_recursive : va_b0:va_code -> va_s0:va_state -> i:nat ->
k_b:buffer128 -> block:block_w -> hash_orig:hash256
-> Ghost (va_state & va_fuel)(decreases %[va_b0;va_s0;i;k_b;block;hash_orig])
(requires (va_require_total va_b0 (va_code_Loop_rounds_16_51_recursive i) va_s0 /\ va_get_ok
... | let rec va_lemma_Loop_rounds_16_51_recursive va_b0 va_s0 i k_b block hash_orig =
va_reveal_opaque (`%va_code_Loop_rounds_16_51_recursive) (va_code_Loop_rounds_16_51_recursive i);
let (va_old_s:va_state) = va_s0 in
let (va_b1:va_codes) = va_get_block va_b0 in
let va_b11 = va_tl va_b1 in
let va_c11 = va_hd va_b... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 951,
"start_col": 0,
"start_line": 917
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
i: Prims.nat ->
k_b: Vale.X64.Memory.buffer128 ->
block: Vale.SHA.SHA_helpers.block_w ->
hash_orig: Vale.SHA.SHA_helpers.hash256
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [
""
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Prims.nat",
"Vale.X64.Memory.buffer128",
"Vale.SHA.SHA_helpers.block_w",
"Vale.SHA.SHA_helpers.hash256",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_lemma_merge_total",
"FStar.Pervasives.Native.tuple2",
"V... | [
"recursion"
] | false | false | false | false | false | let rec va_lemma_Loop_rounds_16_51_recursive va_b0 va_s0 i k_b block hash_orig =
| va_reveal_opaque (`%va_code_Loop_rounds_16_51_recursive) (va_code_Loop_rounds_16_51_recursive i);
let va_old_s:va_state = va_s0 in
let va_b1:va_codes = va_get_block va_b0 in
let va_b11 = va_tl va_b1 in
let va_c11 = va_hd va_b1 in
let va_fc11, va_s11 =
(if (i > 4)
then
(let va_b12 = va_get_block va_c11 in
... | false |
Add.fst | Add.add_int | [@@ FStar.Tactics.Typeclasses.tcinstance]
val add_int:additive int | [@@ FStar.Tactics.Typeclasses.tcinstance]
val add_int:additive int | instance add_int : additive int = mkadd 0 (+) | {
"file_name": "examples/typeclasses/Add.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 51,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "Add.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | Add.additive Prims.int | Prims.Tot | [
"total"
] | [] | [
"Add.mkadd",
"Prims.int",
"Prims.op_Addition"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let add_int:additive int =
| mkadd 0 ( + ) | false |
Add.fst | Add.add_bool | [@@ FStar.Tactics.Typeclasses.tcinstance]
val add_bool:additive bool | [@@ FStar.Tactics.Typeclasses.tcinstance]
val add_bool:additive bool | instance add_bool : additive bool = mkadd false ( || ) | {
"file_name": "examples/typeclasses/Add.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 53,
"start_col": 0,
"start_line": 53
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "Add.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | Add.additive Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Add.mkadd",
"Prims.bool",
"Prims.op_BarBar"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let add_bool:additive bool =
| mkadd false ( || ) | false |
Add.fst | Add.add_list | [@@ FStar.Tactics.Typeclasses.tcinstance]
val add_list (#a: _) : additive (list a) | [@@ FStar.Tactics.Typeclasses.tcinstance]
val add_list (#a: _) : additive (list a) | instance add_list #a : additive (list a) =
(* Couldn't use the smart mkadd here, oh well *)
let open FStar.List.Tot in
Mkadditive [] (@) append_nil_l append_l_nil append_assoc | {
"file_name": "examples/typeclasses/Add.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 58,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "Add.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | Add.additive (Prims.list a) | Prims.Tot | [
"total"
] | [] | [
"Add.Mkadditive",
"Prims.list",
"Prims.Nil",
"FStar.List.Tot.Base.op_At",
"FStar.List.Tot.Properties.append_nil_l",
"FStar.List.Tot.Properties.append_l_nil",
"FStar.List.Tot.Properties.append_assoc",
"Add.additive"
] | [] | false | false | false | true | false | [@@ FStar.Tactics.Typeclasses.tcinstance]
let add_list #a : additive (list a) =
| let open FStar.List.Tot in Mkadditive [] ( @ ) append_nil_l append_l_nil append_assoc | false |
Add.fst | Add.mkadd | val mkadd : #a:Type -> zero:a -> plus:(a -> a -> a)
-> Pure (additive a)
(requires (forall (x : a). plus zero x == x)
/\ (forall (x : a). plus x zero == x)
/\ (forall (x y z : a).plus (plus x y) z == plus x (plus y z)))
... | val mkadd : #a:Type -> zero:a -> plus:(a -> a -> a)
-> Pure (additive a)
(requires (forall (x : a). plus zero x == x)
/\ (forall (x : a). plus x zero == x)
/\ (forall (x y z : a).plus (plus x y) z == plus x (plus y z)))
... | let mkadd #a zero plus = Mkadditive zero plus (fun x -> ()) (fun x -> ()) (fun x y z -> ()) | {
"file_name": "examples/typeclasses/Add.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 91,
"end_line": 41,
"start_col": 0,
"start_line": 41
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.Typeclasses.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_file": "Add.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.Typeclasses",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | zero: a -> plus: (_: a -> _: a -> a) -> Prims.Pure (Add.additive a) | Prims.Pure | [] | [] | [
"Add.Mkadditive",
"Prims.unit",
"Add.additive"
] | [] | false | false | false | false | false | let mkadd #a zero plus =
| Mkadditive zero plus (fun x -> ()) (fun x -> ()) (fun x y z -> ()) | false |
FStar.Endianness.fst | FStar.Endianness.be_to_n | val be_to_n : b:bytes -> Tot nat | val be_to_n : b:bytes -> Tot nat | let rec be_to_n b
: Tot nat (decreases (S.length b))
= if S.length b = 0 then 0
else U8.v (S.last b) + pow2 8 * be_to_n (S.slice b 0 (S.length b - 1)) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 39,
"start_col": 0,
"start_line": 36
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | b: FStar.Endianness.bytes -> Prims.Tot Prims.nat | Prims.Tot | [
"",
"total"
] | [] | [
"FStar.Endianness.bytes",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"Prims.bool",
"Prims.op_Addition",
"FStar.UInt8.v",
"FStar.Seq.Properties.last",
"FStar.Mul.op_Star",
"Prims.pow2",
"FStar.Endianness.be_to_n",
"FStar.Seq.Base.slice",
"Prims.op_Subtractio... | [
"recursion"
] | false | false | false | true | false | let rec be_to_n b : Tot nat (decreases (S.length b)) =
| if S.length b = 0 then 0 else U8.v (S.last b) + pow2 8 * be_to_n (S.slice b 0 (S.length b - 1)) | false |
FStar.Endianness.fst | FStar.Endianness.le_to_n | val le_to_n : b:bytes -> Tot nat | val le_to_n : b:bytes -> Tot nat | let rec le_to_n b
: Tot nat (decreases (S.length b))
= if S.length b = 0 then 0
else U8.v (S.head b) + pow2 8 * le_to_n (S.tail b) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 34,
"start_col": 0,
"start_line": 31
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | b: FStar.Endianness.bytes -> Prims.Tot Prims.nat | Prims.Tot | [
"",
"total"
] | [] | [
"FStar.Endianness.bytes",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"Prims.bool",
"Prims.op_Addition",
"FStar.UInt8.v",
"FStar.Seq.Properties.head",
"FStar.Mul.op_Star",
"Prims.pow2",
"FStar.Endianness.le_to_n",
"FStar.Seq.Properties.tail",
"Prims.nat"
] | [
"recursion"
] | false | false | false | true | false | let rec le_to_n b : Tot nat (decreases (S.length b)) =
| if S.length b = 0 then 0 else U8.v (S.head b) + pow2 8 * le_to_n (S.tail b) | false |
FStar.Endianness.fst | FStar.Endianness.lemma_be_to_n_is_bounded | val lemma_be_to_n_is_bounded: b:bytes -> Lemma
(requires True)
(ensures (be_to_n b < pow2 (8 * Seq.length b)))
(decreases (Seq.length b)) | val lemma_be_to_n_is_bounded: b:bytes -> Lemma
(requires True)
(ensures (be_to_n b < pow2 (8 * Seq.length b)))
(decreases (Seq.length b)) | let rec lemma_be_to_n_is_bounded b =
if Seq.length b = 0 then ()
else
begin
let s = Seq.slice b 0 (Seq.length b - 1) in
assert(Seq.length s = Seq.length b - 1);
lemma_be_to_n_is_bounded s;
assert(UInt8.v (Seq.last b) < pow2 8);
assert(be_to_n s < pow2 (8 * Seq.length s));
assert(be_to_n ... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 90,
"start_col": 0,
"start_line": 75
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | b: FStar.Endianness.bytes
-> FStar.Pervasives.Lemma
(ensures FStar.Endianness.be_to_n b < Prims.pow2 (8 * FStar.Seq.Base.length b))
(decreases FStar.Seq.Base.length b) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Endianness.bytes",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"Prims.bool",
"FStar.Endianness.lemma_factorise",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus",
"FStar.Mul.op_Star",
"Prims._assert",
"Prims.b2t",
"Prims.op_LessThan... | [
"recursion"
] | false | false | true | false | false | let rec lemma_be_to_n_is_bounded b =
| if Seq.length b = 0
then ()
else
let s = Seq.slice b 0 (Seq.length b - 1) in
assert (Seq.length s = Seq.length b - 1);
lemma_be_to_n_is_bounded s;
assert (UInt8.v (Seq.last b) < pow2 8);
assert (be_to_n s < pow2 (8 * Seq.length s));
assert (be_to_n b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));
lem... | false |
FStar.Endianness.fst | FStar.Endianness.n_to_be_be_to_n | val n_to_be_be_to_n (len: nat) (s: Seq.seq U8.t) : Lemma
(requires (Seq.length s == len))
(ensures (
be_to_n s < pow2 (8 * len) /\
n_to_be len (be_to_n s) == s
))
[SMTPat (n_to_be len (be_to_n s))] | val n_to_be_be_to_n (len: nat) (s: Seq.seq U8.t) : Lemma
(requires (Seq.length s == len))
(ensures (
be_to_n s < pow2 (8 * len) /\
n_to_be len (be_to_n s) == s
))
[SMTPat (n_to_be len (be_to_n s))] | let n_to_be_be_to_n len s =
lemma_be_to_n_is_bounded s;
be_to_n_inj s (n_to_be len (be_to_n s)) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 152,
"start_col": 0,
"start_line": 150
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | len: Prims.nat -> s: FStar.Seq.Base.seq FStar.UInt8.t
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length s == len)
(ensures
FStar.Endianness.be_to_n s < Prims.pow2 (8 * len) /\
FStar.Endianness.n_to_be len (FStar.Endianness.be_to_n s) == s)
[SMTPat (FStar.Endianness.n_to_be len (FSt... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"FStar.Endianness.be_to_n_inj",
"FStar.Endianness.n_to_be",
"FStar.Endianness.be_to_n",
"Prims.unit",
"FStar.Endianness.lemma_be_to_n_is_bounded"
] | [] | true | false | true | false | false | let n_to_be_be_to_n len s =
| lemma_be_to_n_is_bounded s;
be_to_n_inj s (n_to_be len (be_to_n s)) | false |
FStar.Endianness.fst | FStar.Endianness.lemma_le_to_n_is_bounded | val lemma_le_to_n_is_bounded: b:bytes -> Lemma
(requires True)
(ensures (le_to_n b < pow2 (8 * Seq.length b)))
(decreases (Seq.length b)) | val lemma_le_to_n_is_bounded: b:bytes -> Lemma
(requires True)
(ensures (le_to_n b < pow2 (8 * Seq.length b)))
(decreases (Seq.length b)) | let rec lemma_le_to_n_is_bounded b =
if Seq.length b = 0 then ()
else
begin
let s = Seq.slice b 1 (Seq.length b) in
assert(Seq.length s = Seq.length b - 1);
lemma_le_to_n_is_bounded s;
assert(UInt8.v (Seq.index b 0) < pow2 8);
assert(le_to_n s < pow2 (8 * Seq.length s));
assert(le_to_n b... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 7,
"end_line": 73,
"start_col": 0,
"start_line": 58
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | b: FStar.Endianness.bytes
-> FStar.Pervasives.Lemma
(ensures FStar.Endianness.le_to_n b < Prims.pow2 (8 * FStar.Seq.Base.length b))
(decreases FStar.Seq.Base.length b) | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Endianness.bytes",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"Prims.bool",
"FStar.Endianness.lemma_factorise",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Math.Lemmas.pow2_plus",
"FStar.Mul.op_Star",
"Prims._assert",
"Prims.b2t",
"Prims.op_LessThan... | [
"recursion"
] | false | false | true | false | false | let rec lemma_le_to_n_is_bounded b =
| if Seq.length b = 0
then ()
else
let s = Seq.slice b 1 (Seq.length b) in
assert (Seq.length s = Seq.length b - 1);
lemma_le_to_n_is_bounded s;
assert (UInt8.v (Seq.index b 0) < pow2 8);
assert (le_to_n s < pow2 (8 * Seq.length s));
assert (le_to_n b < pow2 8 + pow2 8 * pow2 (8 * (Seq.length b - 1)));
lemm... | false |
FStar.Endianness.fst | FStar.Endianness.n_to_be | val n_to_be:
len:nat -> n:nat{n < pow2 (8 * len)} ->
Tot (b:bytes{S.length b == len /\ n == be_to_n b})
(decreases len) | val n_to_be:
len:nat -> n:nat{n < pow2 (8 * len)} ->
Tot (b:bytes{S.length b == len /\ n == be_to_n b})
(decreases len) | let rec n_to_be len n =
if len = 0 then
S.empty
else
let len = len - 1 in
let byte = U8.uint_to_t (n % 256) in
let n' = n / 256 in
Math.pow2_plus 8 (8 * len);
let b' = n_to_be len n' in
let b'' = S.create 1 byte in
let b = S.append b' b'' in
S.lemma_eq_intro b' (S.slice b 0 len);... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 118,
"start_col": 0,
"start_line": 106
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | len: Prims.nat -> n: Prims.nat{n < Prims.pow2 (8 * len)}
-> Prims.Tot
(b: FStar.Endianness.bytes{FStar.Seq.Base.length b == len /\ n == FStar.Endianness.be_to_n b}) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.empty",
"FStar.UInt8.t",
"Prims.bool",
"Prims.unit",
"FStar.Seq.Base.lemma_eq_intro",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.append",... | [
"recursion"
] | false | false | false | false | false | let rec n_to_be len n =
| if len = 0
then S.empty
else
let len = len - 1 in
let byte = U8.uint_to_t (n % 256) in
let n' = n / 256 in
Math.pow2_plus 8 (8 * len);
let b' = n_to_be len n' in
let b'' = S.create 1 byte in
let b = S.append b' b'' in
S.lemma_eq_intro b' (S.slice b 0 len);
b | false |
FStar.Endianness.fst | FStar.Endianness.be_to_n_inj | val be_to_n_inj
(b1 b2: Seq.seq U8.t)
: Lemma
(requires (Seq.length b1 == Seq.length b2 /\ be_to_n b1 == be_to_n b2))
(ensures (Seq.equal b1 b2))
(decreases (Seq.length b1)) | val be_to_n_inj
(b1 b2: Seq.seq U8.t)
: Lemma
(requires (Seq.length b1 == Seq.length b2 /\ be_to_n b1 == be_to_n b2))
(ensures (Seq.equal b1 b2))
(decreases (Seq.length b1)) | let rec be_to_n_inj b1 b2 =
if Seq.length b1 = 0
then ()
else begin
be_to_n_inj (Seq.slice b1 0 (Seq.length b1 - 1)) (Seq.slice b2 0 (Seq.length b2 - 1));
Seq.lemma_split b1 (Seq.length b1 - 1);
Seq.lemma_split b2 (Seq.length b2 - 1)
end | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 136,
"start_col": 0,
"start_line": 129
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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.Seq.Base.seq FStar.UInt8.t -> b2: FStar.Seq.Base.seq FStar.UInt8.t
-> FStar.Pervasives.Lemma
(requires
FStar.Seq.Base.length b1 == FStar.Seq.Base.length b2 /\
FStar.Endianness.be_to_n b1 == FStar.Endianness.be_to_n b2)
(ensures FStar.Seq.Base.equal b1 b2)
(decreases FStar.S... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.bool",
"FStar.Seq.Properties.lemma_split",
"Prims.op_Subtraction",
"Prims.unit",
"FStar.Endianness.be_to_n_inj",
"FStar.Seq.Base.slice"
] | [
"recursion"
] | false | false | true | false | false | let rec be_to_n_inj b1 b2 =
| if Seq.length b1 = 0
then ()
else
(be_to_n_inj (Seq.slice b1 0 (Seq.length b1 - 1)) (Seq.slice b2 0 (Seq.length b2 - 1));
Seq.lemma_split b1 (Seq.length b1 - 1);
Seq.lemma_split b2 (Seq.length b2 - 1)) | false |
FStar.Endianness.fst | FStar.Endianness.le_to_n_inj | val le_to_n_inj
(b1 b2: Seq.seq U8.t)
: Lemma
(requires (Seq.length b1 == Seq.length b2 /\ le_to_n b1 == le_to_n b2))
(ensures (Seq.equal b1 b2))
(decreases (Seq.length b1)) | val le_to_n_inj
(b1 b2: Seq.seq U8.t)
: Lemma
(requires (Seq.length b1 == Seq.length b2 /\ le_to_n b1 == le_to_n b2))
(ensures (Seq.equal b1 b2))
(decreases (Seq.length b1)) | let rec le_to_n_inj b1 b2 =
if Seq.length b1 = 0
then ()
else begin
le_to_n_inj (Seq.slice b1 1 (Seq.length b1)) (Seq.slice b2 1 (Seq.length b2));
Seq.lemma_split b1 1;
Seq.lemma_split b2 1
end | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 145,
"start_col": 0,
"start_line": 138
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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.Seq.Base.seq FStar.UInt8.t -> b2: FStar.Seq.Base.seq FStar.UInt8.t
-> FStar.Pervasives.Lemma
(requires
FStar.Seq.Base.length b1 == FStar.Seq.Base.length b2 /\
FStar.Endianness.le_to_n b1 == FStar.Endianness.le_to_n b2)
(ensures FStar.Seq.Base.equal b1 b2)
(decreases FStar.S... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.bool",
"FStar.Seq.Properties.lemma_split",
"Prims.unit",
"FStar.Endianness.le_to_n_inj",
"FStar.Seq.Base.slice"
] | [
"recursion"
] | false | false | true | false | false | let rec le_to_n_inj b1 b2 =
| if Seq.length b1 = 0
then ()
else
(le_to_n_inj (Seq.slice b1 1 (Seq.length b1)) (Seq.slice b2 1 (Seq.length b2));
Seq.lemma_split b1 1;
Seq.lemma_split b2 1) | false |
FStar.Endianness.fst | FStar.Endianness.n_to_le_le_to_n | val n_to_le_le_to_n (len: nat) (s: Seq.seq U8.t) : Lemma
(requires (Seq.length s == len))
(ensures (
le_to_n s < pow2 (8 * len) /\
n_to_le len (le_to_n s) == s
))
[SMTPat (n_to_le len (le_to_n s))] | val n_to_le_le_to_n (len: nat) (s: Seq.seq U8.t) : Lemma
(requires (Seq.length s == len))
(ensures (
le_to_n s < pow2 (8 * len) /\
n_to_le len (le_to_n s) == s
))
[SMTPat (n_to_le len (le_to_n s))] | let n_to_le_le_to_n len s =
lemma_le_to_n_is_bounded s;
le_to_n_inj s (n_to_le len (le_to_n s)) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 156,
"start_col": 0,
"start_line": 154
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | len: Prims.nat -> s: FStar.Seq.Base.seq FStar.UInt8.t
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length s == len)
(ensures
FStar.Endianness.le_to_n s < Prims.pow2 (8 * len) /\
FStar.Endianness.n_to_le len (FStar.Endianness.le_to_n s) == s)
[SMTPat (FStar.Endianness.n_to_le len (FSt... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"FStar.Endianness.le_to_n_inj",
"FStar.Endianness.n_to_le",
"FStar.Endianness.le_to_n",
"Prims.unit",
"FStar.Endianness.lemma_le_to_n_is_bounded"
] | [] | true | false | true | false | false | let n_to_le_le_to_n len s =
| lemma_le_to_n_is_bounded s;
le_to_n_inj s (n_to_le len (le_to_n s)) | false |
FStar.Endianness.fst | FStar.Endianness.seq_uint32_of_le | val seq_uint32_of_le (l: nat) (b: bytes{ S.length b = 4 * l }):
s:S.seq UInt32.t { S.length s = l } | val seq_uint32_of_le (l: nat) (b: bytes{ S.length b = 4 * l }):
s:S.seq UInt32.t { S.length s = l } | let rec seq_uint32_of_le l b =
if S.length b = 0 then
S.empty
else
let hd, tl = Seq.split b 4 in
S.cons (uint32_of_le hd) (seq_uint32_of_le (l - 1) tl) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 171,
"start_col": 0,
"start_line": 166
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | l: Prims.nat -> b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 4 * l}
-> s: FStar.Seq.Base.seq FStar.UInt32.t {FStar.Seq.Base.length s = l} | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Endianness.bytes",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Mul.op_Star",
"FStar.Seq.Base.empty",
"FStar.UInt32.t",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.cons",
"FStar.Endianness.uint32_of_le",
"FSta... | [
"recursion"
] | false | false | false | false | false | let rec seq_uint32_of_le l b =
| if S.length b = 0
then S.empty
else
let hd, tl = Seq.split b 4 in
S.cons (uint32_of_le hd) (seq_uint32_of_le (l - 1) tl) | false |
FStar.Endianness.fst | FStar.Endianness.le_of_seq_uint32 | val le_of_seq_uint32 (s: S.seq UInt32.t):
Tot (b:bytes { S.length b = 4 * S.length s })
(decreases (S.length s)) | val le_of_seq_uint32 (s: S.seq UInt32.t):
Tot (b:bytes { S.length b = 4 * S.length s })
(decreases (S.length s)) | let rec le_of_seq_uint32 s =
if S.length s = 0 then
S.empty
else
S.append (le_of_uint32 (S.head s)) (le_of_seq_uint32 (S.tail s)) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 177,
"start_col": 0,
"start_line": 173
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | s: FStar.Seq.Base.seq FStar.UInt32.t
-> Prims.Tot (b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 4 * FStar.Seq.Base.length s}) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt32.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Base.empty",
"FStar.UInt8.t",
"Prims.bool",
"FStar.Seq.Base.append",
"FStar.Endianness.le_of_uint32",
"FStar.Seq.Properties.head",
"FStar.Endianness.le_of_seq_uint32",
"FStar.Seq.Pro... | [
"recursion"
] | false | false | false | false | false | let rec le_of_seq_uint32 s =
| if S.length s = 0 then S.empty else S.append (le_of_uint32 (S.head s)) (le_of_seq_uint32 (S.tail s)) | false |
FStar.Endianness.fst | FStar.Endianness.le_of_seq_uint64 | val le_of_seq_uint64 (s: S.seq UInt64.t):
Tot (b:bytes { S.length b = 8 * S.length s })
(decreases (S.length s)) | val le_of_seq_uint64 (s: S.seq UInt64.t):
Tot (b:bytes { S.length b = 8 * S.length s })
(decreases (S.length s)) | let rec le_of_seq_uint64 s =
if S.length s = 0 then
S.empty
else
S.append (le_of_uint64 (S.head s)) (le_of_seq_uint64 (S.tail s)) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 203,
"start_col": 0,
"start_line": 199
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | s: FStar.Seq.Base.seq FStar.UInt64.t
-> Prims.Tot (b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 8 * FStar.Seq.Base.length s}) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt64.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Base.empty",
"FStar.UInt8.t",
"Prims.bool",
"FStar.Seq.Base.append",
"FStar.Endianness.le_of_uint64",
"FStar.Seq.Properties.head",
"FStar.Endianness.le_of_seq_uint64",
"FStar.Seq.Pro... | [
"recursion"
] | false | false | false | false | false | let rec le_of_seq_uint64 s =
| if S.length s = 0 then S.empty else S.append (le_of_uint64 (S.head s)) (le_of_seq_uint64 (S.tail s)) | false |
FStar.Endianness.fst | FStar.Endianness.seq_uint32_of_be | val seq_uint32_of_be (l: nat) (b: bytes{ S.length b = 4 * l }):
s:S.seq UInt32.t { S.length s = l } | val seq_uint32_of_be (l: nat) (b: bytes{ S.length b = 4 * l }):
s:S.seq UInt32.t { S.length s = l } | let rec seq_uint32_of_be l b =
if S.length b = 0 then
S.empty
else
let hd, tl = Seq.split b 4 in
S.cons (uint32_of_be hd) (seq_uint32_of_be (l - 1) tl) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 184,
"start_col": 0,
"start_line": 179
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | l: Prims.nat -> b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 4 * l}
-> s: FStar.Seq.Base.seq FStar.UInt32.t {FStar.Seq.Base.length s = l} | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Endianness.bytes",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Mul.op_Star",
"FStar.Seq.Base.empty",
"FStar.UInt32.t",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.cons",
"FStar.Endianness.uint32_of_be",
"FSta... | [
"recursion"
] | false | false | false | false | false | let rec seq_uint32_of_be l b =
| if S.length b = 0
then S.empty
else
let hd, tl = Seq.split b 4 in
S.cons (uint32_of_be hd) (seq_uint32_of_be (l - 1) tl) | false |
FStar.Endianness.fst | FStar.Endianness.be_of_seq_uint32 | val be_of_seq_uint32 (s: S.seq UInt32.t):
Tot (b:bytes { S.length b = 4 * S.length s })
(decreases (S.length s)) | val be_of_seq_uint32 (s: S.seq UInt32.t):
Tot (b:bytes { S.length b = 4 * S.length s })
(decreases (S.length s)) | let rec be_of_seq_uint32 s =
if S.length s = 0 then
S.empty
else
S.append (be_of_uint32 (S.head s)) (be_of_seq_uint32 (S.tail s)) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 190,
"start_col": 0,
"start_line": 186
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | s: FStar.Seq.Base.seq FStar.UInt32.t
-> Prims.Tot (b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 4 * FStar.Seq.Base.length s}) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt32.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Base.empty",
"FStar.UInt8.t",
"Prims.bool",
"FStar.Seq.Base.append",
"FStar.Endianness.be_of_uint32",
"FStar.Seq.Properties.head",
"FStar.Endianness.be_of_seq_uint32",
"FStar.Seq.Pro... | [
"recursion"
] | false | false | false | false | false | let rec be_of_seq_uint32 s =
| if S.length s = 0 then S.empty else S.append (be_of_uint32 (S.head s)) (be_of_seq_uint32 (S.tail s)) | false |
FStar.Endianness.fst | FStar.Endianness.be_of_seq_uint64 | val be_of_seq_uint64 (s: S.seq UInt64.t):
Tot (b:bytes { S.length b = 8 * S.length s })
(decreases (S.length s)) | val be_of_seq_uint64 (s: S.seq UInt64.t):
Tot (b:bytes { S.length b = 8 * S.length s })
(decreases (S.length s)) | let rec be_of_seq_uint64 s =
if S.length s = 0 then
S.empty
else
S.append (be_of_uint64 (S.head s)) (be_of_seq_uint64 (S.tail s)) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 68,
"end_line": 216,
"start_col": 0,
"start_line": 212
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | s: FStar.Seq.Base.seq FStar.UInt64.t
-> Prims.Tot (b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 8 * FStar.Seq.Base.length s}) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt64.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Base.empty",
"FStar.UInt8.t",
"Prims.bool",
"FStar.Seq.Base.append",
"FStar.Endianness.be_of_uint64",
"FStar.Seq.Properties.head",
"FStar.Endianness.be_of_seq_uint64",
"FStar.Seq.Pro... | [
"recursion"
] | false | false | false | false | false | let rec be_of_seq_uint64 s =
| if S.length s = 0 then S.empty else S.append (be_of_uint64 (S.head s)) (be_of_seq_uint64 (S.tail s)) | false |
FStar.Endianness.fst | FStar.Endianness.seq_uint64_of_be | val seq_uint64_of_be (l: nat) (b: bytes{ S.length b = 8 * l }):
s:S.seq UInt64.t { S.length s = l } | val seq_uint64_of_be (l: nat) (b: bytes{ S.length b = 8 * l }):
s:S.seq UInt64.t { S.length s = l } | let rec seq_uint64_of_be l b =
if S.length b = 0 then
S.empty
else
let hd, tl = Seq.split b 8 in
S.cons (uint64_of_be hd) (seq_uint64_of_be (l - 1) tl) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 210,
"start_col": 0,
"start_line": 205
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | l: Prims.nat -> b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 8 * l}
-> s: FStar.Seq.Base.seq FStar.UInt64.t {FStar.Seq.Base.length s = l} | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Endianness.bytes",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Mul.op_Star",
"FStar.Seq.Base.empty",
"FStar.UInt64.t",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.cons",
"FStar.Endianness.uint64_of_be",
"FSta... | [
"recursion"
] | false | false | false | false | false | let rec seq_uint64_of_be l b =
| if S.length b = 0
then S.empty
else
let hd, tl = Seq.split b 8 in
S.cons (uint64_of_be hd) (seq_uint64_of_be (l - 1) tl) | false |
FStar.Endianness.fst | FStar.Endianness.seq_uint64_of_le | val seq_uint64_of_le (l: nat) (b: bytes{ S.length b = 8 * l }):
s:S.seq UInt64.t { S.length s = l } | val seq_uint64_of_le (l: nat) (b: bytes{ S.length b = 8 * l }):
s:S.seq UInt64.t { S.length s = l } | let rec seq_uint64_of_le l b =
if S.length b = 0 then
S.empty
else
let hd, tl = Seq.split b 8 in
S.cons (uint64_of_le hd) (seq_uint64_of_le (l - 1) tl) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 197,
"start_col": 0,
"start_line": 192
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | l: Prims.nat -> b: FStar.Endianness.bytes{FStar.Seq.Base.length b = 8 * l}
-> s: FStar.Seq.Base.seq FStar.UInt64.t {FStar.Seq.Base.length s = l} | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"FStar.Endianness.bytes",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Mul.op_Star",
"FStar.Seq.Base.empty",
"FStar.UInt64.t",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.cons",
"FStar.Endianness.uint64_of_le",
"FSta... | [
"recursion"
] | false | false | false | false | false | let rec seq_uint64_of_le l b =
| if S.length b = 0
then S.empty
else
let hd, tl = Seq.split b 8 in
S.cons (uint64_of_le hd) (seq_uint64_of_le (l - 1) tl) | false |
FStar.Endianness.fst | FStar.Endianness.offset_uint32_le | val offset_uint32_le (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 4 * n /\
i < n))
(ensures (
S.index (seq_uint32_of_le n b) i == uint32_of_le (S.slice b (4 * i) (4 * i + 4))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint32_of_le n b) i) ] | val offset_uint32_le (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 4 * n /\
i < n))
(ensures (
S.index (seq_uint32_of_le n b) i == uint32_of_le (S.slice b (4 * i) (4 * i + 4))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint32_of_le n b) i) ] | let rec offset_uint32_le (b: bytes) (n: nat) (i: nat) =
if S.length b = 0 then
false_elim ()
else
let hd, tl = Seq.split b 4 in
if i = 0 then
()
else
offset_uint32_le tl (n - 1) (i - 1) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 241,
"start_col": 0,
"start_line": 233
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | b: FStar.Endianness.bytes -> n: Prims.nat -> i: Prims.nat
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b = 4 * n /\ i < n)
(ensures
FStar.Seq.Base.index (FStar.Endianness.seq_uint32_of_le n b) i ==
FStar.Endianness.uint32_of_le (FStar.Seq.Base.slice b (4 * i) (4 * i + 4)))
(de... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Endianness.bytes",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Pervasives.false_elim",
"Prims.unit",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Endianness.offset_uint32_le",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple2",
... | [
"recursion"
] | false | false | true | false | false | let rec offset_uint32_le (b: bytes) (n i: nat) =
| if S.length b = 0
then false_elim ()
else
let hd, tl = Seq.split b 4 in
if i = 0 then () else offset_uint32_le tl (n - 1) (i - 1) | false |
FStar.Endianness.fst | FStar.Endianness.n_to_le | val n_to_le : len:nat -> n:nat{n < pow2 (8 * len)} ->
Tot (b:bytes{S.length b == len /\ n == le_to_n b})
(decreases len) | val n_to_le : len:nat -> n:nat{n < pow2 (8 * len)} ->
Tot (b:bytes{S.length b == len /\ n == le_to_n b})
(decreases len) | let rec n_to_le len n =
if len = 0 then
S.empty
else
let len = len - 1 in
let byte = U8.uint_to_t (n % 256) in
let n' = n / 256 in
Math.pow2_plus 8 (8 * len);
assert(n' < pow2 (8 * len ));
let b' = n_to_le len n' in
let b = S.cons byte b' in
S.lemma_eq_intro b' (S.tail b);
b | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 104,
"start_col": 0,
"start_line": 92
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"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 | len: Prims.nat -> n: Prims.nat{n < Prims.pow2 (8 * len)}
-> Prims.Tot
(b: FStar.Endianness.bytes{FStar.Seq.Base.length b == len /\ n == FStar.Endianness.le_to_n b}) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.pow2",
"FStar.Mul.op_Star",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.empty",
"FStar.UInt8.t",
"Prims.bool",
"Prims.unit",
"FStar.Seq.Base.lemma_eq_intro",
"FStar.Seq.Properties.tail",
"FStar.Seq.Base.seq",
"FStar.Seq.Base.con... | [
"recursion"
] | false | false | false | false | false | let rec n_to_le len n =
| if len = 0
then S.empty
else
let len = len - 1 in
let byte = U8.uint_to_t (n % 256) in
let n' = n / 256 in
Math.pow2_plus 8 (8 * len);
assert (n' < pow2 (8 * len));
let b' = n_to_le len n' in
let b = S.cons byte b' in
S.lemma_eq_intro b' (S.tail b);
b | false |
FStar.Endianness.fst | FStar.Endianness.offset_uint32_be | val offset_uint32_be (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 4 * n /\
i < n))
(ensures (
S.index (seq_uint32_of_be n b) i == uint32_of_be (S.slice b (4 * i) (4 * i + 4))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint32_of_be n b) i) ] | val offset_uint32_be (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 4 * n /\
i < n))
(ensures (
S.index (seq_uint32_of_be n b) i == uint32_of_be (S.slice b (4 * i) (4 * i + 4))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint32_of_be n b) i) ] | let rec offset_uint32_be (b: bytes) (n: nat) (i: nat) =
if S.length b = 0 then
false_elim ()
else
let hd, tl = Seq.split b 4 in
if i = 0 then
()
else
offset_uint32_be tl (n - 1) (i - 1) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 231,
"start_col": 0,
"start_line": 223
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | b: FStar.Endianness.bytes -> n: Prims.nat -> i: Prims.nat
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b = 4 * n /\ i < n)
(ensures
FStar.Seq.Base.index (FStar.Endianness.seq_uint32_of_be n b) i ==
FStar.Endianness.uint32_of_be (FStar.Seq.Base.slice b (4 * i) (4 * i + 4)))
(de... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Endianness.bytes",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Pervasives.false_elim",
"Prims.unit",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Endianness.offset_uint32_be",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple2",
... | [
"recursion"
] | false | false | true | false | false | let rec offset_uint32_be (b: bytes) (n i: nat) =
| if S.length b = 0
then false_elim ()
else
let hd, tl = Seq.split b 4 in
if i = 0 then () else offset_uint32_be tl (n - 1) (i - 1) | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq | val eq_of_seq (#c:_) (eq:CE.equiv c) (s1 s2: seq c) : prop | val eq_of_seq (#c:_) (eq:CE.equiv c) (s1 s2: seq c) : prop | let rec eq_of_seq #c eq s1 s2
: Tot prop (decreases length s1) =
(length s1 = length s2 /\
(length s1 = 0 \/ (
let s1s, s1l = un_snoc s1 in
let s2s, s2l = un_snoc s2 in
eq.eq s1l s2l /\ eq_of_seq eq s1s s2s))) | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 32,
"start_col": 0,
"start_line": 26
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 | eq: FStar.Algebra.CommMonoid.Equiv.equiv c -> s1: FStar.Seq.Base.seq c -> s2: FStar.Seq.Base.seq c
-> Prims.Tot Prims.prop | Prims.Tot | [
"",
"total"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Seq.Base.seq",
"Prims.l_and",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"Prims.l_or",
"Prims.int",
"FStar.Algebra.CommMonoid.Equiv.__proj__EQ__item__eq",
"FStar.Seq.Equiv.eq_of_seq",
"Prims.logical",
"FStar.Pervasiv... | [
"recursion"
] | false | false | false | true | true | let rec eq_of_seq #c eq s1 s2 : Tot prop (decreases length s1) =
| (length s1 = length s2 /\
(length s1 = 0 \/
(let s1s, s1l = un_snoc s1 in
let s2s, s2l = un_snoc s2 in
eq.eq s1l s2l /\ eq_of_seq eq s1s s2s))) | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.seq_equiv | val seq_equiv (#c:_) (eq:CE.equiv c) : (CE.equiv (seq c)) | val seq_equiv (#c:_) (eq:CE.equiv c) : (CE.equiv (seq c)) | let seq_equiv #c (eq: CE.equiv c) =
CE.EQ (eq_of_seq eq) (eq_of_seq_reflexivity eq)
(eq_of_seq_symmetry eq)
(eq_of_seq_transitivity eq) | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 93,
"start_col": 0,
"start_line": 90
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 | eq: FStar.Algebra.CommMonoid.Equiv.equiv c
-> FStar.Algebra.CommMonoid.Equiv.equiv (FStar.Seq.Base.seq c) | Prims.Tot | [
"total"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Algebra.CommMonoid.Equiv.EQ",
"FStar.Seq.Base.seq",
"FStar.Seq.Equiv.eq_of_seq",
"FStar.Seq.Equiv.eq_of_seq_reflexivity",
"FStar.Seq.Equiv.eq_of_seq_symmetry",
"FStar.Seq.Equiv.eq_of_seq_transitivity"
] | [] | false | false | false | true | false | let seq_equiv #c (eq: CE.equiv c) =
| CE.EQ (eq_of_seq eq) (eq_of_seq_reflexivity eq) (eq_of_seq_symmetry eq) (eq_of_seq_transitivity eq) | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq_reflexivity | val eq_of_seq_reflexivity (#c:_) (eq: CE.equiv c) (s: seq c)
: Lemma (ensures eq_of_seq eq s s) | val eq_of_seq_reflexivity (#c:_) (eq: CE.equiv c) (s: seq c)
: Lemma (ensures eq_of_seq eq s s) | let rec eq_of_seq_reflexivity #c (eq: CE.equiv c) s
: Lemma (ensures eq_of_seq eq s s)
(decreases length s) =
if length s > 0 then
let liat, last = un_snoc s in
eq_of_seq_reflexivity #c eq liat;
eq.reflexivity last | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 67,
"start_col": 0,
"start_line": 61
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 | eq: FStar.Algebra.CommMonoid.Equiv.equiv c -> s: FStar.Seq.Base.seq c
-> FStar.Pervasives.Lemma (ensures FStar.Seq.Equiv.eq_of_seq eq s s)
(decreases FStar.Seq.Base.length s) | FStar.Pervasives.Lemma | [
"",
"lemma"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Seq.Base.seq",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Algebra.CommMonoid.Equiv.__proj__EQ__item__reflexivity",
"Prims.unit",
"FStar.Seq.Equiv.eq_of_seq_reflexivity",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.Seq.Properties... | [
"recursion"
] | false | false | true | false | false | let rec eq_of_seq_reflexivity #c (eq: CE.equiv c) s
: Lemma (ensures eq_of_seq eq s s) (decreases length s) =
| if length s > 0
then
let liat, last = un_snoc s in
eq_of_seq_reflexivity #c eq liat;
eq.reflexivity last | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq_from_element_equality | val eq_of_seq_from_element_equality (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma (requires (length s1 = length s2) /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i)))
(ensures eq_of_seq eq s1 s2) | val eq_of_seq_from_element_equality (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma (requires (length s1 = length s2) /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i)))
(ensures eq_of_seq eq s1 s2) | let rec eq_of_seq_from_element_equality #c eq s1 s2
: Lemma (requires (length s1 = length s2) /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i)))
(ensures eq_of_seq eq s1 s2)
(decreases length s1) =
if length s1 = 0 then () else
let s1liat, s1last = un_s... | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 52,
"start_col": 0,
"start_line": 44
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 | eq: FStar.Algebra.CommMonoid.Equiv.equiv c -> s1: FStar.Seq.Base.seq c -> s2: FStar.Seq.Base.seq c
-> FStar.Pervasives.Lemma
(requires
FStar.Seq.Base.length s1 = FStar.Seq.Base.length s2 /\
(forall (i: FStar.IntegerIntervals.under (FStar.Seq.Base.length s1)).
EQ?.eq eq (FStar.Seq.Bas... | FStar.Pervasives.Lemma | [
"",
"lemma"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Seq.Base.seq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.bool",
"FStar.Seq.Equiv.eq_of_seq_from_element_equality",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.Seq.Properties.snoc",
"FStar.Pervasives.... | [
"recursion"
] | false | false | true | false | false | let rec eq_of_seq_from_element_equality #c eq s1 s2
: Lemma
(requires
(length s1 = length s2) /\
(forall (i: under (length s1)). ((index s1 i) `eq.eq` (index s2 i))))
(ensures eq_of_seq eq s1 s2)
(decreases length s1) =
| if length s1 = 0
then ()
else
let s1liat, s1last = un_snoc s1 in
let s2liat, s2last = un_snoc s2 in
eq_of_seq_from_element_equality eq s1liat s2liat | false |
FStar.Endianness.fst | FStar.Endianness.be_of_seq_uint32_slice | val be_of_seq_uint32_slice (s: S.seq U32.t) (lo: nat) (hi: nat) : Lemma
(requires (lo <= hi /\ hi <= S.length s))
(ensures (be_of_seq_uint32 (S.slice s lo hi) `S.equal` S.slice (be_of_seq_uint32 s) (4 * lo) (4 * hi))) | val be_of_seq_uint32_slice (s: S.seq U32.t) (lo: nat) (hi: nat) : Lemma
(requires (lo <= hi /\ hi <= S.length s))
(ensures (be_of_seq_uint32 (S.slice s lo hi) `S.equal` S.slice (be_of_seq_uint32 s) (4 * lo) (4 * hi))) | let be_of_seq_uint32_slice s lo hi =
slice_seq_uint32_of_be (S.length s) (be_of_seq_uint32 s) lo hi | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 366,
"start_col": 0,
"start_line": 365
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | s: FStar.Seq.Base.seq FStar.UInt32.t -> lo: Prims.nat -> hi: Prims.nat
-> FStar.Pervasives.Lemma (requires lo <= hi /\ hi <= FStar.Seq.Base.length s)
(ensures
FStar.Seq.Base.equal (FStar.Endianness.be_of_seq_uint32 (FStar.Seq.Base.slice s lo hi))
(FStar.Seq.Base.slice (FStar.Endianness.be_of_s... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt32.t",
"Prims.nat",
"FStar.Endianness.slice_seq_uint32_of_be",
"FStar.Seq.Base.length",
"FStar.Endianness.be_of_seq_uint32",
"Prims.unit"
] | [] | true | false | true | false | false | let be_of_seq_uint32_slice s lo hi =
| slice_seq_uint32_of_be (S.length s) (be_of_seq_uint32 s) lo hi | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq_condition | val eq_of_seq_condition (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma ((length s1 = length s2) /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i)) <==>
eq_of_seq eq s1 s2) | val eq_of_seq_condition (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma ((length s1 = length s2) /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i)) <==>
eq_of_seq eq s1 s2) | let eq_of_seq_condition #c eq s1 s2
: Lemma ((length s1 = length s2) /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i)) <==>
eq_of_seq eq s1 s2) =
Classical.move_requires_2 (eq_of_seq_element_equality eq) s1 s2;
Classical.move_requires_2 (eq_of_seq_from_element_equality e... | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 70,
"end_line": 59,
"start_col": 0,
"start_line": 54
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 | eq: FStar.Algebra.CommMonoid.Equiv.equiv c -> s1: FStar.Seq.Base.seq c -> s2: FStar.Seq.Base.seq c
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.length s1 = FStar.Seq.Base.length s2 /\
(forall (i: FStar.IntegerIntervals.under (FStar.Seq.Base.length s1)).
EQ?.eq eq (FStar.Seq.Base.index s... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Seq.Base.seq",
"FStar.Classical.move_requires_2",
"Prims.l_and",
"Prims.b2t",
"Prims.op_Equality",
"Prims.nat",
"FStar.Seq.Base.length",
"Prims.l_Forall",
"FStar.IntegerIntervals.under",
"FStar.Algebra.CommMonoid.Equiv.__proj__EQ__item__eq",
"FSta... | [] | false | false | true | false | false | let eq_of_seq_condition #c eq s1 s2
: Lemma
((length s1 = length s2) /\ (forall (i: under (length s1)). ((index s1 i) `eq.eq` (index s2 i))) <==>
eq_of_seq eq s1 s2) =
| Classical.move_requires_2 (eq_of_seq_element_equality eq) s1 s2;
Classical.move_requires_2 (eq_of_seq_from_element_equality eq) s1 s2 | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq_transitivity | val eq_of_seq_transitivity (#c:_) (eq: CE.equiv c) (s1 s2 s3: seq c)
: Lemma (requires eq_of_seq eq s1 s2 /\ eq_of_seq eq s2 s3)
(ensures eq_of_seq eq s1 s3) | val eq_of_seq_transitivity (#c:_) (eq: CE.equiv c) (s1 s2 s3: seq c)
: Lemma (requires eq_of_seq eq s1 s2 /\ eq_of_seq eq s2 s3)
(ensures eq_of_seq eq s1 s3) | let rec eq_of_seq_transitivity #c (eq: CE.equiv c) s1 s2 s3
: Lemma (requires eq_of_seq eq s1 s2 /\ eq_of_seq eq s2 s3)
(ensures eq_of_seq eq s1 s3)
(decreases length s1) =
if length s1 > 0 then
let lia1, las1 = un_snoc s1 in
let lia2, las2 = un_snoc s2 in
let lia3, las3 = un_snoc s3 ... | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 32,
"end_line": 88,
"start_col": 0,
"start_line": 79
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 |
eq: FStar.Algebra.CommMonoid.Equiv.equiv c ->
s1: FStar.Seq.Base.seq c ->
s2: FStar.Seq.Base.seq c ->
s3: FStar.Seq.Base.seq c
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Equiv.eq_of_seq eq s1 s2 /\ FStar.Seq.Equiv.eq_of_seq eq s2 s3)
(ensures FStar.Seq.Equiv.eq_of_seq eq s1 s3)
(... | FStar.Pervasives.Lemma | [
"",
"lemma"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Seq.Base.seq",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Algebra.CommMonoid.Equiv.__proj__EQ__item__transitivity",
"Prims.unit",
"FStar.Seq.Equiv.eq_of_seq_transitivity",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.Seq.Properti... | [
"recursion"
] | false | false | true | false | false | let rec eq_of_seq_transitivity #c (eq: CE.equiv c) s1 s2 s3
: Lemma (requires eq_of_seq eq s1 s2 /\ eq_of_seq eq s2 s3)
(ensures eq_of_seq eq s1 s3)
(decreases length s1) =
| if length s1 > 0
then
let lia1, las1 = un_snoc s1 in
let lia2, las2 = un_snoc s2 in
let lia3, las3 = un_snoc s3 in
eq_of_seq_transitivity #c eq lia1 lia2 lia3;
eq.transitivity las1 las2 las3 | false |
FStar.Endianness.fst | FStar.Endianness.offset_uint64_le | val offset_uint64_le (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 8 * n /\
i < n))
(ensures (
S.index (seq_uint64_of_le n b) i == uint64_of_le (S.slice b (8 * i) (8 * i + 8))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint64_of_le n b) i) ] | val offset_uint64_le (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 8 * n /\
i < n))
(ensures (
S.index (seq_uint64_of_le n b) i == uint64_of_le (S.slice b (8 * i) (8 * i + 8))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint64_of_le n b) i) ] | let rec offset_uint64_le (b: bytes) (n: nat) (i: nat) =
if S.length b = 0 then
false_elim ()
else
let hd, tl = Seq.split b 8 in
if i = 0 then
()
else
offset_uint64_le tl (n - 1) (i - 1) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 261,
"start_col": 0,
"start_line": 253
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | b: FStar.Endianness.bytes -> n: Prims.nat -> i: Prims.nat
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b = 8 * n /\ i < n)
(ensures
FStar.Seq.Base.index (FStar.Endianness.seq_uint64_of_le n b) i ==
FStar.Endianness.uint64_of_le (FStar.Seq.Base.slice b (8 * i) (8 * i + 8)))
(de... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Endianness.bytes",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Pervasives.false_elim",
"Prims.unit",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Endianness.offset_uint64_le",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple2",
... | [
"recursion"
] | false | false | true | false | false | let rec offset_uint64_le (b: bytes) (n i: nat) =
| if S.length b = 0
then false_elim ()
else
let hd, tl = Seq.split b 8 in
if i = 0 then () else offset_uint64_le tl (n - 1) (i - 1) | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq_element_equality | val eq_of_seq_element_equality (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma (requires eq_of_seq eq s1 s2)
(ensures length s1 = length s2 /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i))) | val eq_of_seq_element_equality (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma (requires eq_of_seq eq s1 s2)
(ensures length s1 = length s2 /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i))) | let rec eq_of_seq_element_equality #c eq s1 s2
: Lemma (requires eq_of_seq eq s1 s2)
(ensures (length s1 = length s2) /\
(forall (i: under (length s1)). (index s1 i `eq.eq` index s2 i)))
(decreases length s1) =
if (length s1 > 0) then
let s1liat, s1last = un_snoc s1 in
... | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 42,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 | eq: FStar.Algebra.CommMonoid.Equiv.equiv c -> s1: FStar.Seq.Base.seq c -> s2: FStar.Seq.Base.seq c
-> FStar.Pervasives.Lemma (requires FStar.Seq.Equiv.eq_of_seq eq s1 s2)
(ensures
FStar.Seq.Base.length s1 = FStar.Seq.Base.length s2 /\
(forall (i: FStar.IntegerIntervals.under (FStar.Seq.Base.leng... | FStar.Pervasives.Lemma | [
"",
"lemma"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Seq.Base.seq",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Seq.Equiv.eq_of_seq_element_equality",
"Prims.unit",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.Seq.Properties.snoc",
"FStar.Pervasives.Native.fst",
"FStar.Pervasives.... | [
"recursion"
] | false | false | true | false | false | let rec eq_of_seq_element_equality #c eq s1 s2
: Lemma (requires eq_of_seq eq s1 s2)
(ensures
(length s1 = length s2) /\
(forall (i: under (length s1)). ((index s1 i) `eq.eq` (index s2 i))))
(decreases length s1) =
| if (length s1 > 0)
then
let s1liat, s1last = un_snoc s1 in
let s2liat, s2last = un_snoc s2 in
eq_of_seq_element_equality eq s1liat s2liat | false |
FStar.Endianness.fst | FStar.Endianness.be_of_seq_uint32_seq_uint32_of_be | val be_of_seq_uint32_seq_uint32_of_be (n: nat) (s: S.seq U8.t) : Lemma
(requires (4 * n == S.length s))
(ensures (be_of_seq_uint32 (seq_uint32_of_be n s) `S.equal` s))
(decreases n)
[SMTPat (be_of_seq_uint32 (seq_uint32_of_be n s))] | val be_of_seq_uint32_seq_uint32_of_be (n: nat) (s: S.seq U8.t) : Lemma
(requires (4 * n == S.length s))
(ensures (be_of_seq_uint32 (seq_uint32_of_be n s) `S.equal` s))
(decreases n)
[SMTPat (be_of_seq_uint32 (seq_uint32_of_be n s))] | let rec be_of_seq_uint32_seq_uint32_of_be n s =
if n = 0
then ()
else begin
S.lemma_split s 4;
be_of_seq_uint32_seq_uint32_of_be (n - 1) (S.slice s 4 (S.length s));
let s' = seq_uint32_of_be n s in
let hd, tl = S.split s 4 in
assert (S.head s' == uint32_of_be hd);
tail_cons (uint32_of_be h... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 361,
"start_col": 0,
"start_line": 346
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | n: Prims.nat -> s: FStar.Seq.Base.seq FStar.UInt8.t
-> FStar.Pervasives.Lemma (requires 4 * n == FStar.Seq.Base.length s)
(ensures
FStar.Seq.Base.equal (FStar.Endianness.be_of_seq_uint32 (FStar.Endianness.seq_uint32_of_be n
s))
s)
(decreases n)
[SMTPat (FStar.Endi... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.nat",
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"FStar.Endianness.n_to_be_be_to_n",
"Prims.unit",
"FStar.Seq.Properties.lemma_append_inj",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.length",
"FStar.Endianness.be_of_uint32",
"FStar.Seq.Properti... | [
"recursion"
] | false | false | true | false | false | let rec be_of_seq_uint32_seq_uint32_of_be n s =
| if n = 0
then ()
else
(S.lemma_split s 4;
be_of_seq_uint32_seq_uint32_of_be (n - 1) (S.slice s 4 (S.length s));
let s' = seq_uint32_of_be n s in
let hd, tl = S.split s 4 in
assert (S.head s' == uint32_of_be hd);
tail_cons (uint32_of_be hd) (seq_uint32_of_be (n - 1) tl);
assert (S.tail s' == se... | false |
FStar.Endianness.fst | FStar.Endianness.offset_uint64_be | val offset_uint64_be (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 8 * n /\
i < n))
(ensures (
S.index (seq_uint64_of_be n b) i == uint64_of_be (S.slice b (8 * i) (8 * i + 8))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint64_of_be n b) i) ] | val offset_uint64_be (b: bytes) (n: nat) (i: nat):
Lemma
(requires (
S.length b = 8 * n /\
i < n))
(ensures (
S.index (seq_uint64_of_be n b) i == uint64_of_be (S.slice b (8 * i) (8 * i + 8))))
(decreases (
S.length b))
[ SMTPat (S.index (seq_uint64_of_be n b) i) ] | let rec offset_uint64_be (b: bytes) (n: nat) (i: nat) =
if S.length b = 0 then
false_elim ()
else
let hd, tl = Seq.split b 8 in
if i = 0 then
()
else
offset_uint64_be tl (n - 1) (i - 1) | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 41,
"end_line": 251,
"start_col": 0,
"start_line": 243
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | b: FStar.Endianness.bytes -> n: Prims.nat -> i: Prims.nat
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length b = 8 * n /\ i < n)
(ensures
FStar.Seq.Base.index (FStar.Endianness.seq_uint64_of_be n b) i ==
FStar.Endianness.uint64_of_be (FStar.Seq.Base.slice b (8 * i) (8 * i + 8)))
(de... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Endianness.bytes",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.UInt8.t",
"FStar.Pervasives.false_elim",
"Prims.unit",
"Prims.bool",
"FStar.Seq.Base.seq",
"FStar.Endianness.offset_uint64_be",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple2",
... | [
"recursion"
] | false | false | true | false | false | let rec offset_uint64_be (b: bytes) (n i: nat) =
| if S.length b = 0
then false_elim ()
else
let hd, tl = Seq.split b 8 in
if i = 0 then () else offset_uint64_be tl (n - 1) (i - 1) | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq_symmetry | val eq_of_seq_symmetry (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma (requires eq_of_seq eq s1 s2)
(ensures eq_of_seq eq s2 s1) | val eq_of_seq_symmetry (#c:_) (eq: CE.equiv c) (s1 s2: seq c)
: Lemma (requires eq_of_seq eq s1 s2)
(ensures eq_of_seq eq s2 s1) | let rec eq_of_seq_symmetry #c (eq: CE.equiv c) s1 s2
: Lemma (requires eq_of_seq eq s1 s2)
(ensures eq_of_seq eq s2 s1)
(decreases length s1) =
if length s1 > 0 then
let lia1, las1 = un_snoc s1 in
let lia2, las2 = un_snoc s2 in
eq_of_seq_symmetry #c eq lia1 lia2;
eq.symmetry las1 la... | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 23,
"end_line": 77,
"start_col": 0,
"start_line": 69
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 | eq: FStar.Algebra.CommMonoid.Equiv.equiv c -> s1: FStar.Seq.Base.seq c -> s2: FStar.Seq.Base.seq c
-> FStar.Pervasives.Lemma (requires FStar.Seq.Equiv.eq_of_seq eq s1 s2)
(ensures FStar.Seq.Equiv.eq_of_seq eq s2 s1)
(decreases FStar.Seq.Base.length s1) | FStar.Pervasives.Lemma | [
"",
"lemma"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"FStar.Seq.Base.seq",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Algebra.CommMonoid.Equiv.__proj__EQ__item__symmetry",
"Prims.unit",
"FStar.Seq.Equiv.eq_of_seq_symmetry",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"FStar.Seq.Properties.snoc"... | [
"recursion"
] | false | false | true | false | false | let rec eq_of_seq_symmetry #c (eq: CE.equiv c) s1 s2
: Lemma (requires eq_of_seq eq s1 s2) (ensures eq_of_seq eq s2 s1) (decreases length s1) =
| if length s1 > 0
then
let lia1, las1 = un_snoc s1 in
let lia2, las2 = un_snoc s2 in
eq_of_seq_symmetry #c eq lia1 lia2;
eq.symmetry las1 las2 | false |
FStar.Endianness.fst | FStar.Endianness.seq_uint32_of_be_be_of_seq_uint32 | val seq_uint32_of_be_be_of_seq_uint32 (n: nat) (s: S.seq U32.t) : Lemma
(requires (n == S.length s))
(ensures (seq_uint32_of_be n (be_of_seq_uint32 s) `S.equal` s))
(decreases n)
[SMTPat (seq_uint32_of_be n (be_of_seq_uint32 s))] | val seq_uint32_of_be_be_of_seq_uint32 (n: nat) (s: S.seq U32.t) : Lemma
(requires (n == S.length s))
(ensures (seq_uint32_of_be n (be_of_seq_uint32 s) `S.equal` s))
(decreases n)
[SMTPat (seq_uint32_of_be n (be_of_seq_uint32 s))] | let rec seq_uint32_of_be_be_of_seq_uint32 n s =
if n = 0
then ()
else begin
assert (s `S.equal` S.cons (S.head s) (S.tail s));
seq_uint32_of_be_be_of_seq_uint32 (n - 1) (S.tail s);
let s' = be_of_seq_uint32 s in
S.lemma_split s' 4;
S.lemma_append_inj (S.slice s' 0 4) (S.slice s' 4 (S.length s'... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 344,
"start_col": 0,
"start_line": 335
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | n: Prims.nat -> s: FStar.Seq.Base.seq FStar.UInt32.t
-> FStar.Pervasives.Lemma (requires n == FStar.Seq.Base.length s)
(ensures
FStar.Seq.Base.equal (FStar.Endianness.seq_uint32_of_be n
(FStar.Endianness.be_of_seq_uint32 s))
s)
(decreases n)
[SMTPat (FStar.Endianness.... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"Prims.nat",
"FStar.Seq.Base.seq",
"FStar.UInt32.t",
"Prims.op_Equality",
"Prims.int",
"Prims.bool",
"FStar.Seq.Properties.lemma_append_inj",
"FStar.UInt8.t",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.length",
"FStar.Endianness.be_of_uint32",
"FStar.Seq.Properties.head",
"FStar.Endianness.be_o... | [
"recursion"
] | false | false | true | false | false | let rec seq_uint32_of_be_be_of_seq_uint32 n s =
| if n = 0
then ()
else
(assert (s `S.equal` (S.cons (S.head s) (S.tail s)));
seq_uint32_of_be_be_of_seq_uint32 (n - 1) (S.tail s);
let s' = be_of_seq_uint32 s in
S.lemma_split s' 4;
S.lemma_append_inj (S.slice s' 0 4)
(S.slice s' 4 (S.length s'))
(be_of_uint32 (S.head s))
(be_of_seq_u... | false |
FStar.Seq.Equiv.fst | FStar.Seq.Equiv.eq_of_seq_unsnoc | val eq_of_seq_unsnoc (#c:_) (eq:CE.equiv c) (m:pos) (s1 s2: (z:seq c{length z==m}))
: Lemma (requires eq_of_seq eq s1 s2)
(ensures eq.eq (snd (un_snoc s1)) (snd (un_snoc s2)) /\
eq_of_seq eq (fst (un_snoc s1)) (fst (un_snoc s2))) | val eq_of_seq_unsnoc (#c:_) (eq:CE.equiv c) (m:pos) (s1 s2: (z:seq c{length z==m}))
: Lemma (requires eq_of_seq eq s1 s2)
(ensures eq.eq (snd (un_snoc s1)) (snd (un_snoc s2)) /\
eq_of_seq eq (fst (un_snoc s1)) (fst (un_snoc s2))) | let eq_of_seq_unsnoc #c eq m (s1 s2: (z:seq c{length z==m}))
: Lemma (requires eq_of_seq eq s1 s2)
(ensures eq.eq (snd (un_snoc s1)) (snd (un_snoc s2)) /\
eq_of_seq eq (fst (un_snoc s1)) (fst (un_snoc s2))) =
eq_of_seq_element_equality eq s1 s2;
eq_of_seq_from_element_equality eq (fst... | {
"file_name": "ulib/FStar.Seq.Equiv.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 74,
"end_line": 100,
"start_col": 0,
"start_line": 95
} | (*
Copyright 2022 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.Seq.Properties.fsti.checked",
"FStar.Seq.Base.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.IntegerIntervals.fst.checked",
"FStar.Classical.fsti.checked",
"FStar.Algebra.CommMonoid.Equiv.fst.checked"
],
"in... | [
{
"abbrev": false,
"full_module": "FStar.IntegerIntervals",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Properties",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Seq.Base",
"short_module": null
},
{
"abbrev": true,
... | {
"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 |
eq: FStar.Algebra.CommMonoid.Equiv.equiv c ->
m: Prims.pos ->
s1: z: FStar.Seq.Base.seq c {FStar.Seq.Base.length z == m} ->
s2: z: FStar.Seq.Base.seq c {FStar.Seq.Base.length z == m}
-> FStar.Pervasives.Lemma (requires FStar.Seq.Equiv.eq_of_seq eq s1 s2)
(ensures
EQ?.eq eq
(FS... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Algebra.CommMonoid.Equiv.equiv",
"Prims.pos",
"FStar.Seq.Base.seq",
"Prims.eq2",
"Prims.int",
"Prims.l_or",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Seq.Equiv.eq_of_seq_from_element_equality",
"FStar.Pervasives.Native.fst",
"F... | [] | true | false | true | false | false | let eq_of_seq_unsnoc #c eq m (s1: (z: seq c {length z == m})) (s2: (z: seq c {length z == m}))
: Lemma (requires eq_of_seq eq s1 s2)
(ensures
eq.eq (snd (un_snoc s1)) (snd (un_snoc s2)) /\
eq_of_seq eq (fst (un_snoc s1)) (fst (un_snoc s2))) =
| eq_of_seq_element_equality eq s1 s2;
eq_of_seq_from_element_equality eq (fst (un_snoc s1)) (fst (un_snoc s2)) | false |
Steel.ST.GenElim1.fst | Steel.ST.GenElim1.compute_gen_elim_nondep_correct7 | val compute_gen_elim_nondep_correct7 (i0: gen_elim_i) (t1 t2 t3 t4 t5 t6 t7: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7]) | val compute_gen_elim_nondep_correct7 (i0: gen_elim_i) (t1 t2 t3 t4 t5 t6 t7: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7]) | let compute_gen_elim_nondep_correct7
(i0: gen_elim_i)
(t1 t2 t3 t4 t5 t6 t7: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7])
= fun q post intro _ ->
intro _;
rewrite_with_trefl (gen_elim_nondep_p _ _ _) (exists_ (fun x1 -> exists_ (fun x2 -> exists_ (fun x3 -> exists_ (fun x4... | {
"file_name": "lib/steel/Steel.ST.GenElim1.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 7,
"end_line": 596,
"start_col": 0,
"start_line": 579
} | module Steel.ST.GenElim1
let gen_elim_f
(p: vprop)
(a: Type)
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
module U = FStar.Universe
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) (U.raise_t u#_ u#1 unit... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim1.f... | [
{
"abbrev": true,
"full_module": "FStar.Universe",
"short_module": "U"
},
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim1.Base",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"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 |
i0: Steel.ST.GenElim1.Base.gen_elim_i ->
t1: Type ->
t2: Type ->
t3: Type ->
t4: Type ->
t5: Type ->
t6: Type ->
t7: Type
-> Steel.ST.GenElim1.compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7] | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim1.Base.gen_elim_i",
"Steel.ST.GenElim1.Base.curried_function_type",
"Prims.Cons",
"Prims.Nil",
"FStar.Universe.raise_t",
"Prims.unit",
"Steel.Effect.Common.vprop",
"Prims.prop",
"Steel.ST.GenElim1.vprop_rewrite",
"Steel.ST.GenElim1.Base.compute_gen_elim_p",
"Steel.ST.GenElim1.ge... | [] | false | false | false | false | false | let compute_gen_elim_nondep_correct7 (i0: gen_elim_i) (t1 t2 t3 t4 t5 t6 t7: Type)
: Tot (compute_gen_elim_nondep_correct_t i0 [t1; t2; t3; t4; t5; t6; t7]) =
| fun q post intro _ ->
intro _;
rewrite_with_trefl (gen_elim_nondep_p _ _ _)
(exists_ (fun x1 ->
exists_ (fun x2 ->
exists_ (fun x3 ->
exists_ (fun x4 ->
exists_ (fun x5 ->
exists_ (fun x6 ->
... | false |
FStar.Endianness.fst | FStar.Endianness.le_of_seq_uint32_append | val le_of_seq_uint32_append (s1 s2: S.seq U32.t): Lemma
(ensures (
S.equal (le_of_seq_uint32 (S.append s1 s2))
(S.append (le_of_seq_uint32 s1) (le_of_seq_uint32 s2))))
(decreases (
S.length s1))
[ SMTPat (S.append (le_of_seq_uint32 s1) (le_of_seq_uint32 s2)) ] | val le_of_seq_uint32_append (s1 s2: S.seq U32.t): Lemma
(ensures (
S.equal (le_of_seq_uint32 (S.append s1 s2))
(S.append (le_of_seq_uint32 s1) (le_of_seq_uint32 s2))))
(decreases (
S.length s1))
[ SMTPat (S.append (le_of_seq_uint32 s1) (le_of_seq_uint32 s2)) ] | let rec le_of_seq_uint32_append s1 s2 =
Classical.forall_intro_2 (tail_cons #U32.t); // TODO: this is a local pattern, remove once tail_cons lands in FStar.Seq.Properties
if S.length s1 = 0 then begin
assert (S.equal (le_of_seq_uint32 s1) S.empty);
assert (S.equal (S.append s1 s2) s2);
()
end else beg... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 320,
"start_col": 0,
"start_line": 309
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | s1: FStar.Seq.Base.seq FStar.UInt32.t -> s2: FStar.Seq.Base.seq FStar.UInt32.t
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.equal (FStar.Endianness.le_of_seq_uint32 (FStar.Seq.Base.append s1 s2))
(FStar.Seq.Base.append (FStar.Endianness.le_of_seq_uint32 s1)
(FStar.Endianness... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt32.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"FStar.UInt8.t",
"FStar.Endianness.le_of_seq_uint32",
"FStar.Seq.Base.empty",
"Prims.bool",
"FStar.Endianness.l... | [
"recursion"
] | false | false | true | false | false | let rec le_of_seq_uint32_append s1 s2 =
| Classical.forall_intro_2 (tail_cons #U32.t);
if S.length s1 = 0
then
(assert (S.equal (le_of_seq_uint32 s1) S.empty);
assert (S.equal (S.append s1 s2) s2);
())
else
(assert (S.equal (S.append s1 s2) (S.cons (S.head s1) (S.append (S.tail s1) s2)));
assert (S.equal (le_of_seq_uint32 (S.append s1 s2))
... | false |
FStar.Endianness.fst | FStar.Endianness.be_of_seq_uint32_append | val be_of_seq_uint32_append (s1 s2: S.seq U32.t): Lemma
(ensures (
S.equal (be_of_seq_uint32 (S.append s1 s2))
(S.append (be_of_seq_uint32 s1) (be_of_seq_uint32 s2))))
(decreases (
S.length s1))
[ SMTPat (S.append (be_of_seq_uint32 s1) (be_of_seq_uint32 s2)) ] | val be_of_seq_uint32_append (s1 s2: S.seq U32.t): Lemma
(ensures (
S.equal (be_of_seq_uint32 (S.append s1 s2))
(S.append (be_of_seq_uint32 s1) (be_of_seq_uint32 s2))))
(decreases (
S.length s1))
[ SMTPat (S.append (be_of_seq_uint32 s1) (be_of_seq_uint32 s2)) ] | let rec be_of_seq_uint32_append s1 s2 =
if S.length s1 = 0 then begin
assert (S.equal (be_of_seq_uint32 s1) S.empty);
assert (S.equal s1 S.empty);
S.append_empty_l s2;
S.append_empty_l (be_of_seq_uint32 s2);
assert (S.equal (S.append s1 s2) s2);
()
end else begin
calc S.equal {
be_... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 307,
"start_col": 0,
"start_line": 282
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | s1: FStar.Seq.Base.seq FStar.UInt32.t -> s2: FStar.Seq.Base.seq FStar.UInt32.t
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.equal (FStar.Endianness.be_of_seq_uint32 (FStar.Seq.Base.append s1 s2))
(FStar.Seq.Base.append (FStar.Endianness.be_of_seq_uint32 s1)
(FStar.Endianness... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt32.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"FStar.Seq.Base.append_empty_l",
"FStar.UInt8.t",
"FStar.Endianness.be_of_seq_uint32",
"FStar.Seq.Base.empty",
... | [
"recursion"
] | false | false | true | false | false | let rec be_of_seq_uint32_append s1 s2 =
| if S.length s1 = 0
then
(assert (S.equal (be_of_seq_uint32 s1) S.empty);
assert (S.equal s1 S.empty);
S.append_empty_l s2;
S.append_empty_l (be_of_seq_uint32 s2);
assert (S.equal (S.append s1 s2) s2);
())
else
calc S.equal {
be_of_seq_uint32 (S.append s1 s2);
S.equal { () }
be_of_seq... | false |
FStar.Endianness.fst | FStar.Endianness.be_of_seq_uint64_append | val be_of_seq_uint64_append (s1 s2: S.seq U64.t): Lemma
(ensures (
S.equal (be_of_seq_uint64 (S.append s1 s2))
(S.append (be_of_seq_uint64 s1) (be_of_seq_uint64 s2))))
(decreases (
S.length s1))
[ SMTPat (S.append (be_of_seq_uint64 s1) (be_of_seq_uint64 s2)) ] | val be_of_seq_uint64_append (s1 s2: S.seq U64.t): Lemma
(ensures (
S.equal (be_of_seq_uint64 (S.append s1 s2))
(S.append (be_of_seq_uint64 s1) (be_of_seq_uint64 s2))))
(decreases (
S.length s1))
[ SMTPat (S.append (be_of_seq_uint64 s1) (be_of_seq_uint64 s2)) ] | let rec be_of_seq_uint64_append s1 s2 =
Classical.forall_intro_2 (tail_cons #U64.t); // TODO: this is a local pattern, remove once tail_cons lands in FStar.Seq.Properties
if S.length s1 = 0 then begin
assert (S.equal (be_of_seq_uint64 s1) S.empty);
assert (S.equal (S.append s1 s2) s2);
()
end else beg... | {
"file_name": "ulib/FStar.Endianness.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 333,
"start_col": 0,
"start_line": 322
} | module FStar.Endianness
/// A library of lemmas for reasoning about sequences of machine integers and
/// their (little|big)-endian representation as a sequence of bytes.
///
/// The functions in this module aim to be as generic as possible, in order to
/// facilitate compatibility with:
/// - Vale's model of machine ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Mul.fst.checked",
"FStar.Math.Lemmas.fst.checked",
"FStar.Classical... | [
{
"abbrev": false,
"full_module": "FStar.Mul",
"short_module": null
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Math.Lemmas",
"short_module": "Math"
},
{
"abbrev": true,
"full_module": "FStar.... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"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 | s1: FStar.Seq.Base.seq FStar.UInt64.t -> s2: FStar.Seq.Base.seq FStar.UInt64.t
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.equal (FStar.Endianness.be_of_seq_uint64 (FStar.Seq.Base.append s1 s2))
(FStar.Seq.Base.append (FStar.Endianness.be_of_seq_uint64 s1)
(FStar.Endianness... | FStar.Pervasives.Lemma | [
"lemma",
""
] | [] | [
"FStar.Seq.Base.seq",
"FStar.UInt64.t",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"FStar.UInt8.t",
"FStar.Endianness.be_of_seq_uint64",
"FStar.Seq.Base.empty",
"Prims.bool",
"FStar.Endianness.b... | [
"recursion"
] | false | false | true | false | false | let rec be_of_seq_uint64_append s1 s2 =
| Classical.forall_intro_2 (tail_cons #U64.t);
if S.length s1 = 0
then
(assert (S.equal (be_of_seq_uint64 s1) S.empty);
assert (S.equal (S.append s1 s2) s2);
())
else
(assert (S.equal (S.append s1 s2) (S.cons (S.head s1) (S.append (S.tail s1) s2)));
assert (S.equal (be_of_seq_uint64 (S.append s1 s2))
... | false |
Vale.SHA.X64.fst | Vale.SHA.X64.va_lemma_Sha_update_bytes_stdcall | val va_lemma_Sha_update_bytes_stdcall : va_b0:va_code -> va_s0:va_state -> win:bool ->
ctx_b:buffer128 -> in_b:buffer128 -> num_val:nat64 -> k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Sha_update_bytes_stdcall win) va_s0 /\ va_get_ok va_s0
/\ (let (ctx_ptr:(va_int_ra... | val va_lemma_Sha_update_bytes_stdcall : va_b0:va_code -> va_s0:va_state -> win:bool ->
ctx_b:buffer128 -> in_b:buffer128 -> num_val:nat64 -> k_b:buffer128
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Sha_update_bytes_stdcall win) va_s0 /\ va_get_ok va_s0
/\ (let (ctx_ptr:(va_int_ra... | let va_lemma_Sha_update_bytes_stdcall va_b0 va_s0 win ctx_b in_b num_val k_b =
let (va_mods:va_mods_t) = [va_Mod_stackTaint; va_Mod_stack; va_Mod_mem_layout; va_Mod_mem_heaplet
0; va_Mod_flags; va_Mod_xmm 15; va_Mod_xmm 14; va_Mod_xmm 13; va_Mod_xmm 12; va_Mod_xmm 11;
va_Mod_xmm 10; va_Mod_xmm 9; va_Mod_xmm 8... | {
"file_name": "obj/Vale.SHA.X64.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 2901,
"start_col": 0,
"start_line": 2808
} | module Vale.SHA.X64
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open FStar.Seq
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.Ins... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.Stack.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.In... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.Stack",
"short_module": null
},
{
"abbrev": false,
"full_module": "Spec.Loops",
"short_module": null
},
{
"abbrev": false,
"full_mo... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"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 |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
win: Prims.bool ->
ctx_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
num_val: Vale.X64.Memory.nat64 ->
k_b: Vale.X64.Memory.buffer128
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Prims.bool",
"Vale.X64.Memory.buffer128",
"Vale.X64.Memory.nat64",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.Quic... | [] | false | false | false | false | false | let va_lemma_Sha_update_bytes_stdcall va_b0 va_s0 win ctx_b in_b num_val k_b =
| let va_mods:va_mods_t =
[
va_Mod_stackTaint; va_Mod_stack; va_Mod_mem_layout; va_Mod_mem_heaplet 0; va_Mod_flags;
va_Mod_xmm 15; va_Mod_xmm 14; va_Mod_xmm 13; va_Mod_xmm 12; va_Mod_xmm 11; va_Mod_xmm 10;
va_Mod_xmm 9; va_Mod_xmm 8; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3;
... | false |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.grows | val grows : FStar.Preorder.preorder (FStar.Seq.Base.seq a) | let grows #a = grows_aux #a | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 47,
"start_col": 0,
"start_line": 47
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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.Preorder.preorder (FStar.Seq.Base.seq a) | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Seq.grows_aux",
"FStar.Preorder.preorder",
"FStar.Seq.Base.seq"
] | [] | false | false | false | true | false | let grows #a =
| grows_aux #a | false | |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.snoc | val snoc (s: seq 'a) (x: 'a) : Tot (seq 'a) | val snoc (s: seq 'a) (x: 'a) : Tot (seq 'a) | let snoc (s:seq 'a) (x:'a)
: Tot (seq 'a)
= Seq.append s (Seq.create 1 x) | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 53,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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 | s: FStar.Seq.Base.seq 'a -> x: 'a -> FStar.Seq.Base.seq 'a | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"FStar.Seq.Base.append",
"FStar.Seq.Base.create"
] | [] | false | false | false | true | false | let snoc (s: seq 'a) (x: 'a) : Tot (seq 'a) =
| Seq.append s (Seq.create 1 x) | false |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.i_seq | val i_seq : r: FStar.Monotonic.Seq.rid -> a: Type0 -> p: (_: FStar.Seq.Base.seq a -> Type) -> Type0 | let i_seq (r:rid) (a:Type) (p:seq a -> Type) = m_rref r (s:seq a{p s}) (grows_p p) | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 82,
"end_line": 107,
"start_col": 0,
"start_line": 107
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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: FStar.Monotonic.Seq.rid -> a: Type0 -> p: (_: FStar.Seq.Base.seq a -> Type) -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.HyperStack.ST.m_rref",
"FStar.Monotonic.Seq.grows_p"
] | [] | false | false | false | true | true | let i_seq (r: rid) (a: Type) (p: (seq a -> Type)) =
| m_rref r (s: seq a {p s}) (grows_p p) | false | |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.int_at_most | val int_at_most (#r #a #p: _) (x: int) (is: i_seq r a p) (h: mem) : Type0 | val int_at_most (#r #a #p: _) (x: int) (is: i_seq r a p) (h: mem) : Type0 | let int_at_most #r #a #p (x:int) (is:i_seq r a p) (h:mem) : Type0 =
x < Seq.length (HS.sel h is) | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 124,
"start_col": 0,
"start_line": 123
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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: Prims.int -> is: FStar.Monotonic.Seq.i_seq r a p -> h: FStar.Monotonic.HyperStack.mem -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"Prims.int",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.mem",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Seq.grows_p"
] | [] | false | false | false | false | true | let int_at_most #r #a #p (x: int) (is: i_seq r a p) (h: mem) : Type0 =
| x < Seq.length (HS.sel h is) | false |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.i_sel | val i_sel (#r: rid) (#a: Type) (#p: (seq a -> Type)) (h: mem) (m: i_seq r a p)
: GTot (s: seq a {p s}) | val i_sel (#r: rid) (#a: Type) (#p: (seq a -> Type)) (h: mem) (m: i_seq r a p)
: GTot (s: seq a {p s}) | let i_sel (#r:rid) (#a:Type) (#p:seq a -> Type) (h:mem) (m:i_seq r a p)
: GTot (s:seq a{p s})
= HS.sel h m | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 14,
"end_line": 132,
"start_col": 0,
"start_line": 130
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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 | h: FStar.Monotonic.HyperStack.mem -> m: FStar.Monotonic.Seq.i_seq r a p
-> Prims.GTot (s: FStar.Seq.Base.seq a {p s}) | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.Monotonic.HyperStack.mem",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.sel",
"FStar.Monotonic.Seq.grows_p"
] | [] | false | false | false | false | false | let i_sel (#r: rid) (#a: Type) (#p: (seq a -> Type)) (h: mem) (m: i_seq r a p)
: GTot (s: seq a {p s}) =
| HS.sel h m | false |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.i_contains | val i_contains (#r: rid) (#a: Type) (#p: (seq a -> Type)) (m: i_seq r a p) (h: mem) : GTot Type0 | val i_contains (#r: rid) (#a: Type) (#p: (seq a -> Type)) (m: i_seq r a p) (h: mem) : GTot Type0 | let i_contains (#r:rid) (#a:Type) (#p:seq a -> Type) (m:i_seq r a p) (h:mem)
: GTot Type0
= HS.contains h m | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 19,
"end_line": 142,
"start_col": 0,
"start_line": 140
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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 | m: FStar.Monotonic.Seq.i_seq r a p -> h: FStar.Monotonic.HyperStack.mem -> Prims.GTot Type0 | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Monotonic.Seq.rid",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.mem",
"FStar.Monotonic.HyperStack.contains",
"FStar.Monotonic.Seq.grows_p"
] | [] | false | false | false | false | true | let i_contains (#r: rid) (#a: Type) (#p: (seq a -> Type)) (m: i_seq r a p) (h: mem) : GTot Type0 =
| HS.contains h m | false |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.grows_aux | val grows_aux (#a: Type) : Preorder.preorder (seq a) | val grows_aux (#a: Type) : Preorder.preorder (seq a) | let grows_aux (#a:Type) :Preorder.preorder (seq a)
= fun (s1:seq a) (s2:seq a) ->
length s1 <= length s2 /\
(forall (i:nat).{:pattern (Seq.index s1 i) \/ (Seq.index s2 i)} i < length s1 ==> index s1 i == index s2 i) | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 111,
"end_line": 44,
"start_col": 0,
"start_line": 41
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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.Preorder.preorder (FStar.Seq.Base.seq a) | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.length",
"Prims.l_Forall",
"Prims.nat",
"Prims.l_imp",
"Prims.op_LessThan",
"Prims.eq2",
"FStar.Seq.Base.index",
"Prims.logical",
"FStar.Preorder.preorder"
] | [] | false | false | false | true | false | let grows_aux (#a: Type) : Preorder.preorder (seq a) =
| fun (s1: seq a) (s2: seq a) ->
length s1 <= length s2 /\
(forall (i: nat). {:pattern (Seq.index s1 i)\/(Seq.index s2 i)}
i < length s1 ==> index s1 i == index s2 i) | false |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.lemma_snoc_extends | val lemma_snoc_extends (#a: Type) (s: seq a) (x: a)
: Lemma (requires True) (ensures (grows s (Seq.snoc s x))) [SMTPat (grows s (Seq.snoc s x))] | val lemma_snoc_extends (#a: Type) (s: seq a) (x: a)
: Lemma (requires True) (ensures (grows s (Seq.snoc s x))) [SMTPat (grows s (Seq.snoc s x))] | let lemma_snoc_extends (#a:Type) (s:seq a) (x:a)
: Lemma (requires True)
(ensures (grows s (Seq.snoc s x)))
[SMTPat (grows s (Seq.snoc s x))]
= reveal_opaque (`%grows) (grows #a) | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 59,
"start_col": 0,
"start_line": 55
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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 | s: FStar.Seq.Base.seq a -> x: a
-> FStar.Pervasives.Lemma (ensures FStar.Monotonic.Seq.grows s (FStar.Seq.Properties.snoc s x))
[SMTPat (FStar.Monotonic.Seq.grows s (FStar.Seq.Properties.snoc s x))] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"FStar.Pervasives.reveal_opaque",
"FStar.Preorder.preorder",
"FStar.Monotonic.Seq.grows",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.Seq.Properties.snoc",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat",
"Prims.Nil"
] | [] | true | false | true | false | false | let lemma_snoc_extends (#a: Type) (s: seq a) (x: a)
: Lemma (requires True) (ensures (grows s (Seq.snoc s x))) [SMTPat (grows s (Seq.snoc s x))] =
| reveal_opaque (`%grows) (grows #a) | false |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.at_least | val at_least : n: Prims.nat ->
x: a ->
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.logical | let at_least (#a:Type) (#i:rid) (n:nat) (x:a) (r:m_rref i (seq a) grows) (h:mem) =
Seq.length (HS.sel h r) > n
/\ Seq.index (HS.sel h r) n == x | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 34,
"end_line": 75,
"start_col": 0,
"start_line": 73
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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 |
n: Prims.nat ->
x: a ->
r: FStar.HyperStack.ST.m_rref i (FStar.Seq.Base.seq a) FStar.Monotonic.Seq.grows ->
h: FStar.Monotonic.HyperStack.mem
-> Prims.logical | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.Seq.rid",
"Prims.nat",
"FStar.HyperStack.ST.m_rref",
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.grows",
"FStar.Monotonic.HyperStack.mem",
"Prims.l_and",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Monotonic.HyperStack.sel",
"Prims.eq2",
"FStar.Seq.Ba... | [] | false | false | false | false | true | let at_least (#a: Type) (#i: rid) (n: nat) (x: a) (r: m_rref i (seq a) grows) (h: mem) =
| Seq.length (HS.sel h r) > n /\ Seq.index (HS.sel h r) n == x | false | |
FStar.Monotonic.Seq.fst | FStar.Monotonic.Seq.alloc_mref_iseq | val alloc_mref_iseq (#a: Type) (p: (seq a -> Type)) (r: rid) (init: seq a {p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1)) | val alloc_mref_iseq (#a: Type) (p: (seq a -> Type)) (r: rid) (init: seq a {p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1)) | let alloc_mref_iseq (#a:Type) (p:seq a -> Type) (r:rid) (init:seq a{p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1))
= ralloc r init | {
"file_name": "ulib/FStar.Monotonic.Seq.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 113,
"start_col": 0,
"start_line": 109
} | (*
Copyright 2008-2018 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 agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Set.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Preorder.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Monotonic.Heap.fsti.checked",
"FStar.Map.fsti.checked",
"F... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "FStar.HyperStack.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.HyperStack",
"short_module": null
},
{
"abbrev": true,
"full_module... | {
"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 |
p: (_: FStar.Seq.Base.seq a -> Type) ->
r: FStar.Monotonic.Seq.rid ->
init: FStar.Seq.Base.seq a {p init}
-> FStar.HyperStack.ST.ST (FStar.Monotonic.Seq.i_seq r a p) | FStar.HyperStack.ST.ST | [] | [] | [
"FStar.Seq.Base.seq",
"FStar.Monotonic.Seq.rid",
"FStar.HyperStack.ST.ralloc",
"FStar.Monotonic.Seq.grows_p",
"FStar.HyperStack.ST.mref",
"FStar.Monotonic.Seq.i_seq",
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.ST.witnessed",
"FStar.HyperStack.ST.region_contains_pred",
"FStar.HyperStack.ST... | [] | false | true | false | false | false | let alloc_mref_iseq (#a: Type) (p: (seq a -> Type)) (r: rid) (init: seq a {p init})
: ST (i_seq r a p)
(requires (fun _ -> HST.witnessed (region_contains_pred r)))
(ensures (fun h0 m h1 -> HST.ralloc_post r init h0 m h1)) =
| ralloc r init | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.