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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Pulse.Steel.Wrapper.Typing.fsti | Pulse.Steel.Wrapper.Typing.with_localarray_body_post | val with_localarray_body_post (post a ret_t arr: term) : term | val with_localarray_body_post (post a ret_t arr: term) : term | let with_localarray_body_post (post:term) (a:term) (ret_t:term) (arr:term) : term =
mk_abs ret_t Q_Explicit (with_localarray_body_post_body post a arr) | {
"file_name": "lib/steel/pulse/Pulse.Steel.Wrapper.Typing.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 69,
"end_line": 409,
"start_col": 0,
"start_line": 408
} | (*
Copyright 2023 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": [
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"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 |
post: FStar.Stubs.Reflection.Types.term ->
a: FStar.Stubs.Reflection.Types.term ->
ret_t: FStar.Stubs.Reflection.Types.term ->
arr: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Pulse.Reflection.Util.mk_abs",
"FStar.Stubs.Reflection.V2.Data.Q_Explicit",
"Pulse.Steel.Wrapper.Typing.with_localarray_body_post_body"
] | [] | false | false | false | true | false | let with_localarray_body_post (post a ret_t arr: term) : term =
| mk_abs ret_t Q_Explicit (with_localarray_body_post_body post a arr) | false |
Vale.SHA.PPC64LE.SHA_helpers.fsti | Vale.SHA.PPC64LE.SHA_helpers.k_reqs | val k_reqs (k_seq: seq quad32) : prop0 | val k_reqs (k_seq: seq quad32) : prop0 | let k_reqs (k_seq:seq quad32) : prop0 =
length k_seq == size_k_w_256 / 4 /\
(forall i . {:pattern (index k_seq i)} 0 <= i /\ i < (size_k_w_256/4) ==>
(k_seq.[i]).lo0 == word_to_nat32 (k.[4 * i]) /\
(k_seq.[i]).lo1 == word_to_nat32 (k.[4 * i + 1]) /\
(k_seq.[i]).hi2 == word_to_nat32 (k.[4 * i + 2]) /\
... | {
"file_name": "vale/code/crypto/sha/Vale.SHA.PPC64LE.SHA_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 53,
"end_line": 189,
"start_col": 0,
"start_line": 183
} | module Vale.SHA.PPC64LE.SHA_helpers
open FStar.Mul
open Vale.Def.Prop_s
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.Def.Sel
open Vale.SHA2.Wrapper
open Vale.Def.Words.Four_s
unfold let (.[]) = FStar.Seq.index
#reset-option... | {
"checked_file": "/",
"dependencies": [
"Vale.SHA2.Wrapper.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Sel.fst.checked",
"Vale.Def.... | [
{
"abbrev": false,
"full_module": "Vale.SHA2.Wrapper",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Sel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | k_seq: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> Vale.Def.Prop_s.prop0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Prims.l_and",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.op_Division",
"Vale.SHA.PPC64LE.SHA_helpers.size_k_w_256",
"Prims.l_Forall",
"Prims.b2t",
"Prims.op_GreaterThanOrEqual",
"Prims.op_LessThan",
"Prims.l_imp",
"Prims.op_L... | [] | false | false | false | true | false | let k_reqs (k_seq: seq quad32) : prop0 =
| length k_seq == size_k_w_256 / 4 /\
(forall i. {:pattern (index k_seq i)}
0 <= i /\ i < (size_k_w_256 / 4) ==>
(k_seq.[ i ]).lo0 == word_to_nat32 (k.[ 4 * i ]) /\
(k_seq.[ i ]).lo1 == word_to_nat32 (k.[ 4 * i + 1 ]) /\
(k_seq.[ i ]).hi2 == word_to_nat32 (k.[ 4 * i + 2 ]) /\
(k_seq.[ i ]).hi3 == word... | false |
Pulse.Steel.Wrapper.Typing.fsti | Pulse.Steel.Wrapper.Typing.with_localarray_body_pre | val with_localarray_body_pre (pre a arr init len: term) : term | val with_localarray_body_pre (pre a arr init len: term) : term | let with_localarray_body_pre (pre:term) (a:term) (arr:term) (init:term) (len:term) : term =
let pts_to : term =
mk_array_pts_to a arr full_perm_tm (mk_seq_create uzero a (mk_szv len) init) in
let len_vp : term =
mk_pure (mk_eq2 uzero nat_tm (mk_array_length a arr) (mk_szv len)) in
mk_star pre (mk_star pts... | {
"file_name": "lib/steel/pulse/Pulse.Steel.Wrapper.Typing.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 37,
"end_line": 395,
"start_col": 0,
"start_line": 390
} | (*
Copyright 2023 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": [
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"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 |
pre: FStar.Stubs.Reflection.Types.term ->
a: FStar.Stubs.Reflection.Types.term ->
arr: FStar.Stubs.Reflection.Types.term ->
init: FStar.Stubs.Reflection.Types.term ->
len: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Pulse.Reflection.Util.mk_star",
"Pulse.Reflection.Util.mk_pure",
"Pulse.Reflection.Util.mk_eq2",
"Pulse.Reflection.Util.uzero",
"Pulse.Reflection.Util.nat_tm",
"Pulse.Reflection.Util.mk_array_length",
"Pulse.Reflection.Util.mk_szv",
"Pulse.Reflection.Util.mk_arr... | [] | false | false | false | true | false | let with_localarray_body_pre (pre a arr init len: term) : term =
| let pts_to:term = mk_array_pts_to a arr full_perm_tm (mk_seq_create uzero a (mk_szv len) init) in
let len_vp:term = mk_pure (mk_eq2 uzero nat_tm (mk_array_length a arr) (mk_szv len)) in
mk_star pre (mk_star pts_to len_vp) | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.cswap_regs_modified | val cswap_regs_modified: MS.reg_64 -> bool | val cswap_regs_modified: MS.reg_64 -> bool | let cswap_regs_modified: MS.reg_64 -> bool = fun (r:MS.reg_64) ->
let open MS in
if r = rRdi || r = rR8 || r = rR9 || r = rR10 then true
else false | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 12,
"end_line": 73,
"start_col": 0,
"start_line": 70
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 | r: Vale.X64.Machine_s.reg_64 -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Machine_s.reg_64",
"Prims.op_BarBar",
"Prims.op_Equality",
"Vale.X64.Machine_s.rRdi",
"Vale.X64.Machine_s.rR8",
"Vale.X64.Machine_s.rR9",
"Vale.X64.Machine_s.rR10",
"Prims.bool"
] | [] | false | false | false | true | false | let cswap_regs_modified: MS.reg_64 -> bool =
| fun (r: MS.reg_64) ->
let open MS in if r = rRdi || r = rR8 || r = rR9 || r = rR10 then true else false | false |
Vale.SHA.PPC64LE.SHA_helpers.fsti | Vale.SHA.PPC64LE.SHA_helpers.quads_to_block_be | val quads_to_block_be (qs: seq quad32) : block_w | val quads_to_block_be (qs: seq quad32) : block_w | let quads_to_block_be (qs:seq quad32) : block_w
=
let nat32_seq = Vale.Def.Words.Seq_s.seq_four_to_seq_BE qs in
let f (n:nat{n < 16}) : word = nat32_to_word (if n < length nat32_seq then nat32_seq.[n] else 0) in
init 16 f | {
"file_name": "vale/code/crypto/sha/Vale.SHA.PPC64LE.SHA_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 195,
"start_col": 0,
"start_line": 191
} | module Vale.SHA.PPC64LE.SHA_helpers
open FStar.Mul
open Vale.Def.Prop_s
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.Def.Sel
open Vale.SHA2.Wrapper
open Vale.Def.Words.Four_s
unfold let (.[]) = FStar.Seq.index
#reset-option... | {
"checked_file": "/",
"dependencies": [
"Vale.SHA2.Wrapper.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Sel.fst.checked",
"Vale.Def.... | [
{
"abbrev": false,
"full_module": "Vale.SHA2.Wrapper",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Sel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | qs: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> Vale.SHA.PPC64LE.SHA_helpers.block_w | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.init",
"Vale.SHA.PPC64LE.SHA_helpers.word",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Vale.SHA.PPC64LE.SHA_helpers.nat32_to_word",
"FStar.Seq.Base.length",
"Vale.Def.Types_s.nat32",
"Vale.SHA.PPC64LE.SHA_helpers.op_String_Acc... | [] | false | false | false | true | false | let quads_to_block_be (qs: seq quad32) : block_w =
| let nat32_seq = Vale.Def.Words.Seq_s.seq_four_to_seq_BE qs in
let f (n: nat{n < 16}) : word =
nat32_to_word (if n < length nat32_seq then nat32_seq.[ n ] else 0)
in
init 16 f | false |
Vale.SHA.PPC64LE.SHA_helpers.fsti | Vale.SHA.PPC64LE.SHA_helpers.le_bytes_to_hash | val le_bytes_to_hash (b: seq nat8) : hash256 | val le_bytes_to_hash (b: seq nat8) : hash256 | let le_bytes_to_hash (b:seq nat8) : hash256 =
if length b <> 32 then
(let f (n:nat{n < 8}) : word = nat32_to_word 0 in
init 8 f)
else (
let open Vale.Def.Words.Seq_s in
Vale.Lib.Seqs_s.seq_map nat32_to_word (seq_nat8_to_seq_nat32_LE b)
) | {
"file_name": "vale/code/crypto/sha/Vale.SHA.PPC64LE.SHA_helpers.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 288,
"start_col": 0,
"start_line": 281
} | module Vale.SHA.PPC64LE.SHA_helpers
open FStar.Mul
open Vale.Def.Prop_s
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.Def.Sel
open Vale.SHA2.Wrapper
open Vale.Def.Words.Four_s
unfold let (.[]) = FStar.Seq.index
#reset-option... | {
"checked_file": "/",
"dependencies": [
"Vale.SHA2.Wrapper.fsti.checked",
"Vale.Lib.Seqs_s.fst.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Words.Four_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Sel.fst.checked",
"Vale.Def.... | [
{
"abbrev": false,
"full_module": "Vale.SHA2.Wrapper",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Sel",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Arch.TypesNative",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 -> Vale.SHA.PPC64LE.SHA_helpers.hash256 | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Prims.op_disEquality",
"Prims.int",
"FStar.Seq.Base.length",
"FStar.Seq.Base.init",
"Vale.SHA.PPC64LE.SHA_helpers.word",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"Vale.SHA.PPC64LE.SHA_helpers.nat32_to_word",
"Prims.bool",
"Vale.Lib.Seqs_s... | [] | false | false | false | true | false | let le_bytes_to_hash (b: seq nat8) : hash256 =
| if length b <> 32
then
(let f (n: nat{n < 8}) : word = nat32_to_word 0 in
init 8 f)
else
(let open Vale.Def.Words.Seq_s in
Vale.Lib.Seqs_s.seq_map nat32_to_word (seq_nat8_to_seq_nat32_LE b)) | false |
Pulse.Steel.Wrapper.Typing.fsti | Pulse.Steel.Wrapper.Typing.elim_exists_post_body | val elim_exists_post_body : u166: FStar.Stubs.Reflection.Types.universe ->
a: FStar.Stubs.Reflection.Types.term ->
p: FStar.Stubs.Reflection.Types.term ->
x: FStar.Stubs.Reflection.V2.Data.var
-> FStar.Stubs.Reflection.Types.term | let elim_exists_post_body (u:universe) (a:term) (p:term) (x:var) =
let x_tm = RT.var_as_term x in
let reveal_x = mk_reveal u a x_tm in
let post = pack_ln (Tv_App p (reveal_x, Q_Explicit)) in
RT.subst_term post [ RT.ND x 0 ] | {
"file_name": "lib/steel/pulse/Pulse.Steel.Wrapper.Typing.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 34,
"end_line": 230,
"start_col": 0,
"start_line": 226
} | (*
Copyright 2023 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": [
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"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 |
u166: FStar.Stubs.Reflection.Types.universe ->
a: FStar.Stubs.Reflection.Types.term ->
p: FStar.Stubs.Reflection.Types.term ->
x: FStar.Stubs.Reflection.V2.Data.var
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.universe",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Data.var",
"FStar.Reflection.Typing.subst_term",
"Prims.Cons",
"FStar.Reflection.Typing.subst_elt",
"FStar.Reflection.Typing.ND",
"Prims.Nil",
"FStar.Stubs.Reflection.V2.Builtins.pack_ln",
"FSt... | [] | false | false | false | true | false | let elim_exists_post_body (u: universe) (a p: term) (x: var) =
| let x_tm = RT.var_as_term x in
let reveal_x = mk_reveal u a x_tm in
let post = pack_ln (Tv_App p (reveal_x, Q_Explicit)) in
RT.subst_term post [RT.ND x 0] | false | |
Pulse.Steel.Wrapper.Typing.fsti | Pulse.Steel.Wrapper.Typing.return_stt_ghost_comp | val return_stt_ghost_comp (u: universe) (a e p: term) (x: var) : term | val return_stt_ghost_comp (u: universe) (a e p: term) (x: var) : term | let return_stt_ghost_comp (u:universe) (a:term) (e:term) (p:term) (x:var) : term =
mk_stt_ghost_comp u a
(pack_ln (Tv_App p (e, Q_Explicit)))
(return_post_with_eq u a e p x) | {
"file_name": "lib/steel/pulse/Pulse.Steel.Wrapper.Typing.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 35,
"end_line": 109,
"start_col": 0,
"start_line": 106
} | (*
Copyright 2023 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": [
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"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 |
u90: FStar.Stubs.Reflection.Types.universe ->
a: FStar.Stubs.Reflection.Types.term ->
e: FStar.Stubs.Reflection.Types.term ->
p: FStar.Stubs.Reflection.Types.term ->
x: FStar.Stubs.Reflection.V2.Data.var
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.universe",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Data.var",
"Pulse.Reflection.Util.mk_stt_ghost_comp",
"FStar.Stubs.Reflection.V2.Builtins.pack_ln",
"FStar.Stubs.Reflection.V2.Data.Tv_App",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Stubs.Reflect... | [] | false | false | false | true | false | let return_stt_ghost_comp (u: universe) (a e p: term) (x: var) : term =
| mk_stt_ghost_comp u a (pack_ln (Tv_App p (e, Q_Explicit))) (return_post_with_eq u a e p x) | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.cswap_post | val cswap_post:VSig.vale_post cswap_dom | val cswap_post:VSig.vale_post cswap_dom | let cswap_post : VSig.vale_post cswap_dom =
fun (c:V.va_code)
(bit:uint64)
(p0:b64)
(p1:b64)
(va_s0:V.va_state)
(va_s1:V.va_state)
(f:V.va_fuel) ->
FU.va_ens_Cswap2 c va_s0 (UInt64.v bit) (as_vale_buffer p0) (as_vale_buffer p1) va_s1 f | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 93,
"end_line": 66,
"start_col": 0,
"start_line": 58
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 | Vale.AsLowStar.ValeSig.vale_post Vale.Inline.X64.Fswap_inline.cswap_dom | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.Inline.X64.Fswap_inline.uint64",
"Vale.Inline.X64.Fswap_inline.b64",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"Vale.Curve25519.X64.FastUtil.va_ens_Cswap2",
"FStar.UInt64.v",
"Vale.X64.MemoryAdapters.as_vale_buffer",
"Vale.Arch.HeapTypes_s.TUInt64",
"Prim... | [] | false | false | false | true | false | let cswap_post:VSig.vale_post cswap_dom =
| fun
(c: V.va_code)
(bit: uint64)
(p0: b64)
(p1: b64)
(va_s0: V.va_state)
(va_s1: V.va_state)
(f: V.va_fuel)
->
FU.va_ens_Cswap2 c va_s0 (UInt64.v bit) (as_vale_buffer p0) (as_vale_buffer p1) va_s1 f | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.cswap_dom | val cswap_dom:IX64.arity_ok 3 td | val cswap_dom:IX64.arity_ok 3 td | let cswap_dom: IX64.arity_ok 3 td =
let y = [tuint64; t64_mod; t64_mod] in
assert_norm (List.length y = 3);
y | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 44,
"start_col": 0,
"start_line": 41
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 | Vale.Interop.X64.arity_ok 3 Vale.Interop.Base.td | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Prims.op_Equality",
"Prims.int",
"FStar.List.Tot.Base.length",
"Vale.Interop.Base.td",
"Prims.list",
"Prims.Cons",
"Vale.Inline.X64.Fswap_inline.tuint64",
"Vale.Inline.X64.Fswap_inline.t64_mod",
"Prims.Nil"
] | [] | false | false | false | false | false | let cswap_dom:IX64.arity_ok 3 td =
| let y = [tuint64; t64_mod; t64_mod] in
assert_norm (List.length y = 3);
y | false |
Pulse.Steel.Wrapper.Typing.fsti | Pulse.Steel.Wrapper.Typing.with_local_body_pre | val with_local_body_pre (pre a x init: term) : term | val with_local_body_pre (pre a x init: term) : term | let with_local_body_pre (pre:term) (a:term) (x:term) (init:term) : term =
let pts_to : term =
mk_pts_to a x full_perm_tm init in
mk_star pre pts_to | {
"file_name": "lib/steel/pulse/Pulse.Steel.Wrapper.Typing.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 20,
"end_line": 348,
"start_col": 0,
"start_line": 345
} | (*
Copyright 2023 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": [
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"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 |
pre: FStar.Stubs.Reflection.Types.term ->
a: FStar.Stubs.Reflection.Types.term ->
x: FStar.Stubs.Reflection.Types.term ->
init: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Pulse.Reflection.Util.mk_star",
"Pulse.Reflection.Util.mk_pts_to",
"Pulse.Reflection.Util.full_perm_tm"
] | [] | false | false | false | true | false | let with_local_body_pre (pre a x init: term) : term =
| let pts_to:term = mk_pts_to a x full_perm_tm init in
mk_star pre pts_to | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.cswap2_code_inline | val cswap2_code_inline: Prims.unit -> FStar.All.ML int | val cswap2_code_inline: Prims.unit -> FStar.All.ML int | let cswap2_code_inline () : FStar.All.ML int =
PR.print_inline "cswap2" 0 None (List.length cswap_dom) cswap_dom cswap_names code_cswap of_arg cswap_regs_modified cswap_comments | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 132,
"end_line": 174,
"start_col": 0,
"start_line": 173
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": false,
"full_module": "Vale.AsLowStar.MemoryHelpers",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
... | {
"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.All.ML Prims.int | FStar.All.ML | [
"ml"
] | [] | [
"Prims.unit",
"Vale.X64.Print_Inline_s.print_inline",
"FStar.Pervasives.Native.None",
"Prims.string",
"FStar.List.Tot.Base.length",
"Vale.Interop.Base.td",
"Vale.Inline.X64.Fswap_inline.cswap_dom",
"Vale.Inline.X64.Fswap_inline.cswap_names",
"Vale.Inline.X64.Fswap_inline.code_cswap",
"Vale.Inline.... | [] | false | true | false | false | false | let cswap2_code_inline () : FStar.All.ML int =
| PR.print_inline "cswap2" 0 None (List.length cswap_dom) cswap_dom cswap_names code_cswap of_arg
cswap_regs_modified cswap_comments | false |
Pulse.Steel.Wrapper.Typing.fsti | Pulse.Steel.Wrapper.Typing.with_localarray_body_post_body | val with_localarray_body_post_body (post a arr: term) : term | val with_localarray_body_post_body (post a arr: term) : term | let with_localarray_body_post_body (post:term) (a:term) (arr:term) : term =
// exists_ (A.pts_to arr full_perm)
let exists_tm =
mk_exists uzero (mk_seq uzero a)
(mk_abs (mk_seq uzero a) Q_Explicit
(mk_array_pts_to a arr full_perm_tm (RT.bound_var 0))) in
mk_star post exists_tm | {
"file_name": "lib/steel/pulse/Pulse.Steel.Wrapper.Typing.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 24,
"end_line": 406,
"start_col": 0,
"start_line": 400
} | (*
Copyright 2023 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": [
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"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 |
post: FStar.Stubs.Reflection.Types.term ->
a: FStar.Stubs.Reflection.Types.term ->
arr: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Pulse.Reflection.Util.mk_star",
"Pulse.Reflection.Util.mk_exists",
"Pulse.Reflection.Util.uzero",
"Pulse.Reflection.Util.mk_seq",
"Pulse.Reflection.Util.mk_abs",
"FStar.Stubs.Reflection.V2.Data.Q_Explicit",
"Pulse.Reflection.Util.mk_array_pts_to",
"Pulse.Reflect... | [] | false | false | false | true | false | let with_localarray_body_post_body (post a arr: term) : term =
| let exists_tm =
mk_exists uzero
(mk_seq uzero a)
(mk_abs (mk_seq uzero a) Q_Explicit (mk_array_pts_to a arr full_perm_tm (RT.bound_var 0)))
in
mk_star post exists_tm | false |
Pulse.Steel.Wrapper.Typing.fsti | Pulse.Steel.Wrapper.Typing.with_local_body_post_body | val with_local_body_post_body (post a x: term) : term | val with_local_body_post_body (post a x: term) : term | let with_local_body_post_body (post:term) (a:term) (x:term) : term =
// exists_ (R.pts_to r full_perm)
let exists_tm =
mk_exists (pack_universe Uv_Zero) a
(mk_abs a Q_Explicit
(mk_pts_to a x full_perm_tm (RT.bound_var 0))) in
mk_star post exists_tm | {
"file_name": "lib/steel/pulse/Pulse.Steel.Wrapper.Typing.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 24,
"end_line": 359,
"start_col": 0,
"start_line": 353
} | (*
Copyright 2023 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": [
"Pulse.Reflection.Util.fst.checked",
"prims.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.Reflection.Typing.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked"
],
"interface_file": false,
"source_file"... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": false,
"full_module": "Pulse.Reflection.Util",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"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 |
post: FStar.Stubs.Reflection.Types.term ->
a: FStar.Stubs.Reflection.Types.term ->
x: FStar.Stubs.Reflection.Types.term
-> FStar.Stubs.Reflection.Types.term | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Pulse.Reflection.Util.mk_star",
"Pulse.Reflection.Util.mk_exists",
"FStar.Stubs.Reflection.V2.Builtins.pack_universe",
"FStar.Stubs.Reflection.V2.Data.Uv_Zero",
"Pulse.Reflection.Util.mk_abs",
"FStar.Stubs.Reflection.V2.Data.Q_Explicit",
"Pulse.Reflection.Util.mk_... | [] | false | false | false | true | false | let with_local_body_post_body (post a x: term) : term =
| let exists_tm =
mk_exists (pack_universe Uv_Zero)
a
(mk_abs a Q_Explicit (mk_pts_to a x full_perm_tm (RT.bound_var 0)))
in
mk_star post exists_tm | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.cswap_pre | val cswap_pre:VSig.vale_pre cswap_dom | val cswap_pre:VSig.vale_pre cswap_dom | let cswap_pre : VSig.vale_pre cswap_dom =
fun (c:V.va_code)
(bit:uint64)
(p0:b64)
(p1:b64)
(va_s0:V.va_state) ->
FU.va_req_Cswap2 c va_s0
(UInt64.v bit) (as_vale_buffer p0) (as_vale_buffer p1) | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 55,
"start_col": 0,
"start_line": 48
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 | Vale.AsLowStar.ValeSig.vale_pre Vale.Inline.X64.Fswap_inline.cswap_dom | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.Inline.X64.Fswap_inline.uint64",
"Vale.Inline.X64.Fswap_inline.b64",
"Vale.X64.Decls.va_state",
"Vale.Curve25519.X64.FastUtil.va_req_Cswap2",
"FStar.UInt64.v",
"Vale.X64.MemoryAdapters.as_vale_buffer",
"Vale.Arch.HeapTypes_s.TUInt64",
"Prims.prop"
] | [] | false | false | false | true | false | let cswap_pre:VSig.vale_pre cswap_dom =
| fun (c: V.va_code) (bit: uint64) (p0: b64) (p1: b64) (va_s0: V.va_state) ->
FU.va_req_Cswap2 c va_s0 (UInt64.v bit) (as_vale_buffer p0) (as_vale_buffer p1) | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.lowstar_cswap | val lowstar_cswap:lowstar_cswap_t | val lowstar_cswap:lowstar_cswap_t | let lowstar_cswap : lowstar_cswap_t =
assert_norm (List.length cswap_dom + List.length ([]<:list arg) <= 3);
IX64.wrap_weak
3
arg_reg
cswap_regs_modified
cswap_xmms_modified
code_cswap
cswap_dom
(W.mk_prediction code_cswap cswap_dom [] (cswap_lemma code_cswap IA.win)) | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 77,
"end_line": 150,
"start_col": 0,
"start_line": 141
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 | Vale.Inline.X64.Fswap_inline.lowstar_cswap_t | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.X64.wrap_weak",
"Vale.Inline.X64.Fswap_inline.arg_reg",
"Vale.Inline.X64.Fswap_inline.cswap_regs_modified",
"Vale.Inline.X64.Fswap_inline.cswap_xmms_modified",
"Vale.X64.Machine_s.reg_xmm",
"Vale.Inline.X64.Fswap_inline.code_cswap",
"Vale.Inline.X64.Fswap_inline.cswap_dom",
"Vale.AsLowSt... | [] | false | false | false | true | false | let lowstar_cswap:lowstar_cswap_t =
| assert_norm (List.length cswap_dom + List.length ([] <: list arg) <= 3);
IX64.wrap_weak 3
arg_reg
cswap_regs_modified
cswap_xmms_modified
code_cswap
cswap_dom
(W.mk_prediction code_cswap cswap_dom [] (cswap_lemma code_cswap IA.win)) | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.arg_reg | val arg_reg:IX64.arg_reg_relation 3 | val arg_reg:IX64.arg_reg_relation 3 | let arg_reg : IX64.arg_reg_relation 3 = IX64.Rel of_reg of_arg | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 62,
"end_line": 121,
"start_col": 0,
"start_line": 121
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 | v:
Vale.Interop.X64.arg_reg_relation' 3
{ forall (r: Vale.X64.Machine_s.reg_64). {:pattern Rel?.of_reg v r}
Some? (Rel?.of_reg v r) ==> Rel?.of_arg v (Some?.v (Rel?.of_reg v r)) = r } | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.X64.Rel",
"Vale.Inline.X64.Fswap_inline.of_reg",
"Vale.Inline.X64.Fswap_inline.of_arg"
] | [] | false | false | false | false | false | let arg_reg:IX64.arg_reg_relation 3 =
| IX64.Rel of_reg of_arg | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_vartime_threshold | val bn_exp_mont_vartime_threshold : Prims.int | let bn_exp_mont_vartime_threshold = 200 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 96,
"start_col": 0,
"start_line": 96
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let bn_exp_mont_vartime_threshold =
| 200 | false | |
QuickSort.Array.fst | QuickSort.Array.qsort | val qsort: #a:eqtype -> f:tot_ord a -> x:array a -> ST unit
(requires (fun h -> Array.contains h x))
(ensures (fun h0 u h1 -> modifies (Array.only x) h0 h1
/\ Array.contains h1 x /\ sorted f (Array.sel h1 x) /\ permutation a (Array.sel h0 x) (Array.sel h1 x))) | val qsort: #a:eqtype -> f:tot_ord a -> x:array a -> ST unit
(requires (fun h -> Array.contains h x))
(ensures (fun h0 u h1 -> modifies (Array.only x) h0 h1
/\ Array.contains h1 x /\ sorted f (Array.sel h1 x) /\ permutation a (Array.sel h0 x) (Array.sel h1 x))) | let qsort #a f x =
let h0 = get() in
let len = Array.length x in
sort f 0 len x;
let h1 = get() in
cut (Seq.equal (Array.sel h0 x) (slice (Array.sel h0 x) 0 len));
cut (Seq.equal (Array.sel h1 x) (slice (Array.sel h1 x) 0 len)) | {
"file_name": "examples/algorithms/QuickSort.Array.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"end_line": 203,
"start_col": 0,
"start_line": 195
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked",
"FStar.Array.fsti.checked"
],
"interface_file": false,
"source_file": "QuickSort.Array.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.Array",
"short_module": "Array"
},
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Hea... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"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 | f: FStar.Seq.Properties.tot_ord a -> x: FStar.Array.array a -> FStar.ST.ST Prims.unit | FStar.ST.ST | [] | [] | [
"Prims.eqtype",
"FStar.Seq.Properties.tot_ord",
"FStar.Array.array",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Array.sel",
"FStar.Seq.Base.slice",
"Prims.unit",
"FStar.Monotonic.Heap.heap",
"FStar.ST.get",
"QuickSort.Array.sort",
"Prims.nat",
"FStar.Array.length"
] | [] | false | true | false | false | false | let qsort #a f x =
| let h0 = get () in
let len = Array.length x in
sort f 0 len x;
let h1 = get () in
cut (Seq.equal (Array.sel h0 x) (slice (Array.sel h0 x) 0 len));
cut (Seq.equal (Array.sel h1 x) (slice (Array.sel h1 x) 0 len)) | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_consttime_threshold | val bn_exp_mont_consttime_threshold : Prims.int | let bn_exp_mont_consttime_threshold = 200 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 41,
"end_line": 99,
"start_col": 0,
"start_line": 99
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let bn_exp_mont_consttime_threshold =
| 200 | false | |
QuickSort.Array.fst | QuickSort.Array.lemma_slice_cons_pv | val lemma_slice_cons_pv: #a:Type -> s:seq a -> i:nat -> pivot:nat{i <= pivot} -> j:nat{pivot < j && j <= length s} -> pv:a
-> Lemma
(requires (pv == index s pivot))
(ensures (slice s i j == append (slice s i pivot) (cons pv (slice s (pivot + 1) j)))) | val lemma_slice_cons_pv: #a:Type -> s:seq a -> i:nat -> pivot:nat{i <= pivot} -> j:nat{pivot < j && j <= length s} -> pv:a
-> Lemma
(requires (pv == index s pivot))
(ensures (slice s i j == append (slice s i pivot) (cons pv (slice s (pivot + 1) j)))) | let lemma_slice_cons_pv #a s i pivot j pv =
let lo = slice s i pivot in
let hi = slice s (pivot + 1) j in
cut (Seq.equal (slice s i j) (append lo (cons pv hi))) | {
"file_name": "examples/algorithms/QuickSort.Array.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 56,
"end_line": 141,
"start_col": 0,
"start_line": 138
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked",
"FStar.Array.fsti.checked"
],
"interface_file": false,
"source_file": "QuickSort.Array.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.Array",
"short_module": "Array"
},
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Hea... | {
"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 ->
i: Prims.nat ->
pivot: Prims.nat{i <= pivot} ->
j: Prims.nat{pivot < j && j <= FStar.Seq.Base.length s} ->
pv: a
-> FStar.Pervasives.Lemma (requires pv == FStar.Seq.Base.index s pivot)
(ensures
FStar.Seq.Base.slice s i j ==
FStar.Seq.Base.append (F... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_AmpAmp",
"Prims.op_LessThan",
"FStar.Seq.Base.length",
"Prims.cut",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.append",
"FStar.Seq.Base.cons",
"Prims.op_Addition",
"Prims.unit"
] | [] | true | false | true | false | false | let lemma_slice_cons_pv #a s i pivot j pv =
| let lo = slice s i pivot in
let hi = slice s (pivot + 1) j in
cut (Seq.equal (slice s i j) (append lo (cons pv hi))) | false |
Benton2004.RHL.Examples2.fst | Benton2004.RHL.Examples2.cond | val cond : Benton2004.exp Prims.bool | let cond = eop op_LessThan (evar i) (evar n) | {
"file_name": "examples/rel/Benton2004.RHL.Examples2.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 25,
"start_col": 0,
"start_line": 25
} | (*
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.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.RHL.Derived.fst.checked"
],
"interface_file": false,
"source_file": "Benton2004.RHL.Examples2.fst"
} | [
{
"abbrev": false,
"full_module": "Benton2004.RHL.Derived",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | Benton2004.exp Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Benton2004.eop",
"Prims.int",
"Prims.bool",
"Prims.op_LessThan",
"Benton2004.evar",
"Benton2004.RHL.Examples2.i",
"Benton2004.RHL.Examples2.n"
] | [] | false | false | false | true | false | let cond =
| eop op_LessThan (evar i) (evar n) | false | |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.cswap_lemma | val cswap_lemma : Vale.AsLowStar.ValeSig.vale_sig Vale.Inline.X64.Fswap_inline.cswap_regs_modified
Vale.Inline.X64.Fswap_inline.cswap_xmms_modified
Vale.Inline.X64.Fswap_inline.cswap_pre
Vale.Inline.X64.Fswap_inline.cswap_post | let cswap_lemma = as_t #(VSig.vale_sig cswap_regs_modified cswap_xmms_modified cswap_pre cswap_post) cswap_lemma' | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 113,
"end_line": 106,
"start_col": 0,
"start_line": 106
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 | Vale.AsLowStar.ValeSig.vale_sig Vale.Inline.X64.Fswap_inline.cswap_regs_modified
Vale.Inline.X64.Fswap_inline.cswap_xmms_modified
Vale.Inline.X64.Fswap_inline.cswap_pre
Vale.Inline.X64.Fswap_inline.cswap_post | Prims.Tot | [
"total"
] | [] | [
"Vale.Inline.X64.Fswap_inline.as_t",
"Vale.AsLowStar.ValeSig.vale_sig",
"Vale.Inline.X64.Fswap_inline.cswap_dom",
"Vale.Inline.X64.Fswap_inline.cswap_regs_modified",
"Vale.Inline.X64.Fswap_inline.cswap_xmms_modified",
"Vale.X64.Machine_s.reg_xmm",
"Vale.Inline.X64.Fswap_inline.cswap_pre",
"Vale.Inline... | [] | false | false | false | true | false | let cswap_lemma =
| as_t #(VSig.vale_sig cswap_regs_modified cswap_xmms_modified cswap_pre cswap_post) cswap_lemma' | false | |
Benton2004.RHL.Examples2.fst | Benton2004.RHL.Examples2.asx_e | val asx_e : Benton2004.exp Prims.int | let asx_e = eop op_Addition (evar y) (const 1) | {
"file_name": "examples/rel/Benton2004.RHL.Examples2.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 26,
"start_col": 0,
"start_line": 26
} | (*
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.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.RHL.Derived.fst.checked"
],
"interface_file": false,
"source_file": "Benton2004.RHL.Examples2.fst"
} | [
{
"abbrev": false,
"full_module": "Benton2004.RHL.Derived",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | Benton2004.exp Prims.int | Prims.Tot | [
"total"
] | [] | [
"Benton2004.eop",
"Prims.int",
"Prims.op_Addition",
"Benton2004.evar",
"Benton2004.RHL.Examples2.y",
"Benton2004.const"
] | [] | false | false | false | true | false | let asx_e =
| eop op_Addition (evar y) (const 1) | false | |
Benton2004.RHL.Examples2.fst | Benton2004.RHL.Examples2.asi_e | val asi_e : Benton2004.exp Prims.int | let asi_e = eop op_Addition (evar i) (evar x) | {
"file_name": "examples/rel/Benton2004.RHL.Examples2.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 45,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | (*
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.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.RHL.Derived.fst.checked"
],
"interface_file": false,
"source_file": "Benton2004.RHL.Examples2.fst"
} | [
{
"abbrev": false,
"full_module": "Benton2004.RHL.Derived",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | Benton2004.exp Prims.int | Prims.Tot | [
"total"
] | [] | [
"Benton2004.eop",
"Prims.int",
"Prims.op_Addition",
"Benton2004.evar",
"Benton2004.RHL.Examples2.i",
"Benton2004.RHL.Examples2.x"
] | [] | false | false | false | true | false | let asi_e =
| eop op_Addition (evar i) (evar x) | false | |
Benton2004.RHL.Examples2.fst | Benton2004.RHL.Examples2.l | val l : Benton2004.computation | let l = while cond (seq (assign x asx_e) (assign i asi_e)) | {
"file_name": "examples/rel/Benton2004.RHL.Examples2.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 28,
"start_col": 0,
"start_line": 28
} | (*
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.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.RHL.Derived.fst.checked"
],
"interface_file": false,
"source_file": "Benton2004.RHL.Examples2.fst"
} | [
{
"abbrev": false,
"full_module": "Benton2004.RHL.Derived",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | Benton2004.computation | Prims.Tot | [
"total"
] | [] | [
"Benton2004.while",
"Benton2004.RHL.Examples2.cond",
"Benton2004.seq",
"Benton2004.assign",
"Benton2004.RHL.Examples2.x",
"Benton2004.RHL.Examples2.asx_e",
"Benton2004.RHL.Examples2.i",
"Benton2004.RHL.Examples2.asi_e"
] | [] | false | false | false | true | false | let l =
| while cond (seq (assign x asx_e) (assign i asi_e)) | false | |
Benton2004.RHL.Examples2.fst | Benton2004.RHL.Examples2.r | val r : Benton2004.computation | let r = seq (assign x asx_e) (while cond (assign i asi_e)) | {
"file_name": "examples/rel/Benton2004.RHL.Examples2.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 58,
"end_line": 29,
"start_col": 0,
"start_line": 29
} | (*
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.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.RHL.Derived.fst.checked"
],
"interface_file": false,
"source_file": "Benton2004.RHL.Examples2.fst"
} | [
{
"abbrev": false,
"full_module": "Benton2004.RHL.Derived",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | Benton2004.computation | Prims.Tot | [
"total"
] | [] | [
"Benton2004.seq",
"Benton2004.assign",
"Benton2004.RHL.Examples2.x",
"Benton2004.RHL.Examples2.asx_e",
"Benton2004.while",
"Benton2004.RHL.Examples2.cond",
"Benton2004.RHL.Examples2.i",
"Benton2004.RHL.Examples2.asi_e"
] | [] | false | false | false | true | false | let r =
| seq (assign x asx_e) (while cond (assign i asi_e)) | false | |
Benton2004.RHL.Examples2.fst | Benton2004.RHL.Examples2.phi | val phi: Prims.unit -> GTot (gexp bool) | val phi: Prims.unit -> GTot (gexp bool) | let phi () : GTot (gexp bool) = gand (geq (gvar i Left) (gvar i Right)) (gand (geq (gvar n Left) (gvar n Right)) (geq (gvar y Left) (gvar y Right))) | {
"file_name": "examples/rel/Benton2004.RHL.Examples2.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 148,
"end_line": 31,
"start_col": 0,
"start_line": 31
} | (*
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.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.RHL.Derived.fst.checked"
],
"interface_file": false,
"source_file": "Benton2004.RHL.Examples2.fst"
} | [
{
"abbrev": false,
"full_module": "Benton2004.RHL.Derived",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full... | {
"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 | _: Prims.unit -> Prims.GTot (Benton2004.RHL.gexp Prims.bool) | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.unit",
"Benton2004.RHL.gand",
"Benton2004.RHL.geq",
"Prims.int",
"Benton2004.RHL.gvar",
"Benton2004.RHL.Examples2.i",
"Benton2004.RHL.Left",
"Benton2004.RHL.Right",
"Benton2004.RHL.Examples2.n",
"Benton2004.RHL.Examples2.y",
"Benton2004.RHL.gexp",
"Prims.bool"
] | [] | false | false | false | false | false | let phi () : GTot (gexp bool) =
| gand (geq (gvar i Left) (gvar i Right))
(gand (geq (gvar n Left) (gvar n Right)) (geq (gvar y Left) (gvar y Right))) | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_mont_t | val bn_mont_t : n: Hacl.Spec.Bignum.Definitions.lbignum t len -> Type0 | let bn_mont_t (#t:limb_t) (#len:BN.bn_len t) (n:lbignum t len) =
x:lbignum t len{bn_v x < bn_v n} | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 25,
"start_col": 0,
"start_line": 24
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Hacl.Spec.Bignum.Definitions.lbignum t len -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Prims.b2t",
"Prims.op_LessThan",
"Hacl.Spec.Bignum.Definitions.bn_v"
] | [] | false | false | false | false | true | let bn_mont_t (#t: limb_t) (#len: BN.bn_len t) (n: lbignum t len) =
| x: lbignum t len {bn_v x < bn_v n} | false | |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.parse_deplen_payload_kind | val parse_deplen_payload_kind : min: Prims.nat -> max: Prims.nat{min <= max} -> k: LowParse.Spec.Base.parser_kind
-> LowParse.Spec.Base.parser_kind | let parse_deplen_payload_kind = parse_bounded_vlgen_payload_kind | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 64,
"end_line": 89,
"start_col": 0,
"start_line": 89
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 | min: Prims.nat -> max: Prims.nat{min <= max} -> k: LowParse.Spec.Base.parser_kind
-> LowParse.Spec.Base.parser_kind | Prims.Tot | [
"total"
] | [] | [
"LowParse.Spec.VLGen.parse_bounded_vlgen_payload_kind"
] | [] | false | false | false | false | false | let parse_deplen_payload_kind =
| parse_bounded_vlgen_payload_kind | false | |
Steel.GhostPCMReference.fst | Steel.GhostPCMReference.recall | val recall (#o: _)
(#a:Type)
(#pcm:pcm a)
(fact:property a)
(r:ref a pcm)
(v:erased a)
(w:witnessed r fact)
: SteelAtomicU (erased a) o
(pts_to r v)
(fun v1 -> pts_to r v)
(requires fun _ -> True)
(ensures fun _... | val recall (#o: _)
(#a:Type)
(#pcm:pcm a)
(fact:property a)
(r:ref a pcm)
(v:erased a)
(w:witnessed r fact)
: SteelAtomicU (erased a) o
(pts_to r v)
(fun v1 -> pts_to r v)
(requires fun _ -> True)
(ensures fun _... | let recall (#o: _)
(#a:Type)
(#pcm:pcm a)
(fact:property a)
(r:ref a pcm)
(v:erased a)
(w:witnessed r fact)
= P.recall fact r v w | {
"file_name": "lib/steel/Steel.GhostPCMReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 23,
"end_line": 133,
"start_col": 0,
"start_line": 126
} | (*
Copyright 2020 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": [
"Steel.Preorder.fst.checked",
"Steel.PCMReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"... | [
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"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 |
fact: Steel.Memory.property a ->
r: Steel.GhostPCMReference.ref a pcm ->
v: FStar.Ghost.erased a ->
w: Steel.GhostPCMReference.witnessed r fact
-> Steel.Effect.Atomic.SteelAtomicU (FStar.Ghost.erased a) | Steel.Effect.Atomic.SteelAtomicU | [] | [] | [
"Steel.Memory.inames",
"FStar.PCM.pcm",
"Steel.Memory.property",
"Steel.GhostPCMReference.ref",
"FStar.Ghost.erased",
"Steel.GhostPCMReference.witnessed",
"Steel.PCMReference.recall"
] | [] | false | true | false | false | false | let recall
(#o: _)
(#a: Type)
(#pcm: pcm a)
(fact: property a)
(r: ref a pcm)
(v: erased a)
(w: witnessed r fact)
=
| P.recall fact r v w | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st | val bn_exp_mont_st : t: Hacl.Spec.Bignum.Definitions.limb_t -> len: Hacl.Spec.Bignum.bn_len t -> Type0 | let bn_exp_mont_st (t:limb_t) (len:BN.bn_len t) =
n:lbignum t len
-> mu:limb t{BM.bn_mont_pre n mu}
-> aM:bn_mont_t n
-> bBits:size_nat
-> b:lbignum t (blocks0 bBits (bits t)){bn_v b < pow2 bBits} ->
Pure (bn_mont_t n)
(requires True)
(ensures fun resM ->
let k = E.mk_nat_mont_ll_comm_monoid (bit... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 45,
"end_line": 113,
"start_col": 0,
"start_line": 103
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: Hacl.Spec.Bignum.Definitions.limb_t -> len: Hacl.Spec.Bignum.bn_len t -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Spec.Bignum.MontExponentiation.bn_mont_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.blocks0",
... | [] | false | false | false | false | true | let bn_exp_mont_st (t: limb_t) (len: BN.bn_len t) =
|
n: lbignum t len ->
mu: limb t {BM.bn_mont_pre n mu} ->
aM: bn_mont_t n ->
bBits: size_nat ->
b: lbignum t (blocks0 bBits (bits t)) {bn_v b < pow2 bBits}
-> Pure (bn_mont_t n)
(requires True)
(ensures
fun resM ->
let k = E.mk_nat_mont_ll_comm_monoid (bits t) len (bn_... | false | |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_mont_one | val bn_mont_one:
#t:limb_t
-> #len:BN.bn_len t
-> n:lbignum t len
-> mu:limb t{BM.bn_mont_pre n mu} ->
SE.one_st (bn_mont_t n) (mk_to_nat_mont_ll_comm_monoid n mu) | val bn_mont_one:
#t:limb_t
-> #len:BN.bn_len t
-> n:lbignum t len
-> mu:limb t{BM.bn_mont_pre n mu} ->
SE.one_st (bn_mont_t n) (mk_to_nat_mont_ll_comm_monoid n mu) | let bn_mont_one #t #len n mu _ =
BM.bn_precomp_r2_mod_n_lemma 0 n;
let r2 = BM.bn_precomp_r2_mod_n 0 n in
BM.bn_mont_one_lemma n mu r2;
BM.bn_mont_one n mu r2 | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 51,
"start_col": 0,
"start_line": 47
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Hacl.Spec.Bignum.Definitions.lbignum t len ->
mu: Hacl.Spec.Bignum.Definitions.limb t {Hacl.Spec.Bignum.Montgomery.bn_mont_pre n mu}
-> Spec.Exponentiation.one_st (Hacl.Spec.Bignum.MontExponentiation.bn_mont_t n)
(Hacl.Spec.Bignum.MontExponentiation.mk_to_nat_mont_ll_comm_monoid n mu) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Prims.unit",
"Hacl.Spec.Bignum.Montgomery.bn_mont_one",
"Hacl.Spec.Bignum.Montgomery.bn_mont_one_lemma",
"Hacl.Sp... | [] | false | false | false | false | false | let bn_mont_one #t #len n mu _ =
| BM.bn_precomp_r2_mod_n_lemma 0 n;
let r2 = BM.bn_precomp_r2_mod_n 0 n in
BM.bn_mont_one_lemma n mu r2;
BM.bn_mont_one n mu r2 | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_mont_sqr | val bn_mont_sqr:
#t:limb_t
-> #len:BN.bn_len t
-> n:lbignum t len
-> mu:limb t{BM.bn_mont_pre n mu} ->
SE.sqr_st (bn_mont_t n) (mk_to_nat_mont_ll_comm_monoid n mu) | val bn_mont_sqr:
#t:limb_t
-> #len:BN.bn_len t
-> n:lbignum t len
-> mu:limb t{BM.bn_mont_pre n mu} ->
SE.sqr_st (bn_mont_t n) (mk_to_nat_mont_ll_comm_monoid n mu) | let bn_mont_sqr #t #len n mu aM =
BM.bn_mont_sqr_lemma n mu aM;
BM.bn_mont_sqr n mu aM | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 75,
"start_col": 0,
"start_line": 73
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Hacl.Spec.Bignum.Definitions.lbignum t len ->
mu: Hacl.Spec.Bignum.Definitions.limb t {Hacl.Spec.Bignum.Montgomery.bn_mont_pre n mu}
-> Spec.Exponentiation.sqr_st (Hacl.Spec.Bignum.MontExponentiation.bn_mont_t n)
(Hacl.Spec.Bignum.MontExponentiation.mk_to_nat_mont_ll_comm_monoid n mu) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Spec.Bignum.MontExponentiation.bn_mont_t",
"Hacl.Spec.Bignum.Montgomery.bn_mont_sqr",
"Prims.unit",
"Hacl.Sp... | [] | false | false | false | false | false | let bn_mont_sqr #t #len n mu aM =
| BM.bn_mont_sqr_lemma n mu aM;
BM.bn_mont_sqr n mu aM | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_mont_mul | val bn_mont_mul:
#t:limb_t
-> #len:BN.bn_len t
-> n:lbignum t len
-> mu:limb t{BM.bn_mont_pre n mu} ->
SE.mul_st (bn_mont_t n) (mk_to_nat_mont_ll_comm_monoid n mu) | val bn_mont_mul:
#t:limb_t
-> #len:BN.bn_len t
-> n:lbignum t len
-> mu:limb t{BM.bn_mont_pre n mu} ->
SE.mul_st (bn_mont_t n) (mk_to_nat_mont_ll_comm_monoid n mu) | let bn_mont_mul #t #len n mu aM bM =
BM.bn_mont_mul_lemma n mu aM bM;
BM.bn_mont_mul n mu aM bM | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 27,
"end_line": 63,
"start_col": 0,
"start_line": 61
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
n: Hacl.Spec.Bignum.Definitions.lbignum t len ->
mu: Hacl.Spec.Bignum.Definitions.limb t {Hacl.Spec.Bignum.Montgomery.bn_mont_pre n mu}
-> Spec.Exponentiation.mul_st (Hacl.Spec.Bignum.MontExponentiation.bn_mont_t n)
(Hacl.Spec.Bignum.MontExponentiation.mk_to_nat_mont_ll_comm_monoid n mu) | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Spec.Bignum.MontExponentiation.bn_mont_t",
"Hacl.Spec.Bignum.Montgomery.bn_mont_mul",
"Prims.unit",
"Hacl.Sp... | [] | false | false | false | false | false | let bn_mont_mul #t #len n mu aM bM =
| BM.bn_mont_mul_lemma n mu aM bM;
BM.bn_mont_mul n mu aM bM | false |
CalcInference.fst | CalcInference.test2 | val test2: Prims.unit -> squash (2 == 1 + 1) | val test2: Prims.unit -> squash (2 == 1 + 1) | let test2 () : squash (2 == 1 + 1) =
calc (==) {
_;
== { lem () }
1 + 1;
} | {
"file_name": "examples/calc/CalcInference.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 17,
"start_col": 0,
"start_line": 12
} | module CalcInference
let lem () : squash (2 == 1 + 1) = ()
let test1 () : squash (2 == 1 + 1) =
calc (==) {
2;
== { lem () }
_;
} | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "CalcInference.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> Prims.squash (2 == 1 + 1) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.op_Addition",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"CalcInference.lem",
"Prims.squash"
] | [] | false | false | true | false | false | let test2 () : squash (2 == 1 + 1) =
| calc ( == ) {
_;
( == ) { lem () }
1 + 1;
} | false |
Vale.Inline.X64.Fswap_inline.fst | Vale.Inline.X64.Fswap_inline.cswap_lemma' | val cswap_lemma' (code: V.va_code) (_win: bool) (bit: uint64) (p0 p1: b64) (va_s0: V.va_state)
: Ghost (V.va_state & V.va_fuel)
(requires cswap_pre code bit p0 p1 va_s0)
(ensures
(fun (va_s1, f) ->
V.eval_code code va_s0 f va_s1 /\
VSig.vale_calling_conventions va_s0 va_s... | val cswap_lemma' (code: V.va_code) (_win: bool) (bit: uint64) (p0 p1: b64) (va_s0: V.va_state)
: Ghost (V.va_state & V.va_fuel)
(requires cswap_pre code bit p0 p1 va_s0)
(ensures
(fun (va_s1, f) ->
V.eval_code code va_s0 f va_s1 /\
VSig.vale_calling_conventions va_s0 va_s... | let cswap_lemma'
(code:V.va_code)
(_win:bool)
(bit:uint64)
(p0:b64)
(p1:b64)
(va_s0:V.va_state)
: Ghost (V.va_state & V.va_fuel)
(requires
cswap_pre code bit p0 p1 va_s0)
(ensures (fun (va_s1, f) ->
V.eval_code code va_s0 f va_s1 /\
VSig.vale_calling_conventions v... | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fswap_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 103,
"start_col": 0,
"start_line": 78
} | module Vale.Inline.X64.Fswap_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSi... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
{
"abbrev": true,
"full_module": "Vale.X64.Print_Inline_s",
"short_module": "PR"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_s",
"short_module": "MS"
},
{
"abbrev": ... | {
"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 |
code: Vale.X64.Decls.va_code ->
_win: Prims.bool ->
bit: Vale.Inline.X64.Fswap_inline.uint64 ->
p0: Vale.Inline.X64.Fswap_inline.b64 ->
p1: Vale.Inline.X64.Fswap_inline.b64 ->
va_s0: Vale.X64.Decls.va_state
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Prims.bool",
"Vale.Inline.X64.Fswap_inline.uint64",
"Vale.Inline.X64.Fswap_inline.b64",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple2",
"Prims.unit",
"Vale.AsLowStar.MemoryHelpers.buffer_writeable_reveal",
"Vale.Arch.HeapTypes_s.T... | [] | false | false | false | false | false | let cswap_lemma' (code: V.va_code) (_win: bool) (bit: uint64) (p0 p1: b64) (va_s0: V.va_state)
: Ghost (V.va_state & V.va_fuel)
(requires cswap_pre code bit p0 p1 va_s0)
(ensures
(fun (va_s1, f) ->
V.eval_code code va_s0 f va_s1 /\
VSig.vale_calling_conventions va_s0 va_s... | let va_s1, f =
FU.va_lemma_Cswap2 code va_s0 (UInt64.v bit) (as_vale_buffer p0) (as_vale_buffer p1)
in
Vale.AsLowStar.MemoryHelpers.buffer_writeable_reveal ME.TUInt64 ME.TUInt64 p0;
Vale.AsLowStar.MemoryHelpers.buffer_writeable_reveal ME.TUInt64 ME.TUInt64 p1;
(va_s1, f) | false |
CalcInference.fst | CalcInference.test1 | val test1: Prims.unit -> squash (2 == 1 + 1) | val test1: Prims.unit -> squash (2 == 1 + 1) | let test1 () : squash (2 == 1 + 1) =
calc (==) {
2;
== { lem () }
_;
} | {
"file_name": "examples/calc/CalcInference.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 10,
"start_col": 0,
"start_line": 5
} | module CalcInference
let lem () : squash (2 == 1 + 1) = () | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "CalcInference.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> Prims.squash (2 == 1 + 1) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"CalcInference.lem",
"Prims.squash",
"Prims.op_Addition"
] | [] | false | false | true | false | false | let test1 () : squash (2 == 1 + 1) =
| calc ( == ) {
2;
( == ) { lem () }
_;
} | false |
CalcInference.fst | CalcInference.test3 | val test3: Prims.unit -> squash (2 == 1 + 1) | val test3: Prims.unit -> squash (2 == 1 + 1) | let test3 () : squash (2 == 1 + 1) =
calc (==) {
_;
== { lem () }
_;
} | {
"file_name": "examples/calc/CalcInference.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 3,
"end_line": 24,
"start_col": 0,
"start_line": 19
} | module CalcInference
let lem () : squash (2 == 1 + 1) = ()
let test1 () : squash (2 == 1 + 1) =
calc (==) {
2;
== { lem () }
_;
}
let test2 () : squash (2 == 1 + 1) =
calc (==) {
_;
== { lem () }
1 + 1;
} | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_file": "CalcInference.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
}
] | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> Prims.squash (2 == 1 + 1) | Prims.Tot | [
"total"
] | [] | [
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.int",
"Prims.eq2",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"FStar.Calc.calc_init",
"FStar.Calc.calc_pack",
"CalcInference.lem",
"Prims.squash",
"Prims.op_Addition"
] | [] | false | false | true | false | false | let test3 () : squash (2 == 1 + 1) =
| calc ( == ) {
_;
( == ) { lem () }
_;
} | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_vartime | val bn_exp_mont_vartime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | val bn_exp_mont_vartime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | let bn_exp_mont_vartime #t #len n mu aM bBits b =
if bBits < bn_exp_mont_vartime_threshold then
bn_exp_mont_bm_vartime n mu aM bBits b
else
bn_exp_mont_fw 4 n mu aM bBits b | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 152,
"start_col": 0,
"start_line": 148
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Spec.Bignum.MontExponentiation.bn_mont_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.blocks0",
... | [] | false | false | false | false | false | let bn_exp_mont_vartime #t #len n mu aM bBits b =
| if bBits < bn_exp_mont_vartime_threshold
then bn_exp_mont_bm_vartime n mu aM bBits b
else bn_exp_mont_fw 4 n mu aM bBits b | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_bm_consttime | val bn_exp_mont_bm_consttime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | val bn_exp_mont_bm_consttime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | let bn_exp_mont_bm_consttime #t #len n mu aM bBits b =
let k1 = mk_bn_mont_concrete_ops n mu in
SE.exp_mont_ladder_swap_lemma k1 aM bBits (bn_v b);
LE.exp_mont_ladder_swap_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b);
LE.exp_mont_ladder_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b);
SE.exp_... | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 131,
"start_col": 0,
"start_line": 126
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Spec.Bignum.MontExponentiation.bn_mont_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.blocks0",
... | [] | false | false | false | false | false | let bn_exp_mont_bm_consttime #t #len n mu aM bBits b =
| let k1 = mk_bn_mont_concrete_ops n mu in
SE.exp_mont_ladder_swap_lemma k1 aM bBits (bn_v b);
LE.exp_mont_ladder_swap_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b);
LE.exp_mont_ladder_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b);
SE.exp_mont_ladder_swap k1 aM bBits (bn_v b) | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_fw | val bn_exp_mont_fw:
#t:limb_t
-> #len:BN.bn_len t
-> l:size_pos{l < bits t /\ pow2 l * len <= max_size_t} ->
bn_exp_mont_st t len | val bn_exp_mont_fw:
#t:limb_t
-> #len:BN.bn_len t
-> l:size_pos{l < bits t /\ pow2 l * len <= max_size_t} ->
bn_exp_mont_st t len | let bn_exp_mont_fw #t #len l n mu aM bBits b =
let k1 = mk_bn_mont_concrete_ops n mu in
SE.exp_fw_lemma k1 aM bBits (bn_v b) l;
LE.exp_fw_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b) l;
SE.exp_fw k1 aM bBits (bn_v b) l | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 34,
"end_line": 144,
"start_col": 0,
"start_line": 140
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Lib.IntTypes.size_pos{l < Lib.IntTypes.bits t /\ Prims.pow2 l * len <= Lib.IntTypes.max_size_t}
-> Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Lib.IntTypes.size_pos",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.bits",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Prims.pow2",
"Lib.IntTypes.max_size_t",
"Hacl.Spec.Bignum.Definitions.lbignum",
"... | [] | false | false | false | false | false | let bn_exp_mont_fw #t #len l n mu aM bBits b =
| let k1 = mk_bn_mont_concrete_ops n mu in
SE.exp_fw_lemma k1 aM bBits (bn_v b) l;
LE.exp_fw_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b) l;
SE.exp_fw k1 aM bBits (bn_v b) l | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_bm_vartime | val bn_exp_mont_bm_vartime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | val bn_exp_mont_bm_vartime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | let bn_exp_mont_bm_vartime #t #len n mu aM bBits b =
let k1 = mk_bn_mont_concrete_ops n mu in
SE.exp_rl_lemma k1 aM bBits (bn_v b);
LE.exp_rl_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b);
SE.exp_rl k1 aM bBits (bn_v b) | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 32,
"end_line": 122,
"start_col": 0,
"start_line": 118
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Spec.Bignum.MontExponentiation.bn_mont_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.blocks0",
... | [] | false | false | false | false | false | let bn_exp_mont_bm_vartime #t #len n mu aM bBits b =
| let k1 = mk_bn_mont_concrete_ops n mu in
SE.exp_rl_lemma k1 aM bBits (bn_v b);
LE.exp_rl_lemma k1.SE.to.SE.comm_monoid (bn_v aM) bBits (bn_v b);
SE.exp_rl k1 aM bBits (bn_v b) | false |
Hacl.Spec.Bignum.MontExponentiation.fst | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_consttime | val bn_exp_mont_consttime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | val bn_exp_mont_consttime: #t:limb_t -> #len:BN.bn_len t -> bn_exp_mont_st t len | let bn_exp_mont_consttime #t #len n mu aM bBits b =
if bBits < bn_exp_mont_consttime_threshold then
bn_exp_mont_bm_consttime n mu aM bBits b
else
bn_exp_mont_fw 4 n mu aM bBits b | {
"file_name": "code/bignum/Hacl.Spec.Bignum.MontExponentiation.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 36,
"end_line": 160,
"start_col": 0,
"start_line": 156
} | module Hacl.Spec.Bignum.MontExponentiation
open FStar.Mul
open Lib.IntTypes
open Lib.Sequence
open Hacl.Spec.Bignum.Definitions
module LE = Lib.Exponentiation
module SE = Spec.Exponentiation
module E = Hacl.Spec.Exponentiation.Lemmas
module M = Hacl.Spec.Montgomery.Lemmas
module BN = Hacl.Spec.Bignum
module BM = ... | {
"checked_file": "/",
"dependencies": [
"Spec.Exponentiation.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.NatMod.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Exponentiation.fsti.checked",
"Hacl.Spec.Montgomery.Lemmas.fst.checked",
"Hacl.Spec.Exponentiati... | [
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum.Montgomery",
"short_module": "BM"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Bignum",
"short_module": "BN"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.Montgomery.Lemmas",
"short_module": "M"
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Spec.Bignum.MontExponentiation.bn_exp_mont_st t len | Prims.Tot | [
"total"
] | [] | [
"Hacl.Spec.Bignum.Definitions.limb_t",
"Hacl.Spec.Bignum.bn_len",
"Hacl.Spec.Bignum.Definitions.lbignum",
"Hacl.Spec.Bignum.Definitions.limb",
"Hacl.Spec.Bignum.Montgomery.bn_mont_pre",
"Hacl.Spec.Bignum.MontExponentiation.bn_mont_t",
"Lib.IntTypes.size_nat",
"Hacl.Spec.Bignum.Definitions.blocks0",
... | [] | false | false | false | false | false | let bn_exp_mont_consttime #t #len n mu aM bBits b =
| if bBits < bn_exp_mont_consttime_threshold
then bn_exp_mont_bm_consttime n mu aM bBits b
else bn_exp_mont_fw 4 n mu aM bBits b | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.parse_deplen | val parse_deplen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
: Tot (parser (parse_... | val parse_deplen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
: Tot (parser (parse_... | let parse_deplen
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: ht -> Tot (bounded_int32 min max))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
: Tot (parser (parse_deplen_kind min max hk pk) (parse_deplen_d... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 41,
"end_line": 192,
"start_col": 0,
"start_line": 177
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
hp: LowParse.Spec.Base.parser hk ht ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp
-> LowParse.Spec.Base.parser (LowParse.Spec.DepLen.parse_deplen_kind min max hk pk)
... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.Combinators.parse_tagged_union",
"LowParse.Spec.DepLe... | [] | false | false | false | false | false | let parse_deplen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
: Tot (parser (parse_... | parse_tagged_union hp (calc_tag_of_deplen_data min max dlf ps) (parse_deplen_payload min max dlf ps) | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.calc_tag_of_deplen_data | val calc_tag_of_deplen_data
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(x: parse_deplen_data_t min max dlf ps)
: GTot ht | val calc_tag_of_deplen_data
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(x: parse_deplen_data_t min max dlf ps)
: GTot ht | let calc_tag_of_deplen_data
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
(x : parse_deplen_data_t min max dlf ps)
: GTot ht
= fst x | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 7,
"end_line": 67,
"start_col": 0,
"start_line": 56
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
x: LowParse.Spec.DepLen.parse_deplen_data_t min max dlf ps
-> Prims.GTot ht | Prims.GTot | [
"sometrivial"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.DepLen.parse_deplen_data_t",
"FStar.Pervasives.Native... | [] | false | false | false | false | false | let calc_tag_of_deplen_data
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(x: parse_deplen_data_t min max dlf ps)
: GTot ht =
| fst x | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.parse_deplen_data_t | val parse_deplen_data_t : min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp
-> Type | let parse_deplen_data_t
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
= x:(ht & pt) {U32.v (dlf (fst x)) == Seq.length (serialize ps (snd x) ) } | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 74,
"end_line": 51,
"start_col": 0,
"start_line": 42
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp
-> Type | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"FStar.Pervasives.Native.tuple2",
"Prims.eq2",
"Prims.int",
"Pri... | [] | false | false | false | false | true | let parse_deplen_data_t
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
=
| x: (ht & pt){U32.v (dlf (fst x)) == Seq.length (serialize ps (snd x))} | false | |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.parse_deplen_kind | val parse_deplen_kind : min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
hk: LowParse.Spec.Base.parser_kind ->
pk: LowParse.Spec.Base.parser_kind
-> LowParse.Spec.Base.parser_kind | let parse_deplen_kind
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(hk : parser_kind)
(pk : parser_kind)
= and_then_kind hk (parse_deplen_payload_kind min max pk) | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 57,
"end_line": 172,
"start_col": 0,
"start_line": 167
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
hk: LowParse.Spec.Base.parser_kind ->
pk: LowParse.Spec.Base.parser_kind
-> LowParse.Spec.Base.parser_kind | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Combinators.and_then_kind",
"LowParse.Spec.DepLen.parse_deplen_payload_kind"
] | [] | false | false | false | false | false | let parse_deplen_kind (min: nat) (max: nat{min <= max /\ max < 4294967296}) (hk pk: parser_kind) =
| and_then_kind hk (parse_deplen_payload_kind min max pk) | false | |
Hacl.Impl.RSAPSS.fst | Hacl.Impl.RSAPSS.modBits_t | val modBits_t : t: Hacl.Bignum.Definitions.limb_t -> Type0 | let modBits_t (t:limb_t) = modBits:size_t{1 < v modBits /\ 2 * bits t * SD.blocks (v modBits) (bits t) <= max_size_t} | {
"file_name": "code/rsapss/Hacl.Impl.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 117,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | module Hacl.Impl.RSAPSS
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module Hash = Spec.Agile.Hash
module SB = Hacl.Spec.Bignum
module BB = Hacl.Spec.Bignum.Base
module SD = Hacl.Spec.Bignum.Definitions
... | {
"checked_file": "/",
"dependencies": [
"Spec.RSAPSS.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.RSAPSS.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Keys",
"short_module": "RK"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.MGF",
"short_module": "RM"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Padding",
"short_module": "RP"
},
{
"abbrev": true... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | t: Hacl.Bignum.Definitions.limb_t -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Lib.IntTypes.size_t",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThan",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Prims.op_LessThanOrEqual",
"FStar.Mul.op_Star",
"Lib.IntTypes.bits",
"Hacl.Spec.Bignum.Definitions.blocks",
"Lib.IntTypes.max_s... | [] | false | false | false | true | true | let modBits_t (t: limb_t) =
| modBits: size_t{1 < v modBits /\ (2 * bits t) * SD.blocks (v modBits) (bits t) <= max_size_t} | false | |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.parse_deplen_payload | val parse_deplen_payload
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
: Tot
(parser (parse_deplen_payload_kind min max pk)
... | val parse_deplen_payload
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
: Tot
(parser (parse_deplen_payload_kind min max pk)
... | let parse_deplen_payload
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
(h : ht)
: Tot (parser (parse_deplen_payload_kind min max pk) (refine_with_tag (calc_t... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 41,
"end_line": 119,
"start_col": 0,
"start_line": 94
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
h: ht
-> LowParse.Spec.Base.parser (LowParse.Spec.DepLen.parse_deplen_payload_kind min max pk)
(LowParse.Spec.Base.re... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.Combinators.fail_parser",
"LowParse.Spec.DepLen.parse... | [] | false | false | false | false | false | let parse_deplen_payload
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
: Tot
(parser (parse_deplen_payload_kind min max pk)
... | let sz = (U32.v (dlf h)) in
let bounds_off =
pk.parser_kind_low > sz ||
(match pk.parser_kind_high with
| None -> false
| Some pkmax -> pkmax < sz)
in
if bounds_off
then
fail_parser (parse_deplen_payload_kind min max pk)
(refine_with_tag (calc_tag_of_deplen_data min max dlf ps) h)
else
weaken (parse... | false |
Steel.GhostPCMReference.fst | Steel.GhostPCMReference.witness | val witness (#o:inames)
(#a:Type)
(#pcm:pcm a)
(r:ref a pcm)
(fact:Steel.Preorder.stable_property pcm)
(v:erased a)
(_:squash (Steel.Preorder.fact_valid_compat fact v))
: SteelAtomicUT (witnessed r fact) o
(pts_to r v)
(fun _ -> pts_t... | val witness (#o:inames)
(#a:Type)
(#pcm:pcm a)
(r:ref a pcm)
(fact:Steel.Preorder.stable_property pcm)
(v:erased a)
(_:squash (Steel.Preorder.fact_valid_compat fact v))
: SteelAtomicUT (witnessed r fact) o
(pts_to r v)
(fun _ -> pts_t... | let witness (#o:inames)
(#a:Type)
(#pcm:pcm a)
(r:ref a pcm)
(fact:Steel.Preorder.stable_property pcm)
(v:erased a)
(_:squash (Steel.Preorder.fact_valid_compat fact v))
= P.witness r fact v () | {
"file_name": "lib/steel/Steel.GhostPCMReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 25,
"end_line": 124,
"start_col": 0,
"start_line": 117
} | (*
Copyright 2020 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": [
"Steel.Preorder.fst.checked",
"Steel.PCMReference.fsti.checked",
"Steel.Memory.fsti.checked",
"Steel.Effect.Atomic.fsti.checked",
"Steel.Effect.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.PCM.fst.checked",
"... | [
{
"abbrev": true,
"full_module": "Steel.PCMReference",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Steel.Memory",
"short_module": "Mem"
},
{
"abbrev": false,
"full_module": "Steel.Effect",
"short_module": null
},
{
"abbrev": false,
"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: Steel.GhostPCMReference.ref a pcm ->
fact: Steel.Preorder.stable_property pcm ->
v: FStar.Ghost.erased a ->
_: Prims.squash (Steel.Preorder.fact_valid_compat fact (FStar.Ghost.reveal v))
-> Steel.Effect.Atomic.SteelAtomicUT (Steel.GhostPCMReference.witnessed r fact) | Steel.Effect.Atomic.SteelAtomicUT | [] | [] | [
"Steel.Memory.inames",
"FStar.PCM.pcm",
"Steel.GhostPCMReference.ref",
"Steel.Preorder.stable_property",
"FStar.Ghost.erased",
"Prims.squash",
"Steel.Preorder.fact_valid_compat",
"FStar.Ghost.reveal",
"Steel.PCMReference.witness",
"Steel.Memory.witnessed",
"Steel.Memory.ref",
"Steel.GhostPCMRe... | [] | false | true | false | false | false | let witness
(#o: inames)
(#a: Type)
(#pcm: pcm a)
(r: ref a pcm)
(fact: Steel.Preorder.stable_property pcm)
(v: erased a)
(_: squash (Steel.Preorder.fact_valid_compat fact v))
=
| P.witness r fact v () | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.synth_deplen_data | val synth_deplen_data
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(x: parse_fldata_strong_t ps (U32.v (dlf h)))
: Tot (refine_... | val synth_deplen_data
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(x: parse_fldata_strong_t ps (U32.v (dlf h)))
: Tot (refine_... | let synth_deplen_data
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
(h : ht)
(x : parse_fldata_strong_t ps (U32.v (dlf h)))
: Tot (refine_with_tag (calc_ta... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 8,
"end_line": 84,
"start_col": 0,
"start_line": 72
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
h: ht ->
x: LowParse.Spec.FLData.parse_fldata_strong_t ps (FStar.UInt32.v (dlf h))
-> LowParse.Spec.Base.refine_with_ta... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.FLData.parse_fldata_strong_t",
"FStar.UInt32.v",
"F... | [] | false | false | false | false | false | let synth_deplen_data
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(x: parse_fldata_strong_t ps (U32.v (dlf h)))
: Tot (refine_... | (h, x) | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.serialize_deplen_payload_unfold | val serialize_deplen_payload_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(input: refine_with_tag (calc_tag_of_deplen_data m... | val serialize_deplen_payload_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(input: refine_with_tag (calc_tag_of_deplen_data m... | let serialize_deplen_payload_unfold
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
(h : ht)
(input : refine_with_tag (calc_tag_of_deplen_data min max dlf ps... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 9,
"end_line": 364,
"start_col": 0,
"start_line": 344
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
h: ht ->
input:
LowParse.Spec.Base.refine_with_tag (LowParse.Spec.DepLen.calc_tag_of_deplen_data min
ma... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.Base.refine_with_tag",
"LowParse.Spec.DepLen.parse_de... | [] | true | false | true | false | false | let serialize_deplen_payload_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(input: refine_with_tag (calc_tag_of_deplen_data m... | let sz = U32.v (dlf h) in
serialize_synth_eq (parse_fldata_strong ps sz)
(synth_deplen_data min max dlf ps h)
(serialize_fldata_strong ps sz)
(synth_deplen_data_recip min max dlf ps h)
()
input | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.serialize_deplen_unfold | val serialize_deplen_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp {hk.parser_kind_subkind == Some ParserStrong})
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt:... | val serialize_deplen_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp {hk.parser_kind_subkind == Some ParserStrong})
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt:... | let serialize_deplen_unfold
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp { hk.parser_kind_subkind == Some ParserStrong } )
(dlf: ht -> Tot (bounded_int32 min max))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 56,
"end_line": 411,
"start_col": 0,
"start_line": 386
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
hs:
LowParse.Spec.Base.serializer hp
{ Mkparser_kind'?.parser_kind_subkind hk ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) -... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__pr... | [] | true | false | true | false | false | let serialize_deplen_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp {hk.parser_kind_subkind == Some ParserStrong})
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt:... | serialize_tagged_union_eq hs
(calc_tag_of_deplen_data min max dlf ps)
(serialize_deplen_payload min max dlf ps)
input;
let h:ht = calc_tag_of_deplen_data min max dlf ps input in
serialize_deplen_payload_unfold min max dlf ps h input | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.synth_deplen_data_recip | val synth_deplen_data_recip
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(x: refine_with_tag (calc_tag_of_deplen_data min max dlf p... | val synth_deplen_data_recip
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(x: refine_with_tag (calc_tag_of_deplen_data min max dlf p... | let synth_deplen_data_recip
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
(h : ht)
(x : refine_with_tag (calc_tag_of_deplen_data min max dlf ps) h)
: Tot (... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 7,
"end_line": 309,
"start_col": 0,
"start_line": 297
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
h: ht ->
x:
LowParse.Spec.Base.refine_with_tag (LowParse.Spec.DepLen.calc_tag_of_deplen_data min
max
... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.Base.refine_with_tag",
"LowParse.Spec.DepLen.parse_de... | [] | false | false | false | false | false | let synth_deplen_data_recip
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(x: refine_with_tag (calc_tag_of_deplen_data min max dlf p... | snd x | false |
Benton2004.RHL.Examples2.fst | Benton2004.RHL.Examples2.proof | val proof: Prims.unit -> Lemma (related l r (phi ()) (phi ())) | val proof: Prims.unit -> Lemma (related l r (phi ()) (phi ())) | let proof () : Lemma
(related l r (phi ()) (phi ()))
=
let phi = phi () in
let phi1 = gand phi (geq (gvar x Right) (gop op_Addition (gvar y Right) (gconst 1))) in
let phi2 = gand phi1 (geq (gvar x Left) (gvar x Right)) in
hyp;
assert (related (assign x asx_e) skip phi1 phi2); // by r_dassl
lemma_included... | {
"file_name": "examples/rel/Benton2004.RHL.Examples2.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 56,
"start_col": 0,
"start_line": 42
} | (*
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.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked",
"Benton2004.RHL.Derived.fst.checked"
],
"interface_file": false,
"source_file": "Benton2004.RHL.Examples2.fst"
} | [
{
"abbrev": false,
"full_module": "Benton2004.RHL.Derived",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full_module": "Benton2004.RHL",
"short_module": null
},
{
"abbrev": false,
"full... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 3,
"initial_ifuel": 1,
"max_fuel": 3,
"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 | _: Prims.unit
-> FStar.Pervasives.Lemma
(ensures
Benton2004.RHL.Derived.related Benton2004.RHL.Examples2.l
Benton2004.RHL.Examples2.r
(Benton2004.RHL.Examples2.phi ())
(Benton2004.RHL.Examples2.phi ())) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.unit",
"Benton2004.RHL.Derived.d_su1'_flip",
"Benton2004.RHL.Examples2.l",
"Benton2004.assign",
"Benton2004.RHL.Examples2.x",
"Benton2004.RHL.Examples2.asx_e",
"Benton2004.while",
"Benton2004.RHL.Examples2.cond",
"Benton2004.RHL.Examples2.i",
"Benton2004.RHL.Examples2.asi_e",
"Prims._asse... | [] | true | false | true | false | false | let proof () : Lemma (related l r (phi ()) (phi ())) =
| let phi = phi () in
let phi1 = gand phi (geq (gvar x Right) (gop op_Addition (gvar y Right) (gconst 1))) in
let phi2 = gand phi1 (geq (gvar x Left) (gvar x Right)) in
hyp;
assert (related (assign x asx_e) skip phi1 phi2);
lemma_included_helper ();
assert (related (assign i asi_e) (assign i asi_e) phi2 phi2);
d_su1' (as... | false |
Normalization.fst | Normalization.add_2 | val add_2 (x: int) : int | val add_2 (x: int) : int | let add_2 (x:int) : int = _ by (normalize [primops; delta] (add_1 (add_1 x))) | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_Addition"
] | [] | false | false | false | true | false | let add_2 (x: int) : int =
| FStar.Tactics.Effect.synth_by_tactic (fun _ -> (normalize [primops; delta] (add_1 (add_1 x)))) | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.serialize_deplen_payload | val serialize_deplen_payload
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
: Tot (serializer (parse_deplen_payload min max dlf ps h)) | val serialize_deplen_payload
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
: Tot (serializer (parse_deplen_payload min max dlf ps h)) | let serialize_deplen_payload
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
(h : ht)
: Tot (serializer (parse_deplen_payload min max dlf ps h))
= let sz = U32... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 7,
"end_line": 340,
"start_col": 0,
"start_line": 311
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
h: ht
-> LowParse.Spec.Base.serializer (LowParse.Spec.DepLen.parse_deplen_payload min max dlf ps h) | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Spec.Combinators.fail_serializer",
"LowParse.Spec.DepLen.p... | [] | false | false | false | false | false | let serialize_deplen_payload
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
: Tot (serializer (parse_deplen_payload min max dlf ps h)) ... | let sz = U32.v (dlf h) in
let bounds_off =
pk.parser_kind_low > sz ||
(match pk.parser_kind_high with
| None -> false
| Some pkmax -> pkmax < sz)
in
if bounds_off
then
fail_serializer (parse_deplen_payload_kind min max pk)
(refine_with_tag (calc_tag_of_deplen_data min max dlf ps) h)
(fun _ -> ())
... | false |
Normalization.fst | Normalization.normalize | val normalize (#t: Type) (steps: list norm_step) (x: t) : Tac unit | val normalize (#t: Type) (steps: list norm_step) (x: t) : Tac unit | let normalize (#t:Type) (steps : list norm_step) (x:t) : Tac unit =
dup ();
exact (quote x);
norm steps;
trefl () | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 10,
"end_line": 28,
"start_col": 0,
"start_line": 24
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | steps: Prims.list FStar.Pervasives.norm_step -> x: t -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.list",
"FStar.Pervasives.norm_step",
"FStar.Tactics.V2.Derived.trefl",
"Prims.unit",
"FStar.Stubs.Tactics.V2.Builtins.norm",
"FStar.Tactics.V2.Derived.exact",
"FStar.Tactics.NamedView.term",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Tactics.V2.Builtins.dup"
] | [] | false | true | false | false | false | let normalize (#t: Type) (steps: list norm_step) (x: t) : Tac unit =
| dup ();
exact (quote x);
norm steps;
trefl () | false |
Normalization.fst | Normalization.add_1 | val add_1 (x: int) : int | val add_1 (x: int) : int | let add_1 (x:int) : int = x + 1 | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 50,
"start_col": 0,
"start_line": 50
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_Addition"
] | [] | false | false | false | true | false | let add_1 (x: int) : int =
| x + 1 | false |
Normalization.fst | Normalization.four | val four:int | val four:int | let four : int = _ by (normalize [primops; delta] (add_2 2)) | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 60,
"end_line": 56,
"start_col": 0,
"start_line": 56
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | Prims.int | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let four:int =
| FStar.Tactics.Effect.synth_by_tactic (fun _ -> (normalize [primops; delta] (add_2 2))) | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.serialize_deplen | val serialize_deplen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp {hk.parser_kind_subkind == Some ParserStrong})
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
... | val serialize_deplen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp {hk.parser_kind_subkind == Some ParserStrong})
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
... | let serialize_deplen
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp { hk.parser_kind_subkind == Some ParserStrong } )
(dlf: ht -> Tot (bounded_int32 min max))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: se... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 45,
"end_line": 382,
"start_col": 0,
"start_line": 366
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
hs:
LowParse.Spec.Base.serializer hp
{ Mkparser_kind'?.parser_kind_subkind hk ==
FStar.Pervasives.Native.Some LowParse.Spec.Base.ParserStrong } ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) -... | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"LowParse.Spec.Base.parser_subkind",
"LowParse.Spec.Base.__pr... | [] | false | false | false | false | false | let serialize_deplen
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(#hp: parser hk ht)
(hs: serializer hp {hk.parser_kind_subkind == Some ParserStrong})
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
... | serialize_tagged_union hs
(calc_tag_of_deplen_data min max dlf ps)
(serialize_deplen_payload min max dlf ps) | false |
Normalization.fst | Normalization.does_not_normalize | val does_not_normalize (#t: Type) (x: t) : t | val does_not_normalize (#t: Type) (x: t) : t | let does_not_normalize (#t:Type) (x:t) : t =
_ by (normalize [primops; delta] x) | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 37,
"end_line": 95,
"start_col": 0,
"start_line": 94
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: t -> t | Prims.Tot | [
"total"
] | [] | [] | [] | false | false | false | true | false | let does_not_normalize (#t: Type) (x: t) : t =
| FStar.Tactics.Effect.synth_by_tactic (fun _ -> (normalize [primops; delta] x)) | false |
Normalization.fst | Normalization.four'' | val four'':int | val four'':int | let four'' : int = does_not_normalize (2+2) | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 43,
"end_line": 97,
"start_col": 0,
"start_line": 97
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | Prims.int | Prims.Tot | [
"total"
] | [] | [
"Normalization.does_not_normalize",
"Prims.int",
"Prims.op_Addition"
] | [] | false | false | false | true | false | let four'':int =
| does_not_normalize (2 + 2) | false |
QuickSort.Array.fst | QuickSort.Array.sort | val sort: #a:eqtype -> f:tot_ord a -> i:nat -> j:nat{i <= j} -> x:array a
-> ST unit
(requires (fun h -> Array.contains h x /\ j <= length (Array.sel h x)))
(ensures (fun h0 u h1 -> (modifies (Array.only x) h0 h1
/\ j <= length (Array.sel h0 x) ... | val sort: #a:eqtype -> f:tot_ord a -> i:nat -> j:nat{i <= j} -> x:array a
-> ST unit
(requires (fun h -> Array.contains h x /\ j <= length (Array.sel h x)))
(ensures (fun h0 u h1 -> (modifies (Array.only x) h0 h1
/\ j <= length (Array.sel h0 x) ... | let rec sort #a f i j x =
let h0 = ST.get () in
if i=j
then splice_refl (Array.sel h0 x) i j
else begin
let pivot = partition f i j i (j - 1) x in
(* ghost *) let h1 = get() in
sort f i pivot x;
(* ghost *) let h2 = get() in
let _ =
(* ghost *) lemma_seq_frame... | {
"file_name": "examples/algorithms/QuickSort.Array.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 5,
"end_line": 188,
"start_col": 0,
"start_line": 155
} | (*
Copyright 2008-2014 Nikhil Swamy and 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 appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.ST.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Heap.fst.checked",
"FStar.Array.fsti.checked"
],
"interface_file": false,
"source_file": "QuickSort.Array.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.Array",
"short_module": "Array"
},
{
"abbrev": false,
"full_module": "FStar.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Hea... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 1,
"initial_ifuel": 0,
"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 | f: FStar.Seq.Properties.tot_ord a -> i: Prims.nat -> j: Prims.nat{i <= j} -> x: FStar.Array.array a
-> FStar.ST.ST Prims.unit | FStar.ST.ST | [] | [] | [
"Prims.eqtype",
"FStar.Seq.Properties.tot_ord",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Array.array",
"Prims.op_Equality",
"FStar.Seq.Properties.splice_refl",
"FStar.Array.sel",
"Prims.unit",
"Prims.bool",
"FStar.Seq.Properties.lemma_weaken_perm_left",
"Prims.op_Addition... | [
"recursion"
] | false | true | false | false | false | let rec sort #a f i j x =
| let h0 = ST.get () in
if i = j
then splice_refl (Array.sel h0 x) i j
else
let pivot = partition f i j i (j - 1) x in
let h1 = get () in
sort f i pivot x;
let h2 = get () in
let _ =
lemma_seq_frame_hi (Array.sel h2 x) (Array.sel h1 x) i pivot pivot j;
lemma_tail_slice (Array.sel h2 x) pivot j
in
so... | false |
Normalization.fst | Normalization.unfold_add_1 | val unfold_add_1:norm_step | val unfold_add_1:norm_step | let unfold_add_1: norm_step = delta_only ["Normalization.add_1"] | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 64,
"end_line": 81,
"start_col": 0,
"start_line": 81
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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.Pervasives.norm_step | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.delta_only",
"Prims.Cons",
"Prims.string",
"Prims.Nil"
] | [] | false | false | false | true | false | let unfold_add_1:norm_step =
| delta_only ["Normalization.add_1"] | false |
Normalization.fst | Normalization.three | val three:int | val three:int | let three : int = _ by (normalize [delta; unfold_add_1; primops] (add_2 (add_1 0))) | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 83,
"end_line": 83,
"start_col": 0,
"start_line": 83
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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 | Prims.int | Prims.Tot | [
"total"
] | [] | [
"Normalization.add_2"
] | [] | false | false | false | true | false | let three:int =
| FStar.Tactics.Effect.synth_by_tactic (fun _ ->
(normalize [delta; unfold_add_1; primops] (add_2 (add_1 0)))) | false |
Hacl.Impl.RSAPSS.fst | Hacl.Impl.RSAPSS.rsapss_sign_msg_to_bn_st | val rsapss_sign_msg_to_bn_st : t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Hacl.Impl.RSAPSS.modBits_t t
-> Type0 | let rsapss_sign_msg_to_bn_st (t:limb_t) (a:Hash.hash_alg{S.hash_is_supported a}) (modBits:modBits_t t) =
let len = blocks modBits (size (bits t)) in
saltLen:size_t
-> salt:lbuffer uint8 saltLen
-> msgLen:size_t
-> msg:lbuffer uint8 msgLen
-> m:lbignum t len ->
Stack unit
(requires fun h ->
live h ... | {
"file_name": "code/rsapss/Hacl.Impl.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 114,
"end_line": 104,
"start_col": 0,
"start_line": 90
} | module Hacl.Impl.RSAPSS
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module Hash = Spec.Agile.Hash
module SB = Hacl.Spec.Bignum
module BB = Hacl.Spec.Bignum.Base
module SD = Hacl.Spec.Bignum.Definitions
... | {
"checked_file": "/",
"dependencies": [
"Spec.RSAPSS.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.RSAPSS.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Keys",
"short_module": "RK"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.MGF",
"short_module": "RM"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Padding",
"short_module": "RP"
},
{
"abbrev": true... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Hacl.Impl.RSAPSS.modBits_t t
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Hacl.Impl.RSAPSS.modBits_t",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.Bignum.Definitions.lbignum",
"Prims.unit",
"FStar.Monotonic.HyperStack.mem",
... | [] | false | false | false | false | true | let rsapss_sign_msg_to_bn_st
(t: limb_t)
(a: Hash.hash_alg{S.hash_is_supported a})
(modBits: modBits_t t)
=
| let len = blocks modBits (size (bits t)) in
saltLen: size_t ->
salt: lbuffer uint8 saltLen ->
msgLen: size_t ->
msg: lbuffer uint8 msgLen ->
m: lbignum t len
-> Stack unit
(requires
fun h ->
live h salt /\ live h msg /\ live h m /\ disjoint salt msg /\ disjoint m msg /\
... | false | |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.parse_deplen_unfold | val parse_deplen_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
(input: byte... | val parse_deplen_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
(input: byte... | let parse_deplen_unfold
(min: nat)
(max: nat { min <= max /\ max < 4294967296 } )
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: ht -> Tot (bounded_int32 min max))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
(input : bytes)
: Lemma
(parse (parse_deplen min max... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 60,
"end_line": 243,
"start_col": 0,
"start_line": 198
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
hp: LowParse.Spec.Base.parser hk ht ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
input: LowParse.Bytes.bytes
-> FStar.Pervasives.Lemma
(ensures
LowPars... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.serializer",
"LowParse.Bytes.bytes",
"LowParse.Spec.Base.parse",
"LowParse.Spec... | [] | false | false | true | false | false | let parse_deplen_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#hk: parser_kind)
(#ht: Type)
(hp: parser hk ht)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pt: Type)
(#pp: parser pk pt)
(ps: serializer pp)
(input: byte... | parse_tagged_union_eq hp
(calc_tag_of_deplen_data min max dlf ps)
(parse_deplen_payload min max dlf ps)
input;
match parse hp input with
| None -> ()
| Some (h, consumed) ->
let input' = Seq.slice input consumed (Seq.length input) in
parse_deplen_payload_unfold min max dlf ps h input';
let sz = (U32.v (dlf ... | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.empty_decreaser | val empty_decreaser (#a: Type u#a) (x: a) : Tot (acc_classical (empty_relation #a) x) (decreases x) | val empty_decreaser (#a: Type u#a) (x: a) : Tot (acc_classical (empty_relation #a) x) (decreases x) | let rec empty_decreaser (#a: Type u#a) (x: a)
: Tot (acc_classical (empty_relation #a) x) (decreases x) =
let smaller (y: a{empty_relation y x}) : acc_classical (empty_relation #a) y =
empty_decreaser y
in
AccClassicalIntro smaller | {
"file_name": "ulib/FStar.WellFoundedRelation.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": 42
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a
-> Prims.Tot (FStar.WellFoundedRelation.acc_classical FStar.WellFoundedRelation.empty_relation x) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFoundedRelation.AccClassicalIntro",
"FStar.WellFoundedRelation.empty_relation",
"FStar.WellFoundedRelation.acc_classical",
"FStar.WellFoundedRelation.empty_decreaser"
] | [
"recursion"
] | false | false | false | false | false | let rec empty_decreaser (#a: Type u#a) (x: a)
: Tot (acc_classical (empty_relation #a) x) (decreases x) =
| let smaller (y: a{empty_relation y x}) : acc_classical (empty_relation #a) y = empty_decreaser y in
AccClassicalIntro smaller | false |
LowParse.Spec.DepLen.fst | LowParse.Spec.DepLen.parse_deplen_payload_unfold | val parse_deplen_payload_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(input: bytes)
: Lemma
(parse (parse_deplen_pa... | val parse_deplen_payload_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(input: bytes)
: Lemma
(parse (parse_deplen_pa... | let parse_deplen_payload_unfold
(min : nat)
(max : nat { min <= max /\ max < 4294967296 } )
(#ht : Type)
(#pt : Type)
(dlf : ht -> Tot (bounded_int32 min max) )
(#pk : parser_kind)
(#pp : parser pk pt)
(ps : serializer pp)
(h : ht)
(input: bytes)
: Lemma
(parse (parse_deplen_payload min max dlf ps... | {
"file_name": "src/lowparse/LowParse.Spec.DepLen.fst",
"git_rev": "00217c4a89f5ba56002ba9aa5b4a9d5903bfe9fa",
"git_url": "https://github.com/project-everest/everparse.git",
"project_name": "everparse"
} | {
"end_col": 12,
"end_line": 157,
"start_col": 0,
"start_line": 128
} | module LowParse.Spec.DepLen
(* LowParse specification module for parsing structures with dependent length
Example:
struct {
uint len;
uint foo;
uint buf[len];
};
*)
include LowParse.Spec.Combinators
include LowParse.Spec.AllIntegers
include LowParse.Spec.VLGen
module U32 = FStar.UInt32
mod... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"LowParse.Spec.VLGen.fst.checked",
"LowParse.Spec.Combinators.fsti.checked",
"LowParse.Spec.AllIntegers.fst.checked",
"FStar.UInt32.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Perv... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": true,
"full_module": "FStar.UInt32",
"short_module": "U32"
},
{
"abbrev": false,
"full_module": "LowParse.Spec.VLGen",
"short_module": null
},
{
"abbrev": false,
"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 |
min: Prims.nat ->
max: Prims.nat{min <= max /\ max < 4294967296} ->
dlf: (_: ht -> LowParse.Spec.BoundedInt.bounded_int32 min max) ->
ps: LowParse.Spec.Base.serializer pp ->
h: ht ->
input: LowParse.Bytes.bytes
-> FStar.Pervasives.Lemma
(ensures
LowParse.Spec.Base.parse (LowParse.Sp... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"LowParse.Spec.BoundedInt.bounded_int32",
"LowParse.Spec.Base.parser_kind",
"LowParse.Spec.Base.parser",
"LowParse.Spec.Base.serializer",
"LowParse.Bytes.bytes",
"Prims.bool",
"LowParse.Spec.Combinators.p... | [] | false | false | true | false | false | let parse_deplen_payload_unfold
(min: nat)
(max: nat{min <= max /\ max < 4294967296})
(#ht #pt: Type)
(dlf: (ht -> Tot (bounded_int32 min max)))
(#pk: parser_kind)
(#pp: parser pk pt)
(ps: serializer pp)
(h: ht)
(input: bytes)
: Lemma
(parse (parse_deplen_pa... | let sz = (U32.v (dlf h)) in
let bounds_off =
pk.parser_kind_low > sz ||
(match pk.parser_kind_high with
| None -> false
| Some pkmax -> pkmax < sz)
in
if bounds_off
then ()
else parse_synth_eq (parse_fldata_strong ps sz) (synth_deplen_data min max dlf ps h) input | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.default_decreaser | val default_decreaser (#a: Type u#a) (x: a)
: Tot (acc_classical (default_relation #a) x) (decreases x) | val default_decreaser (#a: Type u#a) (x: a)
: Tot (acc_classical (default_relation #a) x) (decreases x) | let rec default_decreaser (#a: Type u#a) (x: a)
: Tot (acc_classical (default_relation #a) x) (decreases x) =
let smaller (y: a{default_relation y x}) : acc_classical (default_relation #a) y =
default_decreaser y
in
AccClassicalIntro smaller | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 32,
"start_col": 0,
"start_line": 27
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: a
-> Prims.Tot
(FStar.WellFoundedRelation.acc_classical FStar.WellFoundedRelation.default_relation x) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFoundedRelation.AccClassicalIntro",
"FStar.WellFoundedRelation.default_relation",
"FStar.WellFoundedRelation.acc_classical",
"FStar.WellFoundedRelation.default_decreaser"
] | [
"recursion"
] | false | false | false | false | false | let rec default_decreaser (#a: Type u#a) (x: a)
: Tot (acc_classical (default_relation #a) x) (decreases x) =
| let smaller (y: a{default_relation y x}) : acc_classical (default_relation #a) y =
default_decreaser y
in
AccClassicalIntro smaller | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.default_wfr | val default_wfr (a: Type u#a) : (wfr: wfr_t a{wfr.relation == default_relation}) | val default_wfr (a: Type u#a) : (wfr: wfr_t a{wfr.relation == default_relation}) | let default_wfr (a: Type u#a) : (wfr: wfr_t a{wfr.relation == default_relation}) =
let proof (x1: a) (x2: a)
: Lemma (requires default_relation x1 x2)
(ensures default_decreaser x1 << default_decreaser x2) =
assert ((default_decreaser x2).access_smaller x1 == default_decreaser x1)
in
{ relatio... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 80,
"end_line": 40,
"start_col": 0,
"start_line": 34
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"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 | a: Type
-> wfr:
FStar.WellFoundedRelation.wfr_t a
{Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.default_relation} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFoundedRelation.Mkwfr_t",
"FStar.WellFoundedRelation.default_relation",
"FStar.WellFoundedRelation.default_decreaser",
"Prims.unit",
"Prims.squash",
"Prims.precedes",
"FStar.WellFoundedRelation.acc_classical",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Prims._assert",
"Prims.eq2",
"F... | [] | false | false | false | false | false | let default_wfr (a: Type u#a) : (wfr: wfr_t a {wfr.relation == default_relation}) =
| let proof (x1 x2: a)
: Lemma (requires default_relation x1 x2) (ensures default_decreaser x1 << default_decreaser x2)
=
assert ((default_decreaser x2).access_smaller x1 == default_decreaser x1)
in
{ relation = default_relation; decreaser = default_decreaser; proof = proof } | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.empty_wfr | val empty_wfr (a: Type u#a) : (wfr: wfr_t a{wfr.relation == empty_relation}) | val empty_wfr (a: Type u#a) : (wfr: wfr_t a{wfr.relation == empty_relation}) | let empty_wfr (a: Type u#a) : (wfr: wfr_t a{wfr.relation == empty_relation}) =
let proof (x1: a) (x2: a)
: Lemma (requires empty_relation x1 x2) (ensures empty_decreaser x1 << empty_decreaser x2) =
assert ((empty_decreaser x2).access_smaller x1 == empty_decreaser x1)
in
{ relation = empty_relation; decrea... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 76,
"end_line": 54,
"start_col": 0,
"start_line": 49
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"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 | a: Type
-> wfr:
FStar.WellFoundedRelation.wfr_t a
{Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.empty_relation} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFoundedRelation.Mkwfr_t",
"FStar.WellFoundedRelation.empty_relation",
"FStar.WellFoundedRelation.empty_decreaser",
"Prims.unit",
"Prims.squash",
"Prims.precedes",
"FStar.WellFoundedRelation.acc_classical",
"Prims.Nil",
"FStar.Pervasives.pattern",
"Prims._assert",
"Prims.eq2",
"FStar... | [] | false | false | false | false | false | let empty_wfr (a: Type u#a) : (wfr: wfr_t a {wfr.relation == empty_relation}) =
| let proof (x1 x2: a)
: Lemma (requires empty_relation x1 x2) (ensures empty_decreaser x1 << empty_decreaser x2) =
assert ((empty_decreaser x2).access_smaller x1 == empty_decreaser x1)
in
{ relation = empty_relation; decreaser = empty_decreaser; proof = proof } | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.acc_decreaser | val acc_decreaser
(#a: Type u#a)
(r: (a -> a -> Type0))
(f: WF.well_founded r {forall x1 x2 (p: r x1 x2). (f x2).access_smaller x1 p == f x1})
(x: a)
: Tot (acc_classical (acc_relation r) x) (decreases (f x)) | val acc_decreaser
(#a: Type u#a)
(r: (a -> a -> Type0))
(f: WF.well_founded r {forall x1 x2 (p: r x1 x2). (f x2).access_smaller x1 p == f x1})
(x: a)
: Tot (acc_classical (acc_relation r) x) (decreases (f x)) | let rec acc_decreaser
(#a: Type u#a)
(r: a -> a -> Type0)
(f: WF.well_founded r{forall x1 x2 (p: r x1 x2). (f x2).access_smaller x1 p == f x1})
(x: a)
: Tot (acc_classical (acc_relation r) x) (decreases (f x)) =
let smaller (y: a{(acc_relation r) y x}) : (acc_classical (acc_relation r) y) = (
eliminate ... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 68,
"start_col": 0,
"start_line": 56
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: (_: a -> _: a -> Type0) ->
f:
FStar.WellFounded.well_founded r
{forall (x1: a) (x2: a) (p: r x1 x2). AccIntro?.access_smaller (f x2) x1 p == f x1} ->
x: a
-> Prims.Tot
(FStar.WellFoundedRelation.acc_classical (FStar.WellFoundedRelation.acc_relation r) x) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFounded.well_founded",
"Prims.l_Forall",
"Prims.eq2",
"FStar.WellFounded.acc",
"FStar.WellFounded.__proj__AccIntro__item__access_smaller",
"FStar.WellFoundedRelation.AccClassicalIntro",
"FStar.WellFoundedRelation.acc_relation",
"FStar.WellFoundedRelation.acc_classical",
"FStar.WellFounded... | [
"recursion"
] | false | false | false | false | false | let rec acc_decreaser
(#a: Type u#a)
(r: (a -> a -> Type0))
(f: WF.well_founded r {forall x1 x2 (p: r x1 x2). (f x2).access_smaller x1 p == f x1})
(x: a)
: Tot (acc_classical (acc_relation r) x) (decreases (f x)) =
| let smaller (y: a{(acc_relation r) y x}) : (acc_classical (acc_relation r) y) =
(eliminate exists (p: r y x).
True
returns f y << f x
with _.
assert ((f x).access_smaller y p == f y);
acc_decreaser r f y)
in
AccClassicalIntro smaller | false |
Hacl.Impl.RSAPSS.fst | Hacl.Impl.RSAPSS.rsapss_verify_bn_to_msg_st | val rsapss_verify_bn_to_msg_st : t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Hacl.Impl.RSAPSS.modBits_t t
-> Type0 | let rsapss_verify_bn_to_msg_st (t:limb_t) (a:Hash.hash_alg{S.hash_is_supported a}) (modBits:modBits_t t) =
saltLen:size_t
-> msgLen:size_t
-> msg:lbuffer uint8 msgLen
-> m:lbignum t (blocks modBits (size (bits t))) ->
Stack bool
(requires fun h ->
live h msg /\ live h m /\ disjoint m msg /\
LS.rs... | {
"file_name": "code/rsapss/Hacl.Impl.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 103,
"end_line": 353,
"start_col": 0,
"start_line": 342
} | module Hacl.Impl.RSAPSS
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module Hash = Spec.Agile.Hash
module SB = Hacl.Spec.Bignum
module BB = Hacl.Spec.Bignum.Base
module SD = Hacl.Spec.Bignum.Definitions
... | {
"checked_file": "/",
"dependencies": [
"Spec.RSAPSS.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.RSAPSS.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Keys",
"short_module": "RK"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.MGF",
"short_module": "RM"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Padding",
"short_module": "RP"
},
{
"abbrev": true... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
t: Hacl.Bignum.Definitions.limb_t ->
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Hacl.Impl.RSAPSS.modBits_t t
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Hacl.Impl.RSAPSS.modBits_t",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Lib.IntTypes.uint8",
"Hacl.Bignum.Definitions.lbignum",
"Hacl.Bignum.Definitions.blocks",
"Lib.IntTypes.si... | [] | false | false | false | false | true | let rsapss_verify_bn_to_msg_st
(t: limb_t)
(a: Hash.hash_alg{S.hash_is_supported a})
(modBits: modBits_t t)
=
|
saltLen: size_t ->
msgLen: size_t ->
msg: lbuffer uint8 msgLen ->
m: lbignum t (blocks modBits (size (bits t)))
-> Stack bool
(requires
fun h ->
live h msg /\ live h m /\ disjoint m msg /\
LS.rsapss_verify_pre a (v saltLen) (v msgLen) (as_seq h msg))
(ensures
... | false | |
Normalization.fst | Normalization.def_of | val def_of (#t: Type) (x: t) : Tac term | val def_of (#t: Type) (x: t) : Tac term | let def_of (#t:Type) (x:t) : Tac term =
let e = cur_env () in
let t = quote x in
match inspect t with
| Tv_UInst fv _
| Tv_FVar fv -> begin
let se = match lookup_typ e (inspect_fv fv) with
| None -> fail "Not found..?"
| Some se -> se
in
match inspect_sigelt se with
|... | {
"file_name": "examples/tactics/Normalization.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 48,
"start_col": 0,
"start_line": 31
} | (*
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.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Order.fst.checked"
],
"interface_file": false,
"source_file": "Normalization.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Prims",
"short_module": null
},
{
"abbrev": false,
"full_module": "FS... | {
"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: t -> FStar.Tactics.Effect.Tac FStar.Tactics.NamedView.term | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.fv",
"FStar.Stubs.Reflection.V2.Data.universes",
"Prims.bool",
"Prims.list",
"FStar.Tactics.NamedView.letbinding",
"FStar.Tactics.NamedView.__proj__Mkletbinding__item__lb_def",
"FStar.Tactics.NamedView.term",
"FStar.Tactics.V2.SyntaxHelpers.lookup_lb",
"FStar.Stubs.Refl... | [] | false | true | false | false | false | let def_of (#t: Type) (x: t) : Tac term =
| let e = cur_env () in
let t = quote x in
match inspect t with
| Tv_UInst fv _
| Tv_FVar fv ->
let se =
match lookup_typ e (inspect_fv fv) with
| None -> fail "Not found..?"
| Some se -> se
in
(match inspect_sigelt se with
| Sg_Let { lbs = lbs } ->
let lbv = lookup_lb lbs (inspect_fv fv) in
... | false |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.t64_no_mod | val t64_no_mod : Vale.Interop.Base.td | let t64_no_mod = TD_Buffer TUInt64 TUInt64 ({modified=false; strict_disjointness=false; taint=MS.Secret}) | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 105,
"end_line": 38,
"start_col": 0,
"start_line": 38
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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 | Vale.Interop.Base.td | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Base.TD_Buffer",
"Vale.Arch.HeapTypes_s.TUInt64",
"Vale.Interop.Base.Mkbuffer_qualifiers",
"Vale.Arch.HeapTypes_s.Secret"
] | [] | false | false | false | true | false | let t64_no_mod =
| TD_Buffer TUInt64 TUInt64 ({ modified = false; strict_disjointness = false; taint = MS.Secret }) | false | |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.add1_xmms_modified | val add1_xmms_modified : _: _ -> Prims.bool | let add1_xmms_modified = fun _ -> false | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 77,
"start_col": 0,
"start_line": 77
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool"
] | [] | false | false | false | true | false | let add1_xmms_modified =
| fun _ -> false | false | |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.uint64 | val uint64 : Prims.eqtype | let uint64 = UInt64.t | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 21,
"end_line": 27,
"start_col": 0,
"start_line": 27
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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.eqtype | Prims.Tot | [
"total"
] | [] | [
"FStar.UInt64.t"
] | [] | false | false | false | true | false | let uint64 =
| UInt64.t | false | |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.tuint64 | val tuint64 : Vale.Interop.Base.td | let tuint64 = TD_Base TUInt64 | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 29,
"end_line": 40,
"start_col": 0,
"start_line": 40
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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 | Vale.Interop.Base.td | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Base.TD_Base",
"Vale.Arch.HeapTypes_s.TUInt64"
] | [] | false | false | false | true | false | let tuint64 =
| TD_Base TUInt64 | false | |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.of_reg | val of_reg (r: MS.reg_64) : option (IX64.reg_nat 3) | val of_reg (r: MS.reg_64) : option (IX64.reg_nat 3) | let of_reg (r:MS.reg_64) : option (IX64.reg_nat 3) = match r with
| 5 -> Some 0 // rdi
| 4 -> Some 1 // rsi
| 3 -> Some 2 // rdx
| _ -> None | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 13,
"end_line": 115,
"start_col": 0,
"start_line": 111
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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 | r: Vale.X64.Machine_s.reg_64 -> FStar.Pervasives.Native.option (Vale.Interop.X64.reg_nat 3) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Machine_s.reg_64",
"FStar.Pervasives.Native.Some",
"Vale.Interop.X64.reg_nat",
"Prims.int",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | false | false | let of_reg (r: MS.reg_64) : option (IX64.reg_nat 3) =
| match r with
| 5 -> Some 0
| 4 -> Some 1
| 3 -> Some 2
| _ -> None | false |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.b64 | val b64 : Type0 | let b64 = buf_t TUInt64 TUInt64 | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 31,
"end_line": 34,
"start_col": 0,
"start_line": 34
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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 | Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Base.buf_t",
"Vale.Arch.HeapTypes_s.TUInt64"
] | [] | false | false | false | true | true | let b64 =
| buf_t TUInt64 TUInt64 | false | |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.acc_to_wfr | val acc_to_wfr (#a: Type u#a) (r: a -> a -> Type0) (f: FStar.WellFounded.well_founded r)
: (wfr: wfr_t a{wfr.relation == acc_relation r}) | val acc_to_wfr (#a: Type u#a) (r: a -> a -> Type0) (f: FStar.WellFounded.well_founded r)
: (wfr: wfr_t a{wfr.relation == acc_relation r}) | let acc_to_wfr (#a: Type u#a) (r: WF.binrel u#a u#0 a) (f: WF.well_founded r)
: (wfr: wfr_t a{wfr.relation == acc_relation r}) =
let f = eta_expand_well_founded r f in
let proof (x1: a) (x2: a)
: Lemma (requires acc_relation r x1 x2)
(ensures acc_decreaser r f x1 << acc_decreaser r f x2) =
ass... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 78,
"end_line": 86,
"start_col": 0,
"start_line": 78
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: (_: a -> _: a -> Type0) -> f: FStar.WellFounded.well_founded r
-> wfr:
FStar.WellFoundedRelation.wfr_t a
{Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.acc_relation r} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFounded.binrel",
"FStar.WellFounded.well_founded",
"FStar.WellFoundedRelation.Mkwfr_t",
"FStar.WellFoundedRelation.acc_relation",
"FStar.WellFoundedRelation.acc_decreaser",
"Prims.unit",
"Prims.squash",
"Prims.precedes",
"FStar.WellFoundedRelation.acc_classical",
"Prims.Nil",
"FStar.P... | [] | false | false | false | false | false | let acc_to_wfr (#a: Type u#a) (r: WF.binrel u#a u#0 a) (f: WF.well_founded r)
: (wfr: wfr_t a {wfr.relation == acc_relation r}) =
| let f = eta_expand_well_founded r f in
let proof (x1 x2: a)
: Lemma (requires acc_relation r x1 x2) (ensures acc_decreaser r f x1 << acc_decreaser r f x2) =
assert ((acc_decreaser r f x2).access_smaller x1 == acc_decreaser r f x1)
in
{ relation = acc_relation r; decreaser = acc_decreaser r f; proof = proof } | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.subrelation_to_wfr | val subrelation_to_wfr (#a: Type u#a) (r: a -> a -> Type0)
(wfr: wfr_t a{forall x1 x2. r x1 x2 ==> wfr.relation x1 x2})
: (wfr': wfr_t a{wfr'.relation == r}) | val subrelation_to_wfr (#a: Type u#a) (r: a -> a -> Type0)
(wfr: wfr_t a{forall x1 x2. r x1 x2 ==> wfr.relation x1 x2})
: (wfr': wfr_t a{wfr'.relation == r}) | let subrelation_to_wfr (#a: Type u#a) (r: a -> a -> Type0)
(wfr: wfr_t a{forall x1 x2. r x1 x2 ==> wfr.relation x1 x2})
: (wfr': wfr_t a{wfr'.relation == r}) =
let proof (x1: a) (x2: a)
: Lemma (requires r x1 x2)
(ensures subrelation_decreaser r wfr x1 << subrelation_decreas... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 75,
"end_line": 104,
"start_col": 0,
"start_line": 96
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: (_: a -> _: a -> Type0) ->
wfr:
FStar.WellFoundedRelation.wfr_t a
{forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr x1 x2}
-> wfr': FStar.WellFoundedRelation.wfr_t a {Mkwfr_t?.relation wfr' == r} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.WellFoundedRelation.__proj__Mkwfr_t__item__relation",
"FStar.WellFoundedRelation.Mkwfr_t",
"FStar.WellFoundedRelation.subrelation_decreaser",
"Prims.unit",
"Prims.squash",
"Prims.precedes",
"FStar.WellFoundedRelation.acc_cl... | [] | false | false | false | false | false | let subrelation_to_wfr
(#a: Type u#a)
(r: (a -> a -> Type0))
(wfr: wfr_t a {forall x1 x2. r x1 x2 ==> wfr.relation x1 x2})
: (wfr': wfr_t a {wfr'.relation == r}) =
| let proof (x1 x2: a)
: Lemma (requires r x1 x2)
(ensures subrelation_decreaser r wfr x1 << subrelation_decreaser r wfr x2) =
assert ((subrelation_decreaser r wfr x2).access_smaller x1 == subrelation_decreaser r wfr x1)
in
{ relation = r; decreaser = subrelation_decreaser r wfr; proof = proof } | false |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.code_add1 | val code_add1 : Vale.X64.Decls.va_code | let code_add1 = FU.va_code_Fast_add1 () | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 109,
"start_col": 0,
"start_line": 109
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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 | Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.Curve25519.X64.FastUtil.va_code_Fast_add1"
] | [] | false | false | false | true | false | let code_add1 =
| FU.va_code_Fast_add1 () | false | |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.t64_mod | val t64_mod : Vale.Interop.Base.td | let t64_mod = TD_Buffer TUInt64 TUInt64 default_bq | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 36,
"start_col": 0,
"start_line": 36
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastUtil",
"short_module": "FU"
},
... | {
"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 | Vale.Interop.Base.td | Prims.Tot | [
"total"
] | [] | [
"Vale.Interop.Base.TD_Buffer",
"Vale.Arch.HeapTypes_s.TUInt64",
"Vale.Interop.Base.default_bq"
] | [] | false | false | false | true | false | let t64_mod =
| TD_Buffer TUInt64 TUInt64 default_bq | false | |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.subrelation_decreaser | val subrelation_decreaser
(#a: Type u#a)
(r: (a -> a -> Type0))
(wfr: wfr_t a {forall x1 x2. r x1 x2 ==> wfr.relation x1 x2})
(x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser x) | val subrelation_decreaser
(#a: Type u#a)
(r: (a -> a -> Type0))
(wfr: wfr_t a {forall x1 x2. r x1 x2 ==> wfr.relation x1 x2})
(x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser x) | let rec subrelation_decreaser (#a: Type u#a) (r: a -> a -> Type0)
(wfr: wfr_t a{forall x1 x2. r x1 x2 ==> wfr.relation x1 x2}) (x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser x) =
let smaller (y: a{r y x}) : (acc_classical r y) =
subrelation_decreaser r wfr y
in
AccCl... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 94,
"start_col": 0,
"start_line": 88
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: (_: a -> _: a -> Type0) ->
wfr:
FStar.WellFoundedRelation.wfr_t a
{forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr x1 x2} ->
x: a
-> Prims.Tot (FStar.WellFoundedRelation.acc_classical r x) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.WellFoundedRelation.__proj__Mkwfr_t__item__relation",
"FStar.WellFoundedRelation.AccClassicalIntro",
"FStar.WellFoundedRelation.acc_classical",
"FStar.WellFoundedRelation.subrelation_decreaser"
] | [
"recursion"
] | false | false | false | false | false | let rec subrelation_decreaser
(#a: Type u#a)
(r: (a -> a -> Type0))
(wfr: wfr_t a {forall x1 x2. r x1 x2 ==> wfr.relation x1 x2})
(x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser x) =
| let smaller (y: a{r y x}) : (acc_classical r y) = subrelation_decreaser r wfr y in
AccClassicalIntro smaller | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.inverse_image_to_wfr | val inverse_image_to_wfr
(#a: Type u#a)
(#b: Type u#b)
(r: a -> a -> Type0)
(f: a -> b)
(wfr: wfr_t b{forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
: (wfr': wfr_t a{wfr'.relation == r}) | val inverse_image_to_wfr
(#a: Type u#a)
(#b: Type u#b)
(r: a -> a -> Type0)
(f: a -> b)
(wfr: wfr_t b{forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
: (wfr': wfr_t a{wfr'.relation == r}) | let inverse_image_to_wfr (#a: Type u#a) (#b: Type u#b) (r: a -> a -> Type0) (f: a -> b)
(wfr: wfr_t b{forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
: (wfr': wfr_t a{wfr'.relation == r}) =
let proof (x1: a) (x2: a)
: Lemma (requires r x1 x2)
(ensures inverse_image_de... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 79,
"end_line": 124,
"start_col": 0,
"start_line": 115
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: (_: a -> _: a -> Type0) ->
f: (_: a -> b) ->
wfr:
FStar.WellFoundedRelation.wfr_t b
{forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr (f x1) (f x2)}
-> wfr': FStar.WellFoundedRelation.wfr_t a {Mkwfr_t?.relation wfr' == r} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.WellFoundedRelation.__proj__Mkwfr_t__item__relation",
"FStar.WellFoundedRelation.Mkwfr_t",
"FStar.WellFoundedRelation.inverse_image_decreaser",
"Prims.unit",
"Prims.squash",
"Prims.precedes",
"FStar.WellFoundedRelation.acc_... | [] | false | false | false | false | false | let inverse_image_to_wfr
(#a: Type u#a)
(#b: Type u#b)
(r: (a -> a -> Type0))
(f: (a -> b))
(wfr: wfr_t b {forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
: (wfr': wfr_t a {wfr'.relation == r}) =
| let proof (x1 x2: a)
: Lemma (requires r x1 x2)
(ensures inverse_image_decreaser r f wfr x1 << inverse_image_decreaser r f wfr x2) =
assert ((inverse_image_decreaser r f wfr x2).access_smaller x1 ==
inverse_image_decreaser r f wfr x1)
in
{ relation = r; decreaser = inverse_image_decreaser r f wfr; pro... | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.inverse_image_decreaser | val inverse_image_decreaser
(#a: Type u#a)
(#b: Type u#b)
(r: (a -> a -> Type0))
(f: (a -> b))
(wfr: wfr_t b {forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
(x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser (f x)) | val inverse_image_decreaser
(#a: Type u#a)
(#b: Type u#b)
(r: (a -> a -> Type0))
(f: (a -> b))
(wfr: wfr_t b {forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
(x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser (f x)) | let rec inverse_image_decreaser (#a: Type u#a) (#b: Type u#b) (r: a -> a -> Type0) (f: a -> b)
(wfr: wfr_t b{forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
(x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser (f x)) =
let smaller (y: a{r y... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 113,
"start_col": 0,
"start_line": 106
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
r: (_: a -> _: a -> Type0) ->
f: (_: a -> b) ->
wfr:
FStar.WellFoundedRelation.wfr_t b
{forall (x1: a) (x2: a). r x1 x2 ==> Mkwfr_t?.relation wfr (f x1) (f x2)} ->
x: a
-> Prims.Tot (FStar.WellFoundedRelation.acc_classical r x) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.WellFoundedRelation.__proj__Mkwfr_t__item__relation",
"FStar.WellFoundedRelation.AccClassicalIntro",
"FStar.WellFoundedRelation.acc_classical",
"FStar.WellFoundedRelation.inverse_image_decreaser"
] | [
"recursion"
] | false | false | false | false | false | let rec inverse_image_decreaser
(#a: Type u#a)
(#b: Type u#b)
(r: (a -> a -> Type0))
(f: (a -> b))
(wfr: wfr_t b {forall x1 x2. r x1 x2 ==> wfr.relation (f x1) (f x2)})
(x: a)
: Tot (acc_classical r x) (decreases wfr.decreaser (f x)) =
| let smaller (y: a{r y x}) : (acc_classical r y) = inverse_image_decreaser r f wfr y in
AccClassicalIntro smaller | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.lex_nondep_wfr | val lex_nondep_wfr (#a: Type u#a) (#b: Type u#b) (wfr_a: wfr_t a) (wfr_b: wfr_t b)
: wfr: wfr_t (a * b){wfr.relation == lex_nondep_relation wfr_a wfr_b} | val lex_nondep_wfr (#a: Type u#a) (#b: Type u#b) (wfr_a: wfr_t a) (wfr_b: wfr_t b)
: wfr: wfr_t (a * b){wfr.relation == lex_nondep_relation wfr_a wfr_b} | let lex_nondep_wfr (#a: Type u#a) (#b: Type u#b) (wfr_a: wfr_t a) (wfr_b: wfr_t b)
: wfr: wfr_t (a * b){wfr.relation == lex_nondep_relation wfr_a wfr_b} =
let proof (xy1: a * b) (xy2: a * b)
: Lemma (requires lex_nondep_relation wfr_a wfr_b xy1 xy2)
(ensures lex_nondep_decreaser wfr_a wfr_b xy1 <<
... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 147,
"start_col": 0,
"start_line": 136
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"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 | wfr_a: FStar.WellFoundedRelation.wfr_t a -> wfr_b: FStar.WellFoundedRelation.wfr_t b
-> wfr:
FStar.WellFoundedRelation.wfr_t (a * b)
{Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.lex_nondep_relation wfr_a wfr_b} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"FStar.WellFoundedRelation.Mkwfr_t",
"FStar.Pervasives.Native.tuple2",
"FStar.WellFoundedRelation.lex_nondep_relation",
"FStar.WellFoundedRelation.lex_nondep_decreaser",
"Prims.unit",
"Prims.squash",
"Prims.precedes",
"FStar.WellFoundedRelation.acc_classical",
"P... | [] | false | false | false | false | false | let lex_nondep_wfr (#a: Type u#a) (#b: Type u#b) (wfr_a: wfr_t a) (wfr_b: wfr_t b)
: wfr: wfr_t (a * b) {wfr.relation == lex_nondep_relation wfr_a wfr_b} =
| let proof (xy1 xy2: a * b)
: Lemma (requires lex_nondep_relation wfr_a wfr_b xy1 xy2)
(ensures lex_nondep_decreaser wfr_a wfr_b xy1 << lex_nondep_decreaser wfr_a wfr_b xy2) =
assert ((lex_nondep_decreaser wfr_a wfr_b xy2).access_smaller xy1 ==
lex_nondep_decreaser wfr_a wfr_b xy1)
in
{
relation = le... | false |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.fadd_xmms_modified | val fadd_xmms_modified : _: _ -> Prims.bool | let fadd_xmms_modified = fun _ -> false | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 39,
"end_line": 213,
"start_col": 0,
"start_line": 213
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": false,
"full_module": "Vale.AsLowStar.MemoryHelpers",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
... | {
"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.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool"
] | [] | false | false | false | true | false | let fadd_xmms_modified =
| fun _ -> false | false | |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.add1_names | val add1_names : n: Prims.nat -> Prims.string | let add1_names (n:nat) =
match n with
| 0 -> "out"
| 1 -> "f1"
| 2 -> "f2"
| _ -> "" | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 172,
"start_col": 0,
"start_line": 167
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": false,
"full_module": "Vale.AsLowStar.MemoryHelpers",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
... | {
"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 | n: Prims.nat -> Prims.string | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.int",
"Prims.string"
] | [] | false | false | false | true | false | let add1_names (n: nat) =
| match n with
| 0 -> "out"
| 1 -> "f1"
| 2 -> "f2"
| _ -> "" | false | |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.lex_nondep_decreaser | val lex_nondep_decreaser
(#a: Type u#a)
(#b: Type u#b)
(wfr_a: wfr_t a)
(wfr_b: wfr_t b)
(xy: (a * b))
: Tot (acc_classical (lex_nondep_relation wfr_a wfr_b) xy)
(decreases %[wfr_a.decreaser (fst xy);wfr_b.decreaser (snd xy)]) | val lex_nondep_decreaser
(#a: Type u#a)
(#b: Type u#b)
(wfr_a: wfr_t a)
(wfr_b: wfr_t b)
(xy: (a * b))
: Tot (acc_classical (lex_nondep_relation wfr_a wfr_b) xy)
(decreases %[wfr_a.decreaser (fst xy);wfr_b.decreaser (snd xy)]) | let rec lex_nondep_decreaser (#a: Type u#a) (#b: Type u#b) (wfr_a: wfr_t a) (wfr_b: wfr_t b)
(xy: a * b)
: Tot (acc_classical (lex_nondep_relation wfr_a wfr_b) xy)
(decreases %[wfr_a.decreaser (fst xy); wfr_b.decreaser (snd xy)]) =
let smaller (xy': a * b{lex_nondep_relation wfr_a w... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 134,
"start_col": 0,
"start_line": 126
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"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 | wfr_a: FStar.WellFoundedRelation.wfr_t a -> wfr_b: FStar.WellFoundedRelation.wfr_t b -> xy: (a * b)
-> Prims.Tot
(FStar.WellFoundedRelation.acc_classical (FStar.WellFoundedRelation.lex_nondep_relation wfr_a
wfr_b)
xy) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"FStar.Pervasives.Native.tuple2",
"FStar.WellFoundedRelation.AccClassicalIntro",
"FStar.WellFoundedRelation.lex_nondep_relation",
"FStar.WellFoundedRelation.acc_classical",
"FStar.WellFoundedRelation.lex_nondep_decreaser"
] | [
"recursion"
] | false | false | false | false | false | let rec lex_nondep_decreaser
(#a: Type u#a)
(#b: Type u#b)
(wfr_a: wfr_t a)
(wfr_b: wfr_t b)
(xy: a * b)
: Tot (acc_classical (lex_nondep_relation wfr_a wfr_b) xy)
(decreases %[wfr_a.decreaser (fst xy);wfr_b.decreaser (snd xy)]) =
| let smaller (xy': (a * b) {lex_nondep_relation wfr_a wfr_b xy' xy})
: (acc_classical (lex_nondep_relation wfr_a wfr_b) xy') =
lex_nondep_decreaser wfr_a wfr_b xy'
in
AccClassicalIntro smaller | false |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.add1_comments | val add1_comments:list string | val add1_comments:list string | let add1_comments : list string =
["Computes the addition of four-element f1 with value in f2"; "and returns the carry (if any)"] | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 97,
"end_line": 165,
"start_col": 0,
"start_line": 164
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": false,
"full_module": "Vale.AsLowStar.MemoryHelpers",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
... | {
"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 Prims.string | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"Prims.string",
"Prims.Nil"
] | [] | false | false | false | true | false | let add1_comments:list string =
| ["Computes the addition of four-element f1 with value in f2"; "and returns the carry (if any)"] | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.bool_wfr | val bool_wfr: (wfr: wfr_t bool{wfr.relation == bool_relation}) | val bool_wfr: (wfr: wfr_t bool{wfr.relation == bool_relation}) | let bool_wfr: (wfr: wfr_t bool{wfr.relation == bool_relation}) =
inverse_image_to_wfr #bool #nat bool_relation (fun b -> if b then 1 else 0) (default_wfr nat) | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 95,
"end_line": 174,
"start_col": 0,
"start_line": 173
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"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 | wfr:
FStar.WellFoundedRelation.wfr_t Prims.bool
{Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.bool_relation} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFoundedRelation.inverse_image_to_wfr",
"Prims.bool",
"Prims.nat",
"FStar.WellFoundedRelation.bool_relation",
"FStar.WellFoundedRelation.default_wfr",
"FStar.WellFoundedRelation.wfr_t",
"Prims.eq2",
"FStar.WellFoundedRelation.__proj__Mkwfr_t__item__relation"
] | [] | false | false | false | false | false | let bool_wfr:(wfr: wfr_t bool {wfr.relation == bool_relation}) =
| inverse_image_to_wfr #bool #nat bool_relation (fun b -> if b then 1 else 0) (default_wfr nat) | false |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.lex_dep_decreaser | val lex_dep_decreaser
(#a: Type u#a)
(#b: (a -> Type u#b))
(wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x)))
(xy: (x: a & b x))
: Tot (acc_classical (lex_dep_relation wfr_a a_to_wfr_b) xy)
(decreases %[wfr_a.decreaser (dfst xy);(a_to_wfr_b (dfst xy)).decreaser (dsnd xy)]) | val lex_dep_decreaser
(#a: Type u#a)
(#b: (a -> Type u#b))
(wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x)))
(xy: (x: a & b x))
: Tot (acc_classical (lex_dep_relation wfr_a a_to_wfr_b) xy)
(decreases %[wfr_a.decreaser (dfst xy);(a_to_wfr_b (dfst xy)).decreaser (dsnd xy)]) | let rec lex_dep_decreaser (#a: Type u#a) (#b: a -> Type u#b) (wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x))) (xy: (x: a & b x))
: Tot (acc_classical (lex_dep_relation wfr_a a_to_wfr_b) xy)
(decreases %[wfr_a.decreaser (dfst xy); (a_to_wfr_b (dfst xy)).decreaser (dsnd xy)]) =
l... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 27,
"end_line": 157,
"start_col": 0,
"start_line": 149
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"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 |
wfr_a: FStar.WellFoundedRelation.wfr_t a ->
a_to_wfr_b: (x: a -> FStar.WellFoundedRelation.wfr_t (b x)) ->
xy: Prims.dtuple2 a (fun x -> b x)
-> Prims.Tot
(FStar.WellFoundedRelation.acc_classical (FStar.WellFoundedRelation.lex_dep_relation wfr_a
a_to_wfr_b)
xy) | Prims.Tot | [
"total",
""
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"Prims.dtuple2",
"FStar.WellFoundedRelation.AccClassicalIntro",
"FStar.WellFoundedRelation.lex_dep_relation",
"FStar.WellFoundedRelation.acc_classical",
"FStar.WellFoundedRelation.lex_dep_decreaser"
] | [
"recursion"
] | false | false | false | false | false | let rec lex_dep_decreaser
(#a: Type u#a)
(#b: (a -> Type u#b))
(wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x)))
(xy: (x: a & b x))
: Tot (acc_classical (lex_dep_relation wfr_a a_to_wfr_b) xy)
(decreases %[wfr_a.decreaser (dfst xy);(a_to_wfr_b (dfst xy)).decreaser (dsnd xy)]) ... | let smaller (xy': (x: a & b x){lex_dep_relation wfr_a a_to_wfr_b xy' xy})
: (acc_classical (lex_dep_relation wfr_a a_to_wfr_b) xy') =
lex_dep_decreaser wfr_a a_to_wfr_b xy'
in
AccClassicalIntro smaller | false |
Vale.Inline.X64.Fadd_inline.fst | Vale.Inline.X64.Fadd_inline.fadd_post | val fadd_post:VSig.vale_post fadd_dom | val fadd_post:VSig.vale_post fadd_dom | let fadd_post : VSig.vale_post fadd_dom =
fun (c:V.va_code)
(out:b64)
(f1:b64)
(f2:b64)
(va_s0:V.va_state)
(va_s1:V.va_state)
(f:V.va_fuel) ->
FH.va_ens_Fadd c va_s0 (as_vale_buffer out) (as_vale_buffer f1) (as_vale_buffer f2) va_s1 f | {
"file_name": "vale/code/arch/x64/interop/Vale.Inline.X64.Fadd_inline.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 97,
"end_line": 204,
"start_col": 0,
"start_line": 196
} | module Vale.Inline.X64.Fadd_inline
open FStar.Mul
open FStar.HyperStack.ST
module HS = FStar.HyperStack
module B = LowStar.Buffer
module DV = LowStar.BufferView.Down
open Vale.Def.Types_s
open Vale.Interop.Base
module IX64 = Vale.Interop.X64
module VSig = Vale.AsLowStar.ValeSig
module LSig = Vale.AsLowStar.LowStarSig... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_Inline_s.fst.checked",
"Vale.X64.MemoryAdapters.fsti.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Decls.fsti.checked",
"Vale.Interop.X64.fsti.checked",
"Va... | [
{
"abbrev": false,
"full_module": "Vale.AsLowStar.MemoryHelpers",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastWide",
"short_module": "FW"
},
{
"abbrev": true,
"full_module": "Vale.Curve25519.X64.FastHybrid",
"short_module": "FH"
},
... | {
"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 | Vale.AsLowStar.ValeSig.vale_post Vale.Inline.X64.Fadd_inline.fadd_dom | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.Inline.X64.Fadd_inline.b64",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_fuel",
"Vale.Curve25519.X64.FastHybrid.va_ens_Fadd",
"Vale.X64.MemoryAdapters.as_vale_buffer",
"Vale.Arch.HeapTypes_s.TUInt64",
"Prims.prop"
] | [] | false | false | false | true | false | let fadd_post:VSig.vale_post fadd_dom =
| fun
(c: V.va_code)
(out: b64)
(f1: b64)
(f2: b64)
(va_s0: V.va_state)
(va_s1: V.va_state)
(f: V.va_fuel)
->
FH.va_ens_Fadd c va_s0 (as_vale_buffer out) (as_vale_buffer f1) (as_vale_buffer f2) va_s1 f | false |
Hacl.Impl.RSAPSS.fst | Hacl.Impl.RSAPSS.rsapss_verify_st | val rsapss_verify_st : t: Hacl.Bignum.Definitions.limb_t ->
ke: Hacl.Bignum.Exponentiation.exp t ->
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Hacl.Impl.RSAPSS.modBits_t t
-> Type0 | let rsapss_verify_st (t:limb_t) (ke:BE.exp t) (a:Hash.hash_alg{S.hash_is_supported a}) (modBits:modBits_t t) =
let len = blocks modBits (size (bits t)) in
eBits:size_t{LS.pkey_len_pre t (v modBits) (v eBits)}
-> pkey:lbignum t (2ul *! len +! blocks eBits (size (bits t)))
-> saltLen:size_t
-> sgntLen:size_t... | {
"file_name": "code/rsapss/Hacl.Impl.RSAPSS.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 74,
"end_line": 488,
"start_col": 0,
"start_line": 471
} | module Hacl.Impl.RSAPSS
open FStar.HyperStack
open FStar.HyperStack.ST
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum.Definitions
module ST = FStar.HyperStack.ST
module Hash = Spec.Agile.Hash
module SB = Hacl.Spec.Bignum
module BB = Hacl.Spec.Bignum.Base
module SD = Hacl.Spec.Bignum.Definitions
... | {
"checked_file": "/",
"dependencies": [
"Spec.RSAPSS.fst.checked",
"Spec.Agile.Hash.fsti.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.RSAPSS.fst.checked",
"Hacl.Spec.Bignum.Montgomery.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Keys",
"short_module": "RK"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.MGF",
"short_module": "RM"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.RSAPSS.Padding",
"short_module": "RP"
},
{
"abbrev": true... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
t: Hacl.Bignum.Definitions.limb_t ->
ke: Hacl.Bignum.Exponentiation.exp t ->
a: Spec.Hash.Definitions.hash_alg{Spec.RSAPSS.hash_is_supported a} ->
modBits: Hacl.Impl.RSAPSS.modBits_t t
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Hacl.Bignum.Definitions.limb_t",
"Hacl.Bignum.Exponentiation.exp",
"Spec.Hash.Definitions.hash_alg",
"Prims.b2t",
"Spec.RSAPSS.hash_is_supported",
"Hacl.Impl.RSAPSS.modBits_t",
"Lib.IntTypes.size_t",
"Hacl.Spec.RSAPSS.pkey_len_pre",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"H... | [] | false | false | false | false | true | let rsapss_verify_st
(t: limb_t)
(ke: BE.exp t)
(a: Hash.hash_alg{S.hash_is_supported a})
(modBits: modBits_t t)
=
| let len = blocks modBits (size (bits t)) in
eBits: size_t{LS.pkey_len_pre t (v modBits) (v eBits)} ->
pkey: lbignum t (2ul *! len +! blocks eBits (size (bits t))) ->
saltLen: size_t ->
sgntLen: size_t ->
sgnt: lbuffer uint8 sgntLen ->
msgLen: size_t ->
msg: lbuffer uint8 msgLen
-> Stack b... | false | |
FStar.WellFoundedRelation.fst | FStar.WellFoundedRelation.lex_dep_wfr | val lex_dep_wfr (#a: Type u#a) (#b: a -> Type u#b) (wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x)))
: wfr: wfr_t (x: a & b x){wfr.relation == lex_dep_relation wfr_a a_to_wfr_b} | val lex_dep_wfr (#a: Type u#a) (#b: a -> Type u#b) (wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x)))
: wfr: wfr_t (x: a & b x){wfr.relation == lex_dep_relation wfr_a a_to_wfr_b} | let lex_dep_wfr (#a: Type u#a) (#b: a -> Type u#b) (wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x)))
: wfr: wfr_t (x: a & b x){wfr.relation == lex_dep_relation wfr_a a_to_wfr_b} =
let proof (xy1: (x: a & b x)) (xy2: (x: a & b x))
: Lemma (requires lex_dep_relation wfr_a a_to_wfr_b xy1 xy2)
... | {
"file_name": "ulib/FStar.WellFoundedRelation.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 171,
"start_col": 0,
"start_line": 159
} | (*
Copyright 2022 Jay Lorch and Nikhil Swamy, 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... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.WellFounded.Util.fsti.checked",
"FStar.WellFounded.fst.checked",
"FStar.Universe.fsti.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked"
],
"interf... | [
{
"abbrev": true,
"full_module": "FStar.WellFounded.Util",
"short_module": "WFU"
},
{
"abbrev": true,
"full_module": "FStar.WellFounded",
"short_module": "WF"
},
{
"abbrev": false,
"full_module": "FStar.Universe",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"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 |
wfr_a: FStar.WellFoundedRelation.wfr_t a ->
a_to_wfr_b: (x: a -> FStar.WellFoundedRelation.wfr_t (b x))
-> wfr:
FStar.WellFoundedRelation.wfr_t (Prims.dtuple2 a (fun x -> b x))
{Mkwfr_t?.relation wfr == FStar.WellFoundedRelation.lex_dep_relation wfr_a a_to_wfr_b} | Prims.Tot | [
"total"
] | [] | [
"FStar.WellFoundedRelation.wfr_t",
"FStar.WellFoundedRelation.Mkwfr_t",
"Prims.dtuple2",
"FStar.WellFoundedRelation.lex_dep_relation",
"FStar.WellFoundedRelation.lex_dep_decreaser",
"Prims.unit",
"Prims.squash",
"Prims.precedes",
"FStar.WellFoundedRelation.acc_classical",
"Prims.Nil",
"FStar.Per... | [] | false | false | false | false | false | let lex_dep_wfr
(#a: Type u#a)
(#b: (a -> Type u#b))
(wfr_a: wfr_t a)
(a_to_wfr_b: (x: a -> wfr_t (b x)))
: wfr: wfr_t (x: a & b x) {wfr.relation == lex_dep_relation wfr_a a_to_wfr_b} =
| let proof (xy1 xy2: (x: a & b x))
: Lemma (requires lex_dep_relation wfr_a a_to_wfr_b xy1 xy2)
(ensures lex_dep_decreaser wfr_a a_to_wfr_b xy1 << lex_dep_decreaser wfr_a a_to_wfr_b xy2) =
assert ((lex_dep_decreaser wfr_a a_to_wfr_b xy2).access_smaller xy1 ==
lex_dep_decreaser wfr_a a_to_wfr_b xy1)
in
... | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.