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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
MSort.SeqLemmas.fst | MSort.SeqLemmas.append_slice | val append_slice #a (s : S.seq a)
(l1:nat) (l2 : nat{S.length s == l2 /\ l1 <= l2})
: Lemma (S.append (S.slice s 0 l1) (S.slice s l1 l2) == s)
[SMTPat (S.append (S.slice s 0 l1) (S.slice s l1 l2))] | val append_slice #a (s : S.seq a)
(l1:nat) (l2 : nat{S.length s == l2 /\ l1 <= l2})
: Lemma (S.append (S.slice s 0 l1) (S.slice s l1 l2) == s)
[SMTPat (S.append (S.slice s 0 l1) (S.slice s l1 l2))] | let append_slice s l1 l2 =
assert (S.equal (S.append (S.slice s 0 l1) (S.slice s l1 l2)) s);
() | {
"file_name": "share/steel/examples/pulse/MSort.SeqLemmas.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 4,
"end_line": 52,
"start_col": 0,
"start_line": 50
} | module MSort.SeqLemmas
open FStar.Ghost
module S = FStar.Seq
assume val sort : Seq.seq int -> Seq.seq int
assume val sorted : Seq.seq int -> bool
assume val sort_is_sorted (s:Seq.seq int) : Lemma (sorted (sort s))
assume val sort_len (s:Seq.seq int)
: Lemma (S.length (sort s) == S.length s)
[SMTPat (S.len... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"sho... | {
"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 -> l1: Prims.nat -> l2: Prims.nat{FStar.Seq.Base.length s == l2 /\ l1 <= l2}
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.append (FStar.Seq.Base.slice s 0 l1) (FStar.Seq.Base.slice s l1 l2) == s)
[SMTPat (FStar.Seq.Base.append (FStar.Seq.Base.slice s 0 l1) (FStar.Seq.B... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.l_and",
"Prims.eq2",
"FStar.Seq.Base.length",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.append",
"FStar.Seq.Base.slice"
] | [] | true | false | true | false | false | let append_slice s l1 l2 =
| assert (S.equal (S.append (S.slice s 0 l1) (S.slice s l1 l2)) s);
() | false |
Vale.Transformers.InstructionReorderSanityChecks.fst | Vale.Transformers.InstructionReorderSanityChecks.ins_exchange_sanity_check1 | val ins_exchange_sanity_check1 : Prims.unit | let ins_exchange_sanity_check1 =
assert_norm !!(ins_exchange_sanity_check1_1);
assert_norm !!(ins_exchange_sanity_check1_2) | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.InstructionReorderSanityChecks.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 39,
"start_col": 0,
"start_line": 37
} | module Vale.Transformers.InstructionReorderSanityChecks
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.X64.InsLemmas // this one is from [code]; is that ok?; we use it primarily for the sanit... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.Bytes_Code_s.... | [
{
"abbrev": false,
"full_module": "Vale.X64.InsLemmas // this one is from [code]; is that ok?; we use it primarily for the sanity checks",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.InstructionReorder",
"short_module": null
},
{
"abbrev": false,
... | {
"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 | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.assert_norm",
"Prims.b2t",
"Vale.Def.PossiblyMonad.op_Bang_Bang",
"Vale.Transformers.InstructionReorderSanityChecks.ins_exchange_sanity_check1_2",
"Prims.unit",
"Vale.Transformers.InstructionReorderSanityChecks.ins_exchange_sanity_check1_1"
] | [] | false | false | false | true | false | let ins_exchange_sanity_check1 =
| assert_norm !!(ins_exchange_sanity_check1_1);
assert_norm !!(ins_exchange_sanity_check1_2) | false | |
CDDL.Pulse.fst | CDDL.Pulse.impl_matches_map_entry_zero_or_more | val impl_matches_map_entry_zero_or_more : g: CDDL.Spec.map_group (FStar.Ghost.reveal b) -> Type0 | let impl_matches_map_entry_zero_or_more
(#b: Ghost.erased (option raw_data_item))
(g: map_group b)
=
c: cbor_map_entry ->
(#p: perm) ->
(#v: Ghost.erased (raw_data_item & raw_data_item)) ->
stt bool
(
raw_data_item_map_entry_match p c v **
pure (opt_precedes (Ghos... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 9,
"end_line": 802,
"start_col": 0,
"start_line": 786
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"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 | g: CDDL.Spec.map_group (FStar.Ghost.reveal b) -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Ghost.erased",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Type.raw_data_item",
"CDDL.Spec.map_group",
"FStar.Ghost.reveal",
"CBOR.Pulse.Type.cbor_map_entry",
"PulseCore.FractionalPermission.perm",
"FStar.Pervasives.Native.tuple2",
"Pulse.Lib.Core.stt",
"Prims.bool",
"Pulse.Lib.Core.op_S... | [] | false | false | false | false | true | let impl_matches_map_entry_zero_or_more (#b: Ghost.erased (option raw_data_item)) (g: map_group b) =
| c: cbor_map_entry -> #p: perm -> #v: Ghost.erased (raw_data_item & raw_data_item)
-> stt bool
(raw_data_item_map_entry_match p c v ** pure (opt_precedes (Ghost.reveal v) b))
(fun res ->
raw_data_item_map_entry_match p c v **
pure (opt_precedes (Ghost.reveal v) b /\
res ==... | false | |
MSort.SeqLemmas.fst | MSort.SeqLemmas.partial_merge | val partial_merge
(s1 s2: S.seq int)
(s3: S.seq int {S.length s3 == S.length s1 + S.length s2})
(i: nat{i <= S.length s1})
(j: nat{j <= S.length s2})
: Seq.lseq int (S.length s1 + S.length s2) | val partial_merge
(s1 s2: S.seq int)
(s3: S.seq int {S.length s3 == S.length s1 + S.length s2})
(i: nat{i <= S.length s1})
(j: nat{j <= S.length s2})
: Seq.lseq int (S.length s1 + S.length s2) | let partial_merge
(s1 s2 : S.seq int)
(s3 : S.seq int {S.length s3 == S.length s1 + S.length s2})
(i:nat{i <= S.length s1}) (j : nat{j <= S.length s2})
: Seq.lseq int (S.length s1 + S.length s2) =
S.append (merge (stake i s1) (stake j s2)) (sdrop (i+j) s3) | {
"file_name": "share/steel/examples/pulse/MSort.SeqLemmas.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 61,
"end_line": 113,
"start_col": 0,
"start_line": 108
} | module MSort.SeqLemmas
open FStar.Ghost
module S = FStar.Seq
assume val sort : Seq.seq int -> Seq.seq int
assume val sorted : Seq.seq int -> bool
assume val sort_is_sorted (s:Seq.seq int) : Lemma (sorted (sort s))
assume val sort_len (s:Seq.seq int)
: Lemma (S.length (sort s) == S.length s)
[SMTPat (S.len... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"sho... | {
"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 |
s1: FStar.Seq.Base.seq Prims.int ->
s2: FStar.Seq.Base.seq Prims.int ->
s3:
FStar.Seq.Base.seq Prims.int
{FStar.Seq.Base.length s3 == FStar.Seq.Base.length s1 + FStar.Seq.Base.length s2} ->
i: Prims.nat{i <= FStar.Seq.Base.length s1} ->
j: Prims.nat{j <= FStar.Seq.Base.length s2}
->... | Prims.Tot | [
"total"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.int",
"Prims.eq2",
"FStar.Seq.Base.length",
"Prims.op_Addition",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.Seq.Base.append",
"MSort.SeqLemmas.merge",
"MSort.SeqLemmas.stake",
"MSort.SeqLemmas.sdrop",
"FStar.Seq.Properties.lseq"
] | [] | false | false | false | false | false | let partial_merge
(s1 s2: S.seq int)
(s3: S.seq int {S.length s3 == S.length s1 + S.length s2})
(i: nat{i <= S.length s1})
(j: nat{j <= S.length s2})
: Seq.lseq int (S.length s1 + S.length s2) =
| S.append (merge (stake i s1) (stake j s2)) (sdrop (i + j) s3) | false |
MSort.SeqLemmas.fst | MSort.SeqLemmas.lem_upd_spliced | val lem_upd_spliced (#a: _) (l: nat) (s1 s2: S.seq a) (i: nat)
: Lemma (requires S.length s1 == l /\ S.length s2 == l /\ 0 <= i /\ i < l)
(ensures
S.upd ((stake i s1) `S.append` (sdrop i s2)) i (S.index s1 i) ==
((stake (i + 1) s1) `S.append` (sdrop (i + 1) s2))) | val lem_upd_spliced (#a: _) (l: nat) (s1 s2: S.seq a) (i: nat)
: Lemma (requires S.length s1 == l /\ S.length s2 == l /\ 0 <= i /\ i < l)
(ensures
S.upd ((stake i s1) `S.append` (sdrop i s2)) i (S.index s1 i) ==
((stake (i + 1) s1) `S.append` (sdrop (i + 1) s2))) | let lem_upd_spliced #a (l:nat) (s1 s2 : S.seq a) (i : nat)
: Lemma
(requires S.length s1 == l /\ S.length s2 == l /\ 0 <= i /\ i < l )
(ensures
S.upd (stake i s1 `S.append` sdrop i s2) i (S.index s1 i) ==
(stake (i+1) s1 `S.append` sdrop (i+1) s2))
= assert (S.equal (S.upd (stake i... | {
"file_name": "share/steel/examples/pulse/MSort.SeqLemmas.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 6,
"end_line": 106,
"start_col": 0,
"start_line": 98
} | module MSort.SeqLemmas
open FStar.Ghost
module S = FStar.Seq
assume val sort : Seq.seq int -> Seq.seq int
assume val sorted : Seq.seq int -> bool
assume val sort_is_sorted (s:Seq.seq int) : Lemma (sorted (sort s))
assume val sort_len (s:Seq.seq int)
: Lemma (S.length (sort s) == S.length s)
[SMTPat (S.len... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"sho... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | l: Prims.nat -> s1: FStar.Seq.Base.seq a -> s2: FStar.Seq.Base.seq a -> i: Prims.nat
-> FStar.Pervasives.Lemma
(requires FStar.Seq.Base.length s1 == l /\ FStar.Seq.Base.length s2 == l /\ 0 <= i /\ i < l)
(ensures
FStar.Seq.Base.upd (FStar.Seq.Base.append (MSort.SeqLemmas.stake i s1)
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"FStar.Seq.Base.seq",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.upd",
"FStar.Seq.Base.append",
"MSort.SeqLemmas.stake",
"MSort.SeqLemmas.sdrop",
"FStar.Seq.Base.index",
"Prims.op_Addition",
"Prims.l_and",
"Prims.eq2",
"FStar.Seq.Base.length",
"Pr... | [] | true | false | true | false | false | let lem_upd_spliced #a (l: nat) (s1: S.seq a) (s2: S.seq a) (i: nat)
: Lemma (requires S.length s1 == l /\ S.length s2 == l /\ 0 <= i /\ i < l)
(ensures
S.upd ((stake i s1) `S.append` (sdrop i s2)) i (S.index s1 i) ==
((stake (i + 1) s1) `S.append` (sdrop (i + 1) s2))) =
| assert (S.equal (S.upd ((stake i s1) `S.append` (sdrop i s2)) i (S.index s1 i))
((stake (i + 1) s1) `S.append` (sdrop (i + 1) s2)));
() | false |
CDDL.Pulse.fst | CDDL.Pulse.impl_matches_map_entry_zero_or_more_nil | val impl_matches_map_entry_zero_or_more_nil (b: Ghost.erased (option raw_data_item))
: Tot (impl_matches_map_entry_zero_or_more (map_group_empty #b)) | val impl_matches_map_entry_zero_or_more_nil (b: Ghost.erased (option raw_data_item))
: Tot (impl_matches_map_entry_zero_or_more (map_group_empty #b)) | let impl_matches_map_entry_zero_or_more_nil
(b: Ghost.erased (option raw_data_item))
: Tot (impl_matches_map_entry_zero_or_more (map_group_empty #b))
= impl_matches_map_entry_zero_or_more_nil' b | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 44,
"end_line": 849,
"start_col": 0,
"start_line": 846
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | b: FStar.Ghost.erased (FStar.Pervasives.Native.option CBOR.Spec.Type.raw_data_item)
-> CDDL.Pulse.impl_matches_map_entry_zero_or_more CDDL.Spec.map_group_empty | Prims.Tot | [
"total"
] | [] | [
"FStar.Ghost.erased",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Type.raw_data_item",
"CDDL.Pulse.impl_matches_map_entry_zero_or_more_nil'",
"CDDL.Pulse.impl_matches_map_entry_zero_or_more",
"CDDL.Spec.map_group_empty",
"FStar.Ghost.reveal"
] | [] | false | false | false | false | false | let impl_matches_map_entry_zero_or_more_nil (b: Ghost.erased (option raw_data_item))
: Tot (impl_matches_map_entry_zero_or_more (map_group_empty #b)) =
| impl_matches_map_entry_zero_or_more_nil' b | false |
MSort.SeqLemmas.fst | MSort.SeqLemmas.lemma_eq_intro_explicit | val lemma_eq_intro_explicit
(#a: Type)
(s1: S.seq a)
(s2: S.seq a {S.length s2 == S.length s1})
(pf: (i: nat{i < S.length s1} -> Lemma (S.index s1 i == S.index s2 i)))
: Lemma (S.equal s1 s2) | val lemma_eq_intro_explicit
(#a: Type)
(s1: S.seq a)
(s2: S.seq a {S.length s2 == S.length s1})
(pf: (i: nat{i < S.length s1} -> Lemma (S.index s1 i == S.index s2 i)))
: Lemma (S.equal s1 s2) | let lemma_eq_intro_explicit (#a : Type) (s1 : S.seq a) (s2 : S.seq a{S.length s2 == S.length s1})
(pf : ((i:nat{i < S.length s1}) -> Lemma (S.index s1 i == S.index s2 i)))
: Lemma (S.equal s1 s2)
= Classical.forall_intro pf;
S.lemma_eq_intro s1 s2 | {
"file_name": "share/steel/examples/pulse/MSort.SeqLemmas.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 26,
"end_line": 121,
"start_col": 0,
"start_line": 117
} | module MSort.SeqLemmas
open FStar.Ghost
module S = FStar.Seq
assume val sort : Seq.seq int -> Seq.seq int
assume val sorted : Seq.seq int -> bool
assume val sort_is_sorted (s:Seq.seq int) : Lemma (sorted (sort s))
assume val sort_len (s:Seq.seq int)
: Lemma (S.length (sort s) == S.length s)
[SMTPat (S.len... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked",
"FStar.Calc.fsti.checked"
],
"interface_file": false,
"source_f... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": false,
"full_module": "FStar.Ghost",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"short_module": null
},
{
"abbrev": false,
"full_module": "MSort",
"sho... | {
"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 |
s1: FStar.Seq.Base.seq a ->
s2: FStar.Seq.Base.seq a {FStar.Seq.Base.length s2 == FStar.Seq.Base.length s1} ->
pf:
(i: Prims.nat{i < FStar.Seq.Base.length s1}
-> FStar.Pervasives.Lemma (ensures FStar.Seq.Base.index s1 i == FStar.Seq.Base.index s2 i)
)
-> FStar.Pervasives.Lemma (ensu... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.eq2",
"Prims.nat",
"FStar.Seq.Base.length",
"Prims.b2t",
"Prims.op_LessThan",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"FStar.Seq.Base.index",
"Prims.Nil",
"FStar.Pervasives.pattern",
"FStar.Seq.Base.lemma_eq_intro",
"FStar.Classical.forall_intro",
"FSta... | [] | false | false | true | false | false | let lemma_eq_intro_explicit
(#a: Type)
(s1: S.seq a)
(s2: S.seq a {S.length s2 == S.length s1})
(pf: (i: nat{i < S.length s1} -> Lemma (S.index s1 i == S.index s2 i)))
: Lemma (S.equal s1 s2) =
| Classical.forall_intro pf;
S.lemma_eq_intro s1 s2 | false |
CDDL.Pulse.fst | CDDL.Pulse.impl_str_size | val impl_str_size (ty: major_type_byte_string_or_text_string) (sz: SZ.t{SZ.fits_u64})
: impl_typ (str_size ty (SZ.v sz)) | val impl_str_size (ty: major_type_byte_string_or_text_string) (sz: SZ.t{SZ.fits_u64})
: impl_typ (str_size ty (SZ.v sz)) | let impl_str_size
(ty: major_type_byte_string_or_text_string)
(sz: SZ.t {SZ.fits_u64})
: impl_typ (str_size ty (SZ.v sz))
= impl_str_size' ty sz | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 22,
"end_line": 1005,
"start_col": 0,
"start_line": 1001
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"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 |
ty: CBOR.Spec.Constants.major_type_byte_string_or_text_string ->
sz: FStar.SizeT.t{FStar.SizeT.fits_u64}
-> CDDL.Pulse.impl_typ (CDDL.Spec.str_size ty (FStar.SizeT.v sz)) | Prims.Tot | [
"total"
] | [] | [
"CBOR.Spec.Constants.major_type_byte_string_or_text_string",
"FStar.SizeT.t",
"FStar.SizeT.fits_u64",
"CDDL.Pulse.impl_str_size'",
"CDDL.Pulse.impl_typ",
"FStar.Pervasives.Native.None",
"CBOR.Spec.Type.raw_data_item",
"CDDL.Spec.str_size",
"FStar.SizeT.v"
] | [] | false | false | false | false | false | let impl_str_size (ty: major_type_byte_string_or_text_string) (sz: SZ.t{SZ.fits_u64})
: impl_typ (str_size ty (SZ.v sz)) =
| impl_str_size' ty sz | false |
CDDL.Pulse.fst | CDDL.Pulse.impl_typ | val impl_typ : t: CDDL.Spec.bounded_typ_gen b -> Type0 | let impl_typ
(#b: option raw_data_item)
(t: bounded_typ_gen b)
=
(c: cbor) ->
(#p: perm) ->
(#v: Ghost.erased raw_data_item) ->
stt bool
(raw_data_item_match p c v ** pure (
opt_precedes (Ghost.reveal v) b
))
(fun res -> raw_data_item_match p c v ** pure (
... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 10,
"end_line": 41,
"start_col": 0,
"start_line": 27
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Reference",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "CDDL.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBOR.Pulse",
"short_module": null
},
{
"abbrev": false,
"full_module": "CBO... | {
"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 | t: CDDL.Spec.bounded_typ_gen b -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.option",
"CBOR.Spec.Type.raw_data_item",
"CDDL.Spec.bounded_typ_gen",
"CBOR.Pulse.Type.cbor",
"PulseCore.FractionalPermission.perm",
"FStar.Ghost.erased",
"Pulse.Lib.Core.stt",
"Prims.bool",
"Pulse.Lib.Core.op_Star_Star",
"CBOR.Pulse.Extern.raw_data_item_match",
"FStar.G... | [] | false | false | false | false | true | let impl_typ (#b: option raw_data_item) (t: bounded_typ_gen b) =
| c: cbor -> #p: perm -> #v: Ghost.erased raw_data_item
-> stt bool
(raw_data_item_match p c v ** pure (opt_precedes (Ghost.reveal v) b))
(fun res -> raw_data_item_match p c v ** pure (opt_precedes (Ghost.reveal v) b /\ res == t v)) | false | |
CDDL.Pulse.fst | CDDL.Pulse.impl_array_group3 | val impl_array_group3 : g: CDDL.Spec.array_group3 (FStar.Ghost.reveal b) -> Type0 | let impl_array_group3
(#b: Ghost.erased (option raw_data_item))
(g: array_group3 b)
=
(pi: R.ref cbor_array_iterator_t) ->
(#p: perm) ->
(#i: Ghost.erased cbor_array_iterator_t) ->
(#l: Ghost.erased (list raw_data_item)) ->
stt bool
(R.pts_to pi i **
cbor_array_iterator_m... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 9,
"end_line": 215,
"start_col": 0,
"start_line": 193
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Reference",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "CDDL.Spec",
"short_module": null
},
{
"abbrev": false,
"full_module": "C... | {
"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 | g: CDDL.Spec.array_group3 (FStar.Ghost.reveal b) -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Ghost.erased",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Type.raw_data_item",
"CDDL.Spec.array_group3",
"FStar.Ghost.reveal",
"Pulse.Lib.Reference.ref",
"CBOR.Pulse.Type.cbor_array_iterator_t",
"PulseCore.FractionalPermission.perm",
"Prims.list",
"Pulse.Lib.Core.stt",
"Prims.bool",
"... | [] | false | false | false | false | true | let impl_array_group3 (#b: Ghost.erased (option raw_data_item)) (g: array_group3 b) =
|
pi: R.ref cbor_array_iterator_t ->
#p: perm ->
#i: Ghost.erased cbor_array_iterator_t ->
#l: Ghost.erased (list raw_data_item)
-> stt bool
((R.pts_to pi i ** cbor_array_iterator_match p i l) ** pure (opt_precedes (Ghost.reveal l) b))
(fun res ->
exists* i' l'.
((R.pt... | false | |
Steel.ST.SeqMatch.fst | Steel.ST.SeqMatch.seq_seq_match_seq_list_match | val seq_seq_match_seq_list_match
(#opened: _)
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: list t2)
: STGhost unit
opened
(seq_seq_match p c (Seq.seq_of_list l) 0 (List.Tot.length l))
(fun _ -> seq_list_match c l p)
(Seq.length c == List.Tot.leng... | val seq_seq_match_seq_list_match
(#opened: _)
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: list t2)
: STGhost unit
opened
(seq_seq_match p c (Seq.seq_of_list l) 0 (List.Tot.length l))
(fun _ -> seq_list_match c l p)
(Seq.length c == List.Tot.leng... | let rec seq_seq_match_seq_list_match
(#opened: _)
(#t1 #t2: Type)
(p: t1 -> t2 -> vprop)
(c: Seq.seq t1)
(l: list t2)
: STGhost unit opened
(seq_seq_match p c (Seq.seq_of_list l) 0 (List.Tot.length l))
(fun _ -> seq_list_match c l p)
(Seq.length c == List.Tot.length l)
(fun _ -> True)
(dec... | {
"file_name": "lib/steel/Steel.ST.SeqMatch.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 28,
"end_line": 447,
"start_col": 0,
"start_line": 411
} | module Steel.ST.SeqMatch
include Steel.ST.OnRange
open Steel.ST.GenElim
module Seq = FStar.Seq
module SZ = FStar.SizeT
(* `seq_list_match` describes how to match a sequence of low-level
values (the low-level contents of an array) with a list of high-level
values. `seq_list_match` is carefully designed to be usable wi... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.OnRange.fsti.checked",
"Steel.ST.GenElim.fsti.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.Tot.fst.checked"
],
"interface_file": false,
"source_fil... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "Seq"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim",
"short_module": null
},
{
"abbrev": false,
"full_module": "Stee... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: (_: t1 -> _: t2 -> Steel.Effect.Common.vprop) -> c: FStar.Seq.Base.seq t1 -> l: Prims.list t2
-> Steel.ST.Effect.Ghost.STGhost Prims.unit | Steel.ST.Effect.Ghost.STGhost | [
""
] | [] | [
"Steel.Memory.inames",
"Steel.Effect.Common.vprop",
"FStar.Seq.Base.seq",
"Prims.list",
"Steel.ST.Util.rewrite",
"Steel.ST.SeqMatch.seq_list_match_nil0",
"Steel.ST.SeqMatch.seq_list_match",
"Prims.unit",
"Steel.ST.Util.drop",
"Steel.ST.SeqMatch.seq_seq_match",
"FStar.Seq.Base.seq_of_list",
"FS... | [
"recursion"
] | false | true | false | false | false | let rec seq_seq_match_seq_list_match
(#opened: _)
(#t1 #t2: Type)
(p: (t1 -> t2 -> vprop))
(c: Seq.seq t1)
(l: list t2)
: STGhost unit
opened
(seq_seq_match p c (Seq.seq_of_list l) 0 (List.Tot.length l))
(fun _ -> seq_list_match c l p)
(Seq.length c == List.Tot.... | match l with
| [] ->
drop (seq_seq_match p _ _ _ _);
rewrite (seq_list_match_nil0 c) (seq_list_match c l p)
| a :: q ->
Seq.lemma_seq_of_list_induction (a :: q);
seq_list_match_cons_eq c l p;
on_range_uncons (seq_seq_match_item p _ _) _ 1 _;
rewrite (seq_seq_match_item p _ _ _) (p (Seq.head c) (List.Tot.hd ... | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.upper3_equal | val upper3_equal (q0 q1: quad32) : bool | val upper3_equal (q0 q1: quad32) : bool | let upper3_equal (q0 q1:quad32) : bool =
q0.lo1 = q1.lo1 &&
q0.hi2 = q1.hi2 &&
q0.hi3 = q1.hi3 | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 17,
"end_line": 21,
"start_col": 0,
"start_line": 18
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | q0: Vale.Def.Types_s.quad32 -> q1: Vale.Def.Types_s.quad32 -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Vale.Def.Types_s.quad32",
"Prims.op_AmpAmp",
"Prims.op_Equality",
"Vale.Def.Types_s.nat32",
"Vale.Def.Words_s.__proj__Mkfour__item__lo1",
"Vale.Def.Words_s.__proj__Mkfour__item__hi2",
"Vale.Def.Words_s.__proj__Mkfour__item__hi3",
"Prims.bool"
] | [] | false | false | false | true | false | let upper3_equal (q0 q1: quad32) : bool =
| q0.lo1 = q1.lo1 && q0.hi2 = q1.hi2 && q0.hi3 = q1.hi3 | false |
Steel.ST.HigherReference.fst | Steel.ST.HigherReference.with_named_local | val with_named_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: ret_t -> vprop)
(name: string)
(body: (r: ref t) ->
STT ret_t
(pts_to r full_perm init `star` pre)
(fun v -> exists_ (pts_to r full_perm) `star` post v)
)
: STF ret_t pre post True (fun _ -> True) | val with_named_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: ret_t -> vprop)
(name: string)
(body: (r: ref t) ->
STT ret_t
(pts_to r full_perm init `star` pre)
(fun v -> exists_ (pts_to r full_perm) `star` post v)
)
: STF ret_t pre post True (fun _ -> True) | let with_named_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: ret_t -> vprop)
(name: string)
(body: (r: ref t) ->
STT ret_t
(pts_to r full_perm init `star` pre)
(fun v -> exists_ (pts_to r full_perm) `star` post v)
)
: STF ret_t pre post True (fun _ -> True)
= _push_frame ()... | {
"file_name": "lib/steel/Steel.ST.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 10,
"end_line": 166,
"start_col": 0,
"start_line": 147
} | (*
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.ST.Util.fsti.checked",
"Steel.ST.Coercions.fsti.checked",
"Steel.HigherReference.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.HigherRef... | [
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Steel.ST.Coercions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"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 |
init: t ->
name: Prims.string ->
body: (r: Steel.ST.HigherReference.ref t -> Steel.ST.Effect.STT ret_t)
-> Steel.ST.Effect.STF ret_t | Steel.ST.Effect.STF | [] | [] | [
"Steel.Effect.Common.vprop",
"Prims.string",
"Steel.ST.HigherReference.ref",
"Steel.Effect.Common.star",
"Steel.ST.HigherReference.pts_to",
"Steel.FractionalPermission.full_perm",
"Steel.ST.Util.exists_",
"Steel.ST.Util.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar... | [] | false | true | false | false | false | let with_named_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: (ret_t -> vprop))
(name: string)
(body:
(r: ref t
-> STT ret_t
((pts_to r full_perm init) `star` pre)
(fun v -> (exists_ (pts_to r full_per... | _push_frame ();
[@@ (rename_let name) ]let r = _alloca init in
let v = body r in
let _ = elim_exists () in
_free_and_pop_frame r;
return v | false |
CDDL.Pulse.fst | CDDL.Pulse.cbor_read_with_typ_success_postcond | val cbor_read_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop | val cbor_read_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop | let cbor_read_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop
=
cbor_read_success_postcond va c v rem /\
t v == true | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 15,
"end_line": 378,
"start_col": 0,
"start_line": 369
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Reference",
"short_module": "R"
},
{
"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 |
t: CDDL.Spec.typ ->
va: FStar.Ghost.erased (FStar.Seq.Base.seq FStar.UInt8.t) ->
c: CBOR.Pulse.Extern.cbor_read_t ->
v: CBOR.Spec.Type.raw_data_item ->
rem: FStar.Seq.Base.seq FStar.UInt8.t
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"CDDL.Spec.typ",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"CBOR.Pulse.Extern.cbor_read_t",
"CBOR.Spec.Type.raw_data_item",
"Prims.l_and",
"CBOR.Pulse.Extern.cbor_read_success_postcond",
"Prims.eq2",
"Prims.bool",
"Prims.prop"
] | [] | false | false | false | true | true | let cbor_read_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop =
| cbor_read_success_postcond va c v rem /\ t v == true | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.append_distributes_be_seq_quad32_to_bytes | val append_distributes_be_seq_quad32_to_bytes (x y: seq quad32)
: Lemma
(seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE (append x y)) ==
append (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE x))
(seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE y))) | val append_distributes_be_seq_quad32_to_bytes (x y: seq quad32)
: Lemma
(seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE (append x y)) ==
append (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE x))
(seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE y))) | let append_distributes_be_seq_quad32_to_bytes (x y:seq quad32) :
Lemma (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE (append x y)) == append (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE x)) (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE y)))
=
append_distributes_be_seq_quad32_to_bytes x y | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 263,
"start_col": 0,
"start_line": 260
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | x: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 -> y: FStar.Seq.Base.seq Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(ensures
Vale.Def.Words.Seq_s.seq_nat32_to_seq_nat8_BE (Vale.Def.Words.Seq_s.seq_four_to_seq_BE (FStar.Seq.Base.append
x
y)) ==
FStar.Seq.Base.append... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Vale.Arch.Types.append_distributes_be_seq_quad32_to_bytes",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"Vale.Def.Words_s.nat8",
"Vale.Def.Words.Seq_s.seq_nat32_to_seq_nat8_BE",
"Vale.Def.Words.Seq_s.seq_four_to_seq_BE",
"Vale.Def.... | [] | true | false | true | false | false | let append_distributes_be_seq_quad32_to_bytes (x y: seq quad32)
: Lemma
(seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE (append x y)) ==
append (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE x))
(seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE y))) =
| append_distributes_be_seq_quad32_to_bytes x y | false |
CDDL.Pulse.fst | CDDL.Pulse.cbor_map_get_with_typ_post_found | val cbor_map_get_with_typ_post_found (t: typ) (vkey vmap vvalue: raw_data_item) : Tot prop | val cbor_map_get_with_typ_post_found (t: typ) (vkey vmap vvalue: raw_data_item) : Tot prop | let cbor_map_get_with_typ_post_found
(t: typ)
(vkey: raw_data_item)
(vmap: raw_data_item)
(vvalue: raw_data_item)
: Tot prop
= Map? vmap /\
list_ghost_assoc vkey (Map?.v vmap) == Some vvalue /\
t vvalue == true | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 18,
"end_line": 622,
"start_col": 0,
"start_line": 614
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"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 |
t: CDDL.Spec.typ ->
vkey: CBOR.Spec.Type.raw_data_item ->
vmap: CBOR.Spec.Type.raw_data_item ->
vvalue: CBOR.Spec.Type.raw_data_item
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"CDDL.Spec.typ",
"CBOR.Spec.Type.raw_data_item",
"Prims.l_and",
"Prims.b2t",
"CBOR.Spec.Type.uu___is_Map",
"Prims.eq2",
"FStar.Pervasives.Native.option",
"CBOR.Pulse.list_ghost_assoc",
"CBOR.Spec.Type.__proj__Map__item__v",
"FStar.Pervasives.Native.Some",
"Prims.bool",
"Prims.prop"
] | [] | false | false | false | true | true | let cbor_map_get_with_typ_post_found (t: typ) (vkey vmap vvalue: raw_data_item) : Tot prop =
| Map? vmap /\ list_ghost_assoc vkey (Map?.v vmap) == Some vvalue /\ t vvalue == true | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.lemma_be_bytes_to_quad32_prefix_equality | val lemma_be_bytes_to_quad32_prefix_equality
(b0: seq nat8 {length b0 == 16})
(b1: seq nat8 {length b1 == 16})
: Lemma (requires slice b0 0 12 == slice b1 0 12)
(ensures upper3_equal (be_bytes_to_quad32 b0) (be_bytes_to_quad32 b1)) | val lemma_be_bytes_to_quad32_prefix_equality
(b0: seq nat8 {length b0 == 16})
(b1: seq nat8 {length b1 == 16})
: Lemma (requires slice b0 0 12 == slice b1 0 12)
(ensures upper3_equal (be_bytes_to_quad32 b0) (be_bytes_to_quad32 b1)) | let lemma_be_bytes_to_quad32_prefix_equality (b0:seq nat8 {length b0 == 16}) (b1:seq nat8 {length b1 == 16}) : Lemma
(requires slice b0 0 12 == slice b1 0 12)
(ensures upper3_equal (be_bytes_to_quad32 b0) (be_bytes_to_quad32 b1))
=
let q0 = be_bytes_to_quad32 b0 in
let q1 = be_bytes_to_quad32 b1 in
be_bytes... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 80,
"end_line": 34,
"start_col": 0,
"start_line": 23
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 |
b0: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 {FStar.Seq.Base.length b0 == 16} ->
b1: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 {FStar.Seq.Base.length b1 == 16}
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.slice b0 0 12 == FStar.Seq.Base.slice b1 0 12)
(ensures
Vale.AES.GCM_BE.upper3_equal ... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Prims.eq2",
"Prims.int",
"FStar.Seq.Base.length",
"Prims._assert",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_LessThan",
"FStar.Seq.Base.index",
"FStar.Seq.Base.slice",
"Prims.unit",
... | [] | false | false | true | false | false | let lemma_be_bytes_to_quad32_prefix_equality
(b0: seq nat8 {length b0 == 16})
(b1: seq nat8 {length b1 == 16})
: Lemma (requires slice b0 0 12 == slice b1 0 12)
(ensures upper3_equal (be_bytes_to_quad32 b0) (be_bytes_to_quad32 b1)) =
| let q0 = be_bytes_to_quad32 b0 in
let q1 = be_bytes_to_quad32 b1 in
be_bytes_to_quad32_reveal ();
reveal_opaque (`%seq_to_seq_four_BE) (seq_to_seq_four_BE #nat8);
assert (forall (i: int).
(0 <= i /\ i < 12) ==>
(index b0 i == index (slice b0 0 12) i /\ index b1 i == index (slice b1 0 12) i)) | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_encrypt_BE_fst_helper | val gcm_encrypt_BE_fst_helper
(iv: supported_iv_BE)
(iv_enc iv_BE: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_word alg key /\ length plain < pow2_32 /\ length auth < pow2_32 /\
(let h_BE = aes_encrypt_word ... | val gcm_encrypt_BE_fst_helper
(iv: supported_iv_BE)
(iv_enc iv_BE: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_word alg key /\ length plain < pow2_32 /\ length auth < pow2_32 /\
(let h_BE = aes_encrypt_word ... | let gcm_encrypt_BE_fst_helper (iv:supported_iv_BE) (iv_enc iv_BE:quad32) (plain auth cipher:seq nat8) (alg:algorithm) (key:seq nat32) : Lemma
(requires
is_aes_key_word alg key /\
length plain < pow2_32 /\
length auth < pow2_32 /\
(let h_BE = aes_encrypt_word alg key (Mkfour 0 0 0 0) in
iv_enc == in... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 125,
"start_col": 0,
"start_line": 114
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 |
iv: Vale.AES.GCM_BE_s.supported_iv_BE ->
iv_enc: Vale.Def.Types_s.quad32 ->
iv_BE: Vale.Def.Types_s.quad32 ->
plain: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
cipher: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
alg: Vale.AES.AES_common_s.a... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Words_s.nat32",
"Vale.AES.GCM_BE_s.gcm_encrypt_BE_reveal",
"Prims.unit",
"Prims.l_and",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Prims.b2t",
... | [] | true | false | true | false | false | let gcm_encrypt_BE_fst_helper
(iv: supported_iv_BE)
(iv_enc iv_BE: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_word alg key /\ length plain < pow2_32 /\ length auth < pow2_32 /\
(let h_BE = aes_encrypt_word ... | gcm_encrypt_BE_reveal () | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.slice_append_back | val slice_append_back (#a: Type) (x y: seq a) (i: nat)
: Lemma (requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x))) | val slice_append_back (#a: Type) (x y: seq a) (i: nat)
: Lemma (requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x))) | let slice_append_back (#a:Type) (x y:seq a) (i:nat) : Lemma
(requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x)))
=
assert (equal (slice (append x y) 0 i) (append x (slice y 0 (i - length x))));
() | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 258,
"start_col": 0,
"start_line": 253
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | x: FStar.Seq.Base.seq a -> y: FStar.Seq.Base.seq a -> i: Prims.nat
-> FStar.Pervasives.Lemma
(requires
FStar.Seq.Base.length x <= i /\ i <= FStar.Seq.Base.length x + FStar.Seq.Base.length y)
(ensures
FStar.Seq.Base.slice (FStar.Seq.Base.append x y) 0 i ==
FStar.Seq.Base.append x (F... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Prims.nat",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"FStar.Seq.Base.slice",
"FStar.Seq.Base.append",
"Prims.op_Subtraction",
"FStar.Seq.Base.length",
"Prims.l_and",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Prims.op_Addition",
"Prims.squash",
"Prims.... | [] | true | false | true | false | false | let slice_append_back (#a: Type) (x y: seq a) (i: nat)
: Lemma (requires length x <= i /\ i <= length x + length y)
(ensures slice (append x y) 0 i == append x (slice y 0 (i - length x))) =
| assert (equal (slice (append x y) 0 i) (append x (slice y 0 (i - length x))));
() | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.lemma_be_seq_quad32_to_bytes_prefix_equality | val lemma_be_seq_quad32_to_bytes_prefix_equality (q: quad32)
: Lemma
(slice (be_quad32_to_bytes q) 0 12 ==
slice (pad_to_128_bits (slice (be_quad32_to_bytes q) 0 12)) 0 12) | val lemma_be_seq_quad32_to_bytes_prefix_equality (q: quad32)
: Lemma
(slice (be_quad32_to_bytes q) 0 12 ==
slice (pad_to_128_bits (slice (be_quad32_to_bytes q) 0 12)) 0 12) | let lemma_be_seq_quad32_to_bytes_prefix_equality (q:quad32) : Lemma
(slice (be_quad32_to_bytes q) 0 12 == slice (pad_to_128_bits (slice (be_quad32_to_bytes q) 0 12)) 0 12)
=
assert (equal (slice (pad_to_128_bits (slice (be_quad32_to_bytes q) 0 12)) 0 12)
(slice (be_quad32_to_bytes q) 0 12));
() | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 41,
"start_col": 0,
"start_line": 36
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | q: Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(ensures
FStar.Seq.Base.slice (Vale.Arch.Types.be_quad32_to_bytes q) 0 12 ==
FStar.Seq.Base.slice (Vale.AES.GCTR_BE_s.pad_to_128_bits (FStar.Seq.Base.slice (Vale.Arch.Types.be_quad32_to_bytes
q)
0
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Def.Types_s.quad32",
"Prims.unit",
"Prims._assert",
"FStar.Seq.Base.equal",
"Vale.Def.Types_s.nat8",
"FStar.Seq.Base.slice",
"Vale.AES.GCTR_BE_s.pad_to_128_bits",
"Vale.Def.Words_s.nat8",
"Vale.Arch.Types.be_quad32_to_bytes",
"Prims.l_True",
"Prims.squash",
"Prims.eq2",
"FStar.Seq.Base... | [] | true | false | true | false | false | let lemma_be_seq_quad32_to_bytes_prefix_equality (q: quad32)
: Lemma
(slice (be_quad32_to_bytes q) 0 12 ==
slice (pad_to_128_bits (slice (be_quad32_to_bytes q) 0 12)) 0 12) =
| assert (equal (slice (pad_to_128_bits (slice (be_quad32_to_bytes q) 0 12)) 0 12)
(slice (be_quad32_to_bytes q) 0 12));
() | false |
CDDL.Pulse.fst | CDDL.Pulse.cbor_read_deterministically_encoded_with_typ_error_postcond_intro_typ_fail | val cbor_read_deterministically_encoded_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma
(requires (cbor_read_deterministically_encoded_success_postcond va c v rem /\ t v == false))
... | val cbor_read_deterministically_encoded_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma
(requires (cbor_read_deterministically_encoded_success_postcond va c v rem /\ t v == false))
... | let cbor_read_deterministically_encoded_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma
(requires (
cbor_read_deterministically_encoded_success_postcond va c v rem /\
t v == false
))
(... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 142,
"end_line": 530,
"start_col": 0,
"start_line": 516
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"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 |
t: CDDL.Spec.typ ->
va: FStar.Ghost.erased (FStar.Seq.Base.seq FStar.UInt8.t) ->
c: CBOR.Pulse.Extern.cbor_read_t ->
v: CBOR.Spec.Type.raw_data_item ->
rem: FStar.Seq.Base.seq FStar.UInt8.t
-> FStar.Pervasives.Lemma
(requires
CBOR.Pulse.Extern.cbor_read_deterministically_encoded_suc... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"CDDL.Spec.typ",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"CBOR.Pulse.Extern.cbor_read_t",
"CBOR.Spec.Type.raw_data_item",
"CBOR.Spec.serialize_cbor_with_test_correct",
"Prims.l_and",
"Prims.eq2",
"Prims.bool",
"CBOR.Spec.Type.data_item_wf",
"FStar.Ghost.reveal",
"CBOR.Sp... | [] | false | false | true | false | false | let cbor_read_deterministically_encoded_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma
(requires (cbor_read_deterministically_encoded_success_postcond va c v rem /\ t v == false))
... | serialize_cbor_with_test_correct v
rem
(fun v' rem' ->
data_item_wf deterministically_encoded_cbor_map_key_order v' == true /\ t v' == true) | false |
CDDL.Pulse.fst | CDDL.Pulse.cbor_read_deterministically_encoded_with_typ_success_postcond | val cbor_read_deterministically_encoded_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop | val cbor_read_deterministically_encoded_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop | let cbor_read_deterministically_encoded_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop
=
cbor_read_deterministically_encoded_success_postcond va c v rem /\
t v == true | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 15,
"end_line": 503,
"start_col": 0,
"start_line": 494
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"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 |
t: CDDL.Spec.typ ->
va: FStar.Ghost.erased (FStar.Seq.Base.seq FStar.UInt8.t) ->
c: CBOR.Pulse.Extern.cbor_read_t ->
v: CBOR.Spec.Type.raw_data_item ->
rem: FStar.Seq.Base.seq FStar.UInt8.t
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"CDDL.Spec.typ",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"CBOR.Pulse.Extern.cbor_read_t",
"CBOR.Spec.Type.raw_data_item",
"Prims.l_and",
"CBOR.Pulse.Extern.cbor_read_deterministically_encoded_success_postcond",
"Prims.eq2",
"Prims.bool",
"Prims.prop"
] | [] | false | false | false | true | true | let cbor_read_deterministically_encoded_with_typ_success_postcond
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Tot prop =
| cbor_read_deterministically_encoded_success_postcond va c v rem /\ t v == true | false |
Vale.Transformers.MovMovElim.fst | Vale.Transformers.MovMovElim.mov_mov_elim_ph | val mov_mov_elim_ph : Vale.Transformers.PeepHole.pre_peephole | let mov_mov_elim_ph = {
ph = (fun is ->
if safe_mov_mov_elim is then (
let [i1; i2] = is in
Some [i2]
) else None);
input_hint = 2;
} | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.MovMovElim.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 1,
"end_line": 54,
"start_col": 0,
"start_line": 47
} | module Vale.Transformers.MovMovElim
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.Def.PossiblyMonad
open Vale.Transformers.InstructionReorder
open Vale.X64.InsLemmas
open Vale.Transformers.P... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.Bytes_Code_s.... | [
{
"abbrev": false,
"full_module": "Vale.Transformers.PeepHole",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsLemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.InstructionReorder",
"short_module": null
},
{
... | {
"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.Transformers.PeepHole.pre_peephole | Prims.Tot | [
"total"
] | [] | [
"Vale.Transformers.PeepHole.Mkpre_peephole",
"Prims.list",
"Vale.X64.Machine_Semantics_s.ins",
"Vale.Transformers.MovMovElim.safe_mov_mov_elim",
"FStar.Pervasives.Native.Some",
"Prims.Cons",
"Prims.Nil",
"FStar.Pervasives.Native.option",
"Prims.bool",
"FStar.Pervasives.Native.None"
] | [] | false | false | false | true | false | let mov_mov_elim_ph =
| {
ph
=
(fun is ->
if safe_mov_mov_elim is
then
(let [i1 ; i2] = is in
Some [i2])
else None);
input_hint = 2
} | false | |
CDDL.Pulse.fst | CDDL.Pulse.cbor_read_with_typ_error_postcond_intro_typ_fail | val cbor_read_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma (requires (cbor_read_success_postcond va c v rem /\ t v == false))
(ensures (cbor_read_with_typ_error_postcond t va)) | val cbor_read_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma (requires (cbor_read_success_postcond va c v rem /\ t v == false))
(ensures (cbor_read_with_typ_error_postcond t va)) | let cbor_read_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma
(requires (
cbor_read_success_postcond va c v rem /\
t v == false
))
(ensures (
cbor_read_with_typ_error_postcond ... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 70,
"end_line": 419,
"start_col": 0,
"start_line": 405
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.UInt8",
"short_module": "U8"
},
{
"abbrev": true,
"full_module": "FStar.UInt64",
"short_module": "U64"
},
{
"abbrev": true,
"full_module": "Pulse... | {
"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 |
t: CDDL.Spec.typ ->
va: FStar.Ghost.erased (FStar.Seq.Base.seq FStar.UInt8.t) ->
c: CBOR.Pulse.Extern.cbor_read_t ->
v: CBOR.Spec.Type.raw_data_item ->
rem: FStar.Seq.Base.seq FStar.UInt8.t
-> FStar.Pervasives.Lemma
(requires CBOR.Pulse.Extern.cbor_read_success_postcond va c v rem /\ t v ==... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"CDDL.Spec.typ",
"FStar.Ghost.erased",
"FStar.Seq.Base.seq",
"FStar.UInt8.t",
"CBOR.Pulse.Extern.cbor_read_t",
"CBOR.Spec.Type.raw_data_item",
"CBOR.Spec.serialize_cbor_with_test_correct",
"Prims.eq2",
"Prims.bool",
"Prims.prop",
"Prims.unit",
"Prims.l_and",
"CBOR.Pulse.Extern.cbor_read_succ... | [] | false | false | true | false | false | let cbor_read_with_typ_error_postcond_intro_typ_fail
(t: typ)
(va: Ghost.erased (Seq.seq U8.t))
(c: cbor_read_t)
(v: raw_data_item)
(rem: Seq.seq U8.t)
: Lemma (requires (cbor_read_success_postcond va c v rem /\ t v == false))
(ensures (cbor_read_with_typ_error_postcond t va)) =
... | serialize_cbor_with_test_correct v rem (fun v' rem' -> t v' == true) | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_encrypt_BE_snd_helper | val gcm_encrypt_BE_snd_helper
(iv: supported_iv_BE)
(j0_BE length_quad32 hash mac: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_word alg key /\ length plain < pow2_32 /\ length auth < pow2_32 /\
(let h_BE = a... | val gcm_encrypt_BE_snd_helper
(iv: supported_iv_BE)
(j0_BE length_quad32 hash mac: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_word alg key /\ length plain < pow2_32 /\ length auth < pow2_32 /\
(let h_BE = a... | let gcm_encrypt_BE_snd_helper (iv:supported_iv_BE) (j0_BE length_quad32 hash mac:quad32) (plain auth cipher:seq nat8) (alg:algorithm) (key:seq nat32) : Lemma
(requires
is_aes_key_word alg key /\
length plain < pow2_32 /\
length auth < pow2_32 /\
(let h_BE = aes_encrypt_word alg key (Mkfour 0 0 0 0) in
... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 143,
"start_col": 0,
"start_line": 127
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 |
iv: Vale.AES.GCM_BE_s.supported_iv_BE ->
j0_BE: Vale.Def.Types_s.quad32 ->
length_quad32: Vale.Def.Types_s.quad32 ->
hash: Vale.Def.Types_s.quad32 ->
mac: Vale.Def.Types_s.quad32 ->
plain: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
ciph... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Vale.Def.Types_s.quad32",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Vale.AES.AES_common_s.algorithm",
"Vale.Def.Words_s.nat32",
"Vale.AES.GCM_BE_s.gcm_encrypt_BE_reveal",
"Prims.unit",
"Prims.l_and",
"Vale.AES.AES_BE_s.is_aes_key_word",
"Prims.b2t",
... | [] | true | false | true | false | false | let gcm_encrypt_BE_snd_helper
(iv: supported_iv_BE)
(j0_BE length_quad32 hash mac: quad32)
(plain auth cipher: seq nat8)
(alg: algorithm)
(key: seq nat32)
: Lemma
(requires
is_aes_key_word alg key /\ length plain < pow2_32 /\ length auth < pow2_32 /\
(let h_BE = a... | gcm_encrypt_BE_reveal () | false |
Vale.Transformers.MovMovElim.fst | Vale.Transformers.MovMovElim.safe_mov_mov_elim | val safe_mov_mov_elim (is: list ins) : Tot bool | val safe_mov_mov_elim (is: list ins) : Tot bool | let safe_mov_mov_elim (is:list ins) : Tot bool =
match is with
| [Instr i1 oprs1 (AnnotateMov64 ()); Instr i2 oprs2 (AnnotateMov64 ())] ->
let oprs1:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [out op64] [op64]) oprs1 in
let oprs2:normal (instr_operands_t [out op6... | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.MovMovElim.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 44,
"start_col": 0,
"start_line": 25
} | module Vale.Transformers.MovMovElim
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.Def.PossiblyMonad
open Vale.Transformers.InstructionReorder
open Vale.X64.InsLemmas
open Vale.Transformers.P... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.Bytes_Code_s.... | [
{
"abbrev": false,
"full_module": "Vale.Transformers.PeepHole",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.InsLemmas",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Transformers.InstructionReorder",
"short_module": null
},
{
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 4,
"max_fuel": 1,
"max_ifuel": 4,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | is: Prims.list Vale.X64.Machine_Semantics_s.ins -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__args",
"Vale.X64.Machine_s.operand64",
"Prims.op_Am... | [] | false | false | false | true | false | let safe_mov_mov_elim (is: list ins) : Tot bool =
| match is with
| [Instr i1 oprs1 (AnnotateMov64 ()) ; Instr i2 oprs2 (AnnotateMov64 ())] ->
let oprs1:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [out op64] [op64]) oprs1
in
let oprs2:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [ou... | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.lemma_compute_iv_hard | val lemma_compute_iv_hard (iv:supported_iv_BE) (quads:seq quad32) (length_quad h_BE j0:quad32) : Lemma
(requires
~(length iv == 96/8) /\
quads == be_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_BE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
length_quad == two_two... | val lemma_compute_iv_hard (iv:supported_iv_BE) (quads:seq quad32) (length_quad h_BE j0:quad32) : Lemma
(requires
~(length iv == 96/8) /\
quads == be_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_BE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
length_quad == two_two... | let lemma_compute_iv_hard (iv:supported_iv_BE) (quads:seq quad32) (length_quad h_BE j0:quad32) : Lemma
(requires
~(length iv == 96/8) /\
quads == be_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_BE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
length_quad == two_two... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 112,
"start_col": 0,
"start_line": 101
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
iv: Vale.AES.GCM_BE_s.supported_iv_BE ->
quads: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
length_quad: Vale.Def.Types_s.quad32 ->
h_BE: Vale.Def.Types_s.quad32 ->
j0: Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(requires
~(FStar.Seq.Base.length iv == 96 / 8) /\
qua... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.GCM_BE_s.supported_iv_BE",
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Prims.unit",
"Vale.AES.GCM_BE_s.compute_iv_BE_reveal",
"Vale.AES.GHash_BE.ghash_incremental_to_ghash",
"FStar.Seq.Base.append",
"FStar.Seq.Base.create",
"Prims.l_and",
"Prims.l_not",
"Prims.eq2",
"Prims.int"... | [] | true | false | true | false | false | let lemma_compute_iv_hard (iv: supported_iv_BE) (quads: seq quad32) (length_quad h_BE j0: quad32)
: Lemma
(requires
~(length iv == 96 / 8) /\ quads == be_bytes_to_seq_quad32 (pad_to_128_bits iv) /\
j0 == ghash_incremental h_BE (Mkfour 0 0 0 0) (append quads (create 1 length_quad)) /\
l... | ghash_incremental_to_ghash h_BE (append quads (create 1 length_quad));
compute_iv_BE_reveal ();
() | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.pad_to_128_bits_multiple_append | val pad_to_128_bits_multiple_append (x y: seq nat8)
: Lemma (requires length x % 16 == 0)
(ensures pad_to_128_bits (append x y) == append x (pad_to_128_bits y)) | val pad_to_128_bits_multiple_append (x y: seq nat8)
: Lemma (requires length x % 16 == 0)
(ensures pad_to_128_bits (append x y) == append x (pad_to_128_bits y)) | let pad_to_128_bits_multiple_append (x y:seq nat8) : Lemma
(requires length x % 16 == 0)
(ensures pad_to_128_bits (append x y) == append x (pad_to_128_bits y))
=
assert (equal (pad_to_128_bits (append x y)) (append x (pad_to_128_bits y))) | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 78,
"end_line": 269,
"start_col": 0,
"start_line": 265
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 | x: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 -> y: FStar.Seq.Base.seq Vale.Def.Words_s.nat8
-> FStar.Pervasives.Lemma (requires FStar.Seq.Base.length x % 16 == 0)
(ensures
Vale.AES.GCTR_BE_s.pad_to_128_bits (FStar.Seq.Base.append x y) ==
FStar.Seq.Base.append x (Vale.AES.GCTR_BE_s.pad_to_128_bits... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Prims._assert",
"FStar.Seq.Base.equal",
"Vale.Def.Types_s.nat8",
"Vale.AES.GCTR_BE_s.pad_to_128_bits",
"FStar.Seq.Base.append",
"Prims.unit",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"FStar.Seq.Base.length",
"Prims.squash",
"Prims.Nil",
... | [] | true | false | true | false | false | let pad_to_128_bits_multiple_append (x y: seq nat8)
: Lemma (requires length x % 16 == 0)
(ensures pad_to_128_bits (append x y) == append x (pad_to_128_bits y)) =
| assert (equal (pad_to_128_bits (append x y)) (append x (pad_to_128_bits y))) | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.lemma_gcm_encrypt_decrypt_equiv | val lemma_gcm_encrypt_decrypt_equiv
(alg: algorithm)
(key: seq nat32)
(iv: supported_iv_BE)
(j0_BE: quad32)
(plain cipher auth alleged_tag: seq nat8)
: Lemma
(requires
is_aes_key_word alg key /\
(let h_BE = aes_encrypt_word alg key (Mkfour 0 0 0 0) in
j0... | val lemma_gcm_encrypt_decrypt_equiv
(alg: algorithm)
(key: seq nat32)
(iv: supported_iv_BE)
(j0_BE: quad32)
(plain cipher auth alleged_tag: seq nat8)
: Lemma
(requires
is_aes_key_word alg key /\
(let h_BE = aes_encrypt_word alg key (Mkfour 0 0 0 0) in
j0... | let lemma_gcm_encrypt_decrypt_equiv (alg:algorithm) (key:seq nat32) (iv:supported_iv_BE) (j0_BE:quad32) (plain cipher auth alleged_tag:seq nat8) : Lemma
(requires
is_aes_key_word alg key /\
(let h_BE = aes_encrypt_word alg key (Mkfour 0 0 0 0) in
j0_BE = compute_iv_BE h_BE iv) /\
length cipher < pow2_3... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 650,
"start_col": 0,
"start_line": 637
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
iv: Vale.AES.GCM_BE_s.supported_iv_BE ->
j0_BE: Vale.Def.Types_s.quad32 ->
plain: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
cipher: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.se... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.nat8",
"Prims.unit",
"Vale.AES.GCM_BE_s.gcm_decrypt_BE_reveal",
"Vale.AES.GCM_BE_s.gcm_encrypt_BE_reveal",
"Prims.l_and",
"Vale.AES... | [] | true | false | true | false | false | let lemma_gcm_encrypt_decrypt_equiv
(alg: algorithm)
(key: seq nat32)
(iv: supported_iv_BE)
(j0_BE: quad32)
(plain cipher auth alleged_tag: seq nat8)
: Lemma
(requires
is_aes_key_word alg key /\
(let h_BE = aes_encrypt_word alg key (Mkfour 0 0 0 0) in
j0... | gcm_encrypt_BE_reveal ();
gcm_decrypt_BE_reveal ();
() | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.decrypt_helper | val decrypt_helper
(alg:algorithm) (key:seq nat8) (iv:supported_iv_BE) (cipher:seq nat8) (auth:seq nat8)
(r3:nat64) (alleged_tag_quad computed_tag:quad32) : Lemma
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32 /\
(if alleged_tag_quad = computed_tag then r3 = 0... | val decrypt_helper
(alg:algorithm) (key:seq nat8) (iv:supported_iv_BE) (cipher:seq nat8) (auth:seq nat8)
(r3:nat64) (alleged_tag_quad computed_tag:quad32) : Lemma
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32 /\
(if alleged_tag_quad = computed_tag then r3 = 0... | let decrypt_helper
(alg:algorithm) (key:seq nat8) (iv:supported_iv_BE) (cipher:seq nat8) (auth:seq nat8)
(r3:nat64) (alleged_tag_quad computed_tag:quad32) : Lemma
(requires
is_aes_key alg key /\
length cipher < pow2_32 /\
length auth < pow2_32 /\
(if alleged_tag_quad = computed_tag then r3 = 0... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 1065,
"start_col": 0,
"start_line": 1051
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
iv: Vale.AES.GCM_BE_s.supported_iv_BE ->
cipher: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
auth: FStar.Seq.Base.seq Vale.Def.Words_s.nat8 ->
r3: Vale.Def.Words_s.nat64 ->
alleged_tag_quad: Vale.Def.Ty... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat8",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Vale.Def.Words_s.nat64",
"Vale.Def.Types_s.quad32",
"Prims.unit",
"Vale.Arch.Types.be_quad32_to_bytes_injective_specific",
"Vale.AES.GCM_BE_s.gcm_decrypt_BE_reveal",
"Prims.l_and... | [] | true | false | true | false | false | let decrypt_helper
(alg: algorithm)
(key: seq nat8)
(iv: supported_iv_BE)
(cipher auth: seq nat8)
(r3: nat64)
(alleged_tag_quad computed_tag: quad32)
: Lemma
(requires
is_aes_key alg key /\ length cipher < pow2_32 /\ length auth < pow2_32 /\
(if alleged_tag_... | gcm_decrypt_BE_reveal ();
be_quad32_to_bytes_injective_specific alleged_tag_quad computed_tag;
() | false |
Vale.Transformers.MovMovElim.fst | Vale.Transformers.MovMovElim.mov_mov_elim_correct | val mov_mov_elim_correct (is: list ins) (s: machine_state)
: Lemma (peephole_correct mov_mov_elim_ph is s) [SMTPat (peephole_correct mov_mov_elim_ph is s)] | val mov_mov_elim_correct (is: list ins) (s: machine_state)
: Lemma (peephole_correct mov_mov_elim_ph is s) [SMTPat (peephole_correct mov_mov_elim_ph is s)] | let mov_mov_elim_correct (is:list ins) (s:machine_state) :
Lemma (peephole_correct mov_mov_elim_ph is s)
[SMTPat (peephole_correct mov_mov_elim_ph is s)] =
if safe_mov_mov_elim is then (
let [i1; i2] = is in
lemma_mov_mov_is_mov i1 i2 s
) else () | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.MovMovElim.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 97,
"start_col": 0,
"start_line": 91
} | module Vale.Transformers.MovMovElim
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.Def.PossiblyMonad
open Vale.Transformers.InstructionReorder
open Vale.X64.InsLemmas
open Vale.Transformers.P... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.Bytes_Code_s.... | [
{
"abbrev": true,
"full_module": "Vale.Arch.Heap",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Vale.Def.Types_s",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Vale.Transformers.PeepHole",
"short_module": null
},
{
"abbrev": false,
"fu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 3,
"initial_ifuel": 0,
"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 | is: Prims.list Vale.X64.Machine_Semantics_s.ins -> s: Vale.X64.Machine_Semantics_s.machine_state
-> FStar.Pervasives.Lemma
(ensures
Vale.Transformers.PeepHole.peephole_correct Vale.Transformers.MovMovElim.mov_mov_elim_ph
is
s)
[
SMTPat (Vale.Transformers.PeepHole.peepho... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.list",
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Machine_Semantics_s.machine_state",
"Vale.Transformers.MovMovElim.safe_mov_mov_elim",
"Vale.Transformers.MovMovElim.lemma_mov_mov_is_mov",
"Prims.unit",
"Prims.bool",
"Prims.l_True",
"Prims.squash",
"Vale.Transformers.PeepHole.peephole_co... | [] | false | false | true | false | false | let mov_mov_elim_correct (is: list ins) (s: machine_state)
: Lemma (peephole_correct mov_mov_elim_ph is s) [SMTPat (peephole_correct mov_mov_elim_ph is s)] =
| if safe_mov_mov_elim is
then
(let [i1 ; i2] = is in
lemma_mov_mov_is_mov i1 i2 s) | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.lemma_length_simplifier | val lemma_length_simplifier (s bytes t:seq quad32) (num_bytes:nat) : Lemma
(requires t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\
num_bytes < length s * 16 + 16 /... | val lemma_length_simplifier (s bytes t:seq quad32) (num_bytes:nat) : Lemma
(requires t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\
num_bytes < length s * 16 + 16 /... | let lemma_length_simplifier (s bytes t:seq quad32) (num_bytes:nat) : Lemma
(requires t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\
num_bytes < length s * 16 + 16 /... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 3,
"end_line": 536,
"start_col": 0,
"start_line": 513
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
s: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
t: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
num_bytes: Prims.nat
-> FStar.Pervasives.Lemma
(requires
t ==
(match num_bytes > FStar.Seq.Base.length s * 16 with
| t... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"FStar.Seq.Base.length",
"Prims.bool",
"Prims.unit",
"FStar.Calc.calc_finish",
"Vale.Def.Words_s.nat8",
"Prims.eq2",
"FStar.Seq.Base.slice",
"Vale.Def.Words.Seq_s.seq_nat32_to_seq_nat8_... | [] | false | false | true | false | false | let lemma_length_simplifier (s bytes t: seq quad32) (num_bytes: nat)
: Lemma
(requires
t == (if num_bytes > (length s) * 16 then append s bytes else s) /\
(num_bytes <= (length s) * 16 ==> num_bytes == (length s * 16)) /\
length s * 16 <= num_bytes /\ num_bytes < length s * 16 + 16 /\ ... | if num_bytes > (length s) * 16
then (())
else
(calc ( == ) {
slice (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE (append s bytes))) 0 num_bytes;
( == ) { append_distributes_be_seq_quad32_to_bytes s bytes }
slice (append (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE s))
(seq_nat32_to_seq_... | false |
CDDL.Pulse.fst | CDDL.Pulse.impl_matches_map_group | val impl_matches_map_group : g: CDDL.Spec.map_group (FStar.Ghost.reveal b) -> Type0 | let impl_matches_map_group
(#b: Ghost.erased (option raw_data_item))
(g: map_group b)
=
c: cbor ->
(#p: perm) ->
(#v: Ghost.erased raw_data_item) ->
stt bool
(
raw_data_item_match p c v **
pure (opt_precedes (Ghost.reveal v) b /\ Map? v)
)
(fun res... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 9,
"end_line": 762,
"start_col": 0,
"start_line": 747
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"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 | g: CDDL.Spec.map_group (FStar.Ghost.reveal b) -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Ghost.erased",
"FStar.Pervasives.Native.option",
"CBOR.Spec.Type.raw_data_item",
"CDDL.Spec.map_group",
"FStar.Ghost.reveal",
"CBOR.Pulse.Type.cbor",
"PulseCore.FractionalPermission.perm",
"Pulse.Lib.Core.stt",
"Prims.bool",
"Pulse.Lib.Core.op_Star_Star",
"CBOR.Pulse.Extern.raw_data_item_... | [] | false | false | false | false | true | let impl_matches_map_group (#b: Ghost.erased (option raw_data_item)) (g: map_group b) =
| c: cbor -> #p: perm -> #v: Ghost.erased raw_data_item
-> stt bool
(raw_data_item_match p c v ** pure (opt_precedes (Ghost.reveal v) b /\ Map? v))
(fun res ->
raw_data_item_match p c v **
pure (opt_precedes (Ghost.reveal v) b /\ Map? v /\ res == matches_map_group g (Map?.v v))) | false | |
CDDL.Pulse.fst | CDDL.Pulse.cbor_map_get_with_typ_post | val cbor_map_get_with_typ_post
(t: typ)
(p: perm)
(vkey vmap: raw_data_item)
(map: cbor)
(res: cbor_map_get_t)
: Tot vprop | val cbor_map_get_with_typ_post
(t: typ)
(p: perm)
(vkey vmap: raw_data_item)
(map: cbor)
(res: cbor_map_get_t)
: Tot vprop | let cbor_map_get_with_typ_post
(t: typ)
(p: perm)
(vkey: raw_data_item)
(vmap: raw_data_item)
(map: cbor)
(res: cbor_map_get_t)
: Tot vprop
= match res with
| NotFound ->
raw_data_item_match p map vmap ** pure (
Map? vmap /\
begin match list_ghost_assoc vkey (Map?.v vmap) with
... | {
"file_name": "share/steel/examples/pulse/dice/cbor/CDDL.Pulse.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 66,
"end_line": 646,
"start_col": 0,
"start_line": 625
} | (*
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.Lib.Stick.fsti.checked",
"Pulse.Lib.Reference.fsti.checked",
"Pulse.Lib.Pervasives.fst.checked",
"Pulse.Lib.Array.fsti.checked",
"prims.fst.checked",
"FStar.UInt8.fsti.checked",
"FStar.UInt64.fsti.checked",
"FStar.SizeT.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "FStar.SizeT",
"short_module": "SZ"
},
{
"abbrev": true,
"full_module": "Pulse.Lib.Array",
"short_module": "A"
},
{
"abbrev": true,
"full_module": "FStar.U... | {
"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 |
t: CDDL.Spec.typ ->
p: PulseCore.FractionalPermission.perm ->
vkey: CBOR.Spec.Type.raw_data_item ->
vmap: CBOR.Spec.Type.raw_data_item ->
map: CBOR.Pulse.Type.cbor ->
res: CBOR.Pulse.cbor_map_get_t
-> Pulse.Lib.Core.vprop | Prims.Tot | [
"total"
] | [] | [
"CDDL.Spec.typ",
"PulseCore.FractionalPermission.perm",
"CBOR.Spec.Type.raw_data_item",
"CBOR.Pulse.Type.cbor",
"CBOR.Pulse.cbor_map_get_t",
"Pulse.Lib.Core.op_Star_Star",
"CBOR.Pulse.Extern.raw_data_item_match",
"Pulse.Lib.Core.pure",
"Prims.l_and",
"Prims.b2t",
"CBOR.Spec.Type.uu___is_Map",
... | [] | false | false | false | true | false | let cbor_map_get_with_typ_post
(t: typ)
(p: perm)
(vkey vmap: raw_data_item)
(map: cbor)
(res: cbor_map_get_t)
: Tot vprop =
| match res with
| NotFound ->
raw_data_item_match p map vmap **
pure (Map? vmap /\
(match list_ghost_assoc vkey (Map?.v vmap) with
| None -> True
| Some v -> t v == false))
| Found value ->
exists* vvalue.
(raw_data_item_match p value vvalue **
(raw_data_item_match p value vvalue @==>... | false |
Pulse.C.Types.Base.fsti | Pulse.C.Types.Base.ref | val ref (#t: Type) (td: typedef t) : Tot Type0 | val ref (#t: Type) (td: typedef t) : Tot Type0 | let ref (#t: Type) (td: typedef t) : Tot Type0 = (p: ptr td { ~ (p == null td) }) | {
"file_name": "share/steel/examples/pulse/lib/c/Pulse.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 81,
"end_line": 99,
"start_col": 0,
"start_line": 99
} | module Pulse.C.Types.Base
open Pulse.Lib.Pervasives
/// Helper to compose two permissions into one
val prod_perm (p1 p2: perm) : Pure perm
(requires True)
(ensures (fun p ->
((p1 `lesser_equal_perm` full_perm /\ p2 `lesser_equal_perm` full_perm) ==>
p `lesser_equal_perm` full_perm) /\
p.v == (let open ... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.C.Types.B... | [
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | td: Pulse.C.Types.Base.typedef t -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Pulse.C.Types.Base.typedef",
"Pulse.C.Types.Base.ptr",
"Prims.l_not",
"Prims.eq2",
"Pulse.C.Types.Base.null"
] | [] | false | false | false | true | true | let ref (#t: Type) (td: typedef t) : Tot Type0 =
| (p: ptr td {~(p == null td)}) | false |
Hacl.Impl.P256.Scalar.fsti | Hacl.Impl.P256.Scalar.qmont_as_nat | val qmont_as_nat : h: FStar.Monotonic.HyperStack.mem -> a: Hacl.Impl.P256.Bignum.felem
-> Prims.GTot Spec.P256.PointOps.qelem | let qmont_as_nat (h:mem) (a:felem) = SM.from_qmont (as_nat h a) | {
"file_name": "code/ecdsap256/Hacl.Impl.P256.Scalar.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 19,
"start_col": 0,
"start_line": 19
} | module Hacl.Impl.P256.Scalar
open FStar.Mul
open FStar.HyperStack.All
open FStar.HyperStack
module ST = FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Hacl.Impl.P256.Bignum
module S = Spec.P256
module SM = Hacl.Spec.P256.Montgomery
module BSeq = Lib.ByteSequence
#set-options "--z3rlimit 30 --fuel 0 --i... | {
"checked_file": "/",
"dependencies": [
"Spec.P256.fst.checked",
"prims.fst.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Spec.P256.Montgomery.fsti.checked",
"Hacl.Impl.P256.Bignum.fsti.checked",
"FStar.UInt32.fsti.checked",... | [
{
"abbrev": true,
"full_module": "Lib.ByteSequence",
"short_module": "BSeq"
},
{
"abbrev": true,
"full_module": "Hacl.Spec.P256.Montgomery",
"short_module": "SM"
},
{
"abbrev": true,
"full_module": "Spec.P256",
"short_module": "S"
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | h: FStar.Monotonic.HyperStack.mem -> a: Hacl.Impl.P256.Bignum.felem
-> Prims.GTot Spec.P256.PointOps.qelem | Prims.GTot | [
"sometrivial"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"Hacl.Impl.P256.Bignum.felem",
"Hacl.Spec.P256.Montgomery.from_qmont",
"Hacl.Impl.P256.Bignum.as_nat",
"Spec.P256.PointOps.qelem"
] | [] | false | false | false | false | false | let qmont_as_nat (h: mem) (a: felem) =
| SM.from_qmont (as_nat h a) | false | |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_blocks_helper_dec_simplified | val gcm_blocks_helper_dec_simplified (alg:algorithm) (key:seq nat32)
(p128 p_bytes c128 c_bytes:seq quad32)
(auth_bytes alleged_tag:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE:quad32) : Lemma
(requires // Required by gcm_blocks
... | val gcm_blocks_helper_dec_simplified (alg:algorithm) (key:seq nat32)
(p128 p_bytes c128 c_bytes:seq quad32)
(auth_bytes alleged_tag:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE:quad32) : Lemma
(requires // Required by gcm_blocks
... | let gcm_blocks_helper_dec_simplified (alg:algorithm) (key:seq nat32)
(p128 p_bytes c128 c_bytes:seq quad32)
(auth_bytes alleged_tag:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE:quad32) : Lemma
(requires // Required by gcm_blocks
... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 718,
"start_col": 0,
"start_line": 652
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
c128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
c_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.q... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.nat8",
"Prims.nat",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Prims.unit",
"Vale.AES.GCM_BE.lemma_gcm_encrypt_decrypt_equiv",
"Prims._assert",
"Prims.eq2",
"Vale.Def.Type... | [] | false | false | true | false | false | let gcm_blocks_helper_dec_simplified
(alg: algorithm)
(key: seq nat32)
(p128 p_bytes c128 c_bytes: seq quad32)
(auth_bytes alleged_tag: seq nat8)
(p_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_nu... | gcm_blocks_helper_enc alg key p128 p_bytes c128 c_bytes auth_bytes p_num_bytes iv j0_BE;
let plain_raw_quads = if p_num_bytes > length p128 * 16 then append p128 p_bytes else p128 in
let cipher_raw_quads:seq quad32 =
if p_num_bytes > length p128 * 16 then append c128 c_bytes else c128
in
lemma_length_simplifier p128 ... | false |
Pulse.C.Types.Base.fsti | Pulse.C.Types.Base.ptr | val ptr (#t: Type) (td: typedef t) : Tot Type0 | val ptr (#t: Type) (td: typedef t) : Tot Type0 | let ptr (#t: Type) (td: typedef t) : Tot Type0 = ptr_gen t | {
"file_name": "share/steel/examples/pulse/lib/c/Pulse.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 58,
"end_line": 94,
"start_col": 0,
"start_line": 94
} | module Pulse.C.Types.Base
open Pulse.Lib.Pervasives
/// Helper to compose two permissions into one
val prod_perm (p1 p2: perm) : Pure perm
(requires True)
(ensures (fun p ->
((p1 `lesser_equal_perm` full_perm /\ p2 `lesser_equal_perm` full_perm) ==>
p `lesser_equal_perm` full_perm) /\
p.v == (let open ... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.C.Types.B... | [
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | td: Pulse.C.Types.Base.typedef t -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Pulse.C.Types.Base.typedef",
"Pulse.C.Types.Base.ptr_gen"
] | [] | false | false | false | true | true | let ptr (#t: Type) (td: typedef t) : Tot Type0 =
| ptr_gen t | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_blocks_helper_enc | val gcm_blocks_helper_enc
(alg: algorithm)
(key: seq nat32)
(p128 p_bytes c128 c_bytes: seq quad32)
(auth_bytes: seq nat8)
(p_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_bytes < length p128 *... | val gcm_blocks_helper_enc
(alg: algorithm)
(key: seq nat32)
(p128 p_bytes c128 c_bytes: seq quad32)
(auth_bytes: seq nat8)
(p_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_bytes < length p128 *... | let gcm_blocks_helper_enc (alg:algorithm) (key:seq nat32)
(p128 p_bytes c128 c_bytes:seq quad32)
(auth_bytes:seq nat8)
(p_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE:quad32) : Lemma
(requires // Required by gcm_blocks
length p128 * ... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 251,
"start_col": 0,
"start_line": 146
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
c128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
c_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.q... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Vale.Def.Words_s.nat8",
"Prims.nat",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Prims.unit",
"Vale.AES.GCM_BE.gcm_encrypt_BE_fst_helper",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"FSta... | [] | false | false | true | false | false | let gcm_blocks_helper_enc
(alg: algorithm)
(key: seq nat32)
(p128 p_bytes c128 c_bytes: seq quad32)
(auth_bytes: seq nat8)
(p_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_bytes < length p128 *... | let ctr_BE_2:quad32 = inc32 j0_BE 1 in
let plain:seq quad32 = if p_num_bytes > length p128 * 16 then append p128 p_bytes else p128 in
let cipher:seq quad32 = if p_num_bytes > length p128 * 16 then append c128 c_bytes else c128 in
let cipher_bound:nat = length p128 + (if p_num_bytes > length p128 * 16 then 1 else 0) in
... | false |
Pulse.C.Types.Base.fsti | Pulse.C.Types.Base.typeof | val typeof (#t: Type0) (td: typedef t) : Tot Type0 | val typeof (#t: Type0) (td: typedef t) : Tot Type0 | let typeof (#t: Type0) (td: typedef t) : Tot Type0 = t | {
"file_name": "share/steel/examples/pulse/lib/c/Pulse.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 54,
"end_line": 17,
"start_col": 0,
"start_line": 17
} | module Pulse.C.Types.Base
open Pulse.Lib.Pervasives
/// Helper to compose two permissions into one
val prod_perm (p1 p2: perm) : Pure perm
(requires True)
(ensures (fun p ->
((p1 `lesser_equal_perm` full_perm /\ p2 `lesser_equal_perm` full_perm) ==>
p `lesser_equal_perm` full_perm) /\
p.v == (let open ... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.C.Types.B... | [
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | td: Pulse.C.Types.Base.typedef t -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Pulse.C.Types.Base.typedef"
] | [] | false | false | false | true | true | let typeof (#t: Type0) (td: typedef t) : Tot Type0 =
| t | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.lemma_compute_iv_easy | val lemma_compute_iv_easy (iv_b iv_extra_b:seq quad32) (iv:supported_iv_BE) (num_bytes:nat64) (h_BE j0:quad32) : Lemma
(requires
length iv_extra_b == 1 /\
length iv_b * (128/8) <= num_bytes /\ num_bytes < length iv_b * (128/8) + 128/8 /\
num_bytes == 96/8 /\
(let iv_BE = index iv_extra_b 0 in
j0 ... | val lemma_compute_iv_easy (iv_b iv_extra_b:seq quad32) (iv:supported_iv_BE) (num_bytes:nat64) (h_BE j0:quad32) : Lemma
(requires
length iv_extra_b == 1 /\
length iv_b * (128/8) <= num_bytes /\ num_bytes < length iv_b * (128/8) + 128/8 /\
num_bytes == 96/8 /\
(let iv_BE = index iv_extra_b 0 in
j0 ... | let lemma_compute_iv_easy (iv_b iv_extra_b:seq quad32) (iv:supported_iv_BE) (num_bytes:nat64) (h_BE j0:quad32) : Lemma
(requires
length iv_extra_b == 1 /\
length iv_b * (128/8) <= num_bytes /\ num_bytes < length iv_b * (128/8) + 128/8 /\
num_bytes == 96/8 /\
(let iv_BE = index iv_extra_b 0 in
j0 ... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 99,
"start_col": 0,
"start_line": 43
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
iv_b: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
iv_extra_b: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
iv: Vale.AES.GCM_BE_s.supported_iv_BE ->
num_bytes: Vale.Def.Words_s.nat64 ->
h_BE: Vale.Def.Types_s.quad32 ->
j0: Vale.Def.Types_s.quad32
-> FStar.Pervasives.Lemma
(requires
... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Seq.Base.seq",
"Vale.Def.Types_s.quad32",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Vale.Def.Words_s.nat64",
"Prims.unit",
"FStar.Calc.calc_finish",
"Prims.eq2",
"Vale.AES.GCM_BE_s.compute_iv_BE",
"Prims.Cons",
"FStar.Preorder.relation",
"Prims.Nil",
"FStar.Calc.calc_step",
"Vale.AES.GCM_... | [] | false | false | true | false | false | let lemma_compute_iv_easy
(iv_b iv_extra_b: seq quad32)
(iv: supported_iv_BE)
(num_bytes: nat64)
(h_BE j0: quad32)
: Lemma
(requires
length iv_extra_b == 1 /\ length iv_b * (128 / 8) <= num_bytes /\
num_bytes < length iv_b * (128 / 8) + 128 / 8 /\ num_bytes == 96 / 8 /\... | assert (length iv == 12);
assert (length iv_b == 0);
lemma_empty iv_b;
append_empty_l iv_extra_b;
assert (append iv_b iv_extra_b == iv_extra_b);
let q = index iv_extra_b 0 in
be_seq_quad32_to_bytes_of_singleton q;
assert (equal iv_extra_b (create 1 q));
assert (seq_nat32_to_seq_nat8_BE (seq_four_to_seq_BE iv_extra_b) =... | false |
Pulse.C.Types.Base.fsti | Pulse.C.Types.Base.null | val null (#t: Type) (td: typedef t) : Tot (ptr td) | val null (#t: Type) (td: typedef t) : Tot (ptr td) | let null (#t: Type) (td: typedef t) : Tot (ptr td) = null_gen t | {
"file_name": "share/steel/examples/pulse/lib/c/Pulse.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 63,
"end_line": 96,
"start_col": 0,
"start_line": 96
} | module Pulse.C.Types.Base
open Pulse.Lib.Pervasives
/// Helper to compose two permissions into one
val prod_perm (p1 p2: perm) : Pure perm
(requires True)
(ensures (fun p ->
((p1 `lesser_equal_perm` full_perm /\ p2 `lesser_equal_perm` full_perm) ==>
p `lesser_equal_perm` full_perm) /\
p.v == (let open ... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.C.Types.B... | [
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | td: Pulse.C.Types.Base.typedef t -> Pulse.C.Types.Base.ptr td | Prims.Tot | [
"total"
] | [] | [
"Pulse.C.Types.Base.typedef",
"Pulse.C.Types.Base.null_gen",
"Pulse.C.Types.Base.ptr"
] | [] | false | false | false | false | false | let null (#t: Type) (td: typedef t) : Tot (ptr td) =
| null_gen t | false |
Pulse.C.Types.Base.fsti | Pulse.C.Types.Base.norm_field_steps | val norm_field_steps : Prims.list FStar.Pervasives.norm_step | let norm_field_steps = [
delta_attr [`%norm_field_attr];
iota; zeta; primops;
] | {
"file_name": "share/steel/examples/pulse/lib/c/Pulse.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 1,
"end_line": 356,
"start_col": 0,
"start_line": 353
} | module Pulse.C.Types.Base
open Pulse.Lib.Pervasives
/// Helper to compose two permissions into one
val prod_perm (p1 p2: perm) : Pure perm
(requires True)
(ensures (fun p ->
((p1 `lesser_equal_perm` full_perm /\ p2 `lesser_equal_perm` full_perm) ==>
p `lesser_equal_perm` full_perm) /\
p.v == (let open ... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.C.Types.B... | [
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Prims.list FStar.Pervasives.norm_step | Prims.Tot | [
"total"
] | [] | [
"Prims.Cons",
"FStar.Pervasives.norm_step",
"FStar.Pervasives.delta_attr",
"Prims.string",
"Prims.Nil",
"FStar.Pervasives.iota",
"FStar.Pervasives.zeta",
"FStar.Pervasives.primops"
] | [] | false | false | false | true | false | let norm_field_steps =
| [delta_attr [`%norm_field_attr]; iota; zeta; primops] | false | |
Vale.Transformers.MovMovElim.fst | Vale.Transformers.MovMovElim.lemma_mov_mov_is_mov | val lemma_mov_mov_is_mov (i1 i2: ins) (s: machine_state)
: Lemma (requires (safe_mov_mov_elim [i1; i2]))
(ensures
(let s1 = machine_eval_ins i2 (machine_eval_ins i1 s) in
let s2 = machine_eval_ins i2 s in
s1.ms_ok ==> equiv_states s1 s2)) | val lemma_mov_mov_is_mov (i1 i2: ins) (s: machine_state)
: Lemma (requires (safe_mov_mov_elim [i1; i2]))
(ensures
(let s1 = machine_eval_ins i2 (machine_eval_ins i1 s) in
let s2 = machine_eval_ins i2 s in
s1.ms_ok ==> equiv_states s1 s2)) | let lemma_mov_mov_is_mov (i1 i2:ins) (s:machine_state) :
Lemma
(requires (safe_mov_mov_elim [i1; i2]))
(ensures (
let s1 = machine_eval_ins i2 (machine_eval_ins i1 s) in
let s2 = machine_eval_ins i2 s in
s1.ms_ok ==> equiv_states s1 s2)) =
let Instr ii1 oprs1 (AnnotateMov64 ()) = i1 ... | {
"file_name": "vale/code/lib/transformers/Vale.Transformers.MovMovElim.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 11,
"end_line": 86,
"start_col": 0,
"start_line": 60
} | module Vale.Transformers.MovMovElim
open Vale.X64.Bytes_Code_s
open Vale.X64.Instruction_s
open Vale.X64.Instructions_s
open Vale.X64.Machine_Semantics_s
open Vale.X64.Machine_s
open Vale.X64.Print_s
open Vale.Def.PossiblyMonad
open Vale.Transformers.InstructionReorder
open Vale.X64.InsLemmas
open Vale.Transformers.P... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti.checked",
"Vale.X64.Instruction_s.fsti.checked",
"Vale.X64.InsLemmas.fsti.checked",
"Vale.X64.Bytes_Code_s.... | [
{
"abbrev": true,
"full_module": "Vale.Arch.Heap",
"short_module": "H"
},
{
"abbrev": true,
"full_module": "Vale.Def.Types_s",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Vale.Transformers.PeepHole",
"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 |
i1: Vale.X64.Machine_Semantics_s.ins ->
i2: Vale.X64.Machine_Semantics_s.ins ->
s: Vale.X64.Machine_Semantics_s.machine_state
-> FStar.Pervasives.Lemma (requires Vale.Transformers.MovMovElim.safe_mov_mov_elim [i1; i2])
(ensures
(let s1 =
Vale.X64.Machine_Semantics_s.machine_eval... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.X64.Machine_Semantics_s.ins",
"Vale.X64.Machine_Semantics_s.machine_state",
"Vale.X64.Instruction_s.instr_t_record",
"Vale.X64.Instruction_s.instr_operands_t",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__outs",
"Vale.X64.Instruction_s.__proj__InstrTypeRecord__item__args",
"Vale.X64.Mach... | [] | false | false | true | false | false | let lemma_mov_mov_is_mov (i1 i2: ins) (s: machine_state)
: Lemma (requires (safe_mov_mov_elim [i1; i2]))
(ensures
(let s1 = machine_eval_ins i2 (machine_eval_ins i1 s) in
let s2 = machine_eval_ins i2 s in
s1.ms_ok ==> equiv_states s1 s2)) =
| let Instr ii1 oprs1 (AnnotateMov64 ()) = i1 in
let Instr ii2 oprs2 (AnnotateMov64 ()) = i2 in
let oprs1:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [out op64] [op64]) oprs1
in
let oprs2:normal (instr_operands_t [out op64] [op64]) =
coerce_to_normal #(instr_operands_t [out op64]... | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_blocks_helper_simplified | val gcm_blocks_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | val gcm_blocks_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | let gcm_blocks_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 635,
"start_col": 0,
"start_line": 539
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.q... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Prims.unit",
"Vale.AES.GCM_BE.lemma_length_simplifier",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"FStar.Seq.Base.length",
"FStar.... | [] | false | false | true | false | false | let gcm_blocks_helper_simplified
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p... | gcm_blocks_helper alg key a128 a_bytes p128 p_bytes c128 c_bytes p_num_bytes a_num_bytes iv j0_BE h
enc_hash length_quad;
let auth_raw_quads = if a_num_bytes > (length a128) * 16 then append a128 a_bytes else a128 in
let plain_raw_quads = if p_num_bytes > length p128 * 16 then append p128 p_bytes else p128 in
let cip... | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_blocks_dec_helper_simplified | val gcm_blocks_dec_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | val gcm_blocks_dec_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | let gcm_blocks_dec_helper_simplified (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 1049,
"start_col": 0,
"start_line": 956
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "Vale.AES.GHash_BE",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_m... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.q... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Prims.unit",
"Vale.AES.GCM_BE.lemma_length_simplifier",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"FStar.Seq.Base.length",
"FStar.... | [] | false | false | true | false | false | let gcm_blocks_dec_helper_simplified
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes ... | gcm_blocks_dec_helper alg key a128 a_bytes p128 p_bytes c128 c_bytes p_num_bytes a_num_bytes iv
j0_BE h enc_hash length_quad;
let auth_raw_quads = if a_num_bytes > (length a128) * 16 then append a128 a_bytes else a128 in
let plain_raw_quads = if p_num_bytes > length p128 * 16 then append p128 p_bytes else p128 in
let... | false |
Pruning.fst | Pruning.tau1 | val tau1 : _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | let tau1 =
(fun () -> prune "";
addns "FStar.List";
addns "Prims") | {
"file_name": "examples/native_tactics/Pruning.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 75,
"start_col": 0,
"start_line": 72
} | (*
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.Tactics.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.PredicateExtensionality.fst.checked",... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Stubs.Tactics.V2.Builtins.addns",
"FStar.Stubs.Tactics.V2.Builtins.prune"
] | [] | false | true | false | false | false | let tau1 =
| (fun () ->
prune "";
addns "FStar.List";
addns "Prims") | false | |
Pulse.C.Types.Base.fsti | Pulse.C.Types.Base.pts_to_or_null | val pts_to_or_null
(#t: Type)
(#[@@@ equate_by_smt]td: typedef t)
(p: ptr td)
([@@@ equate_by_smt]v: Ghost.erased t)
: vprop | val pts_to_or_null
(#t: Type)
(#[@@@ equate_by_smt]td: typedef t)
(p: ptr td)
([@@@ equate_by_smt]v: Ghost.erased t)
: vprop | let pts_to_or_null
(#t: Type) (#[@@@equate_by_smt]td: typedef t) (p: ptr td) ([@@@equate_by_smt] v: Ghost.erased t) : vprop
= if FStar.StrongExcludedMiddle.strong_excluded_middle (p == null _)
then emp
else pts_to p v | {
"file_name": "share/steel/examples/pulse/lib/c/Pulse.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 17,
"end_line": 107,
"start_col": 0,
"start_line": 103
} | module Pulse.C.Types.Base
open Pulse.Lib.Pervasives
/// Helper to compose two permissions into one
val prod_perm (p1 p2: perm) : Pure perm
(requires True)
(ensures (fun p ->
((p1 `lesser_equal_perm` full_perm /\ p2 `lesser_equal_perm` full_perm) ==>
p `lesser_equal_perm` full_perm) /\
p.v == (let open ... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.C.Types.B... | [
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | p: Pulse.C.Types.Base.ptr td -> v: FStar.Ghost.erased t -> Pulse.Lib.Core.vprop | Prims.Tot | [
"total"
] | [] | [
"Pulse.C.Types.Base.typedef",
"Pulse.C.Types.Base.ptr",
"FStar.Ghost.erased",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Pulse.C.Types.Base.null",
"Pulse.Lib.Core.emp",
"Prims.bool",
"Pulse.C.Types.Base.pts_to",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | false | false | let pts_to_or_null
(#t: Type)
(#[@@@ equate_by_smt]td: typedef t)
(p: ptr td)
([@@@ equate_by_smt]v: Ghost.erased t)
: vprop =
| if FStar.StrongExcludedMiddle.strong_excluded_middle (p == null _) then emp else pts_to p v | false |
Pruning.fst | Pruning.tau2 | val tau2 : _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | let tau2 =
(fun () ->
prune "";
FStar.Tactics.split ();
(* rev [1;2] == [2;1] *)
addns "FStar.List";
addns "Prims";
smt ();
(* 1 == 1 *)
smt ()) | {
"file_name": "examples/native_tactics/Pruning.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 18,
"end_line": 91,
"start_col": 0,
"start_line": 82
} | (*
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.Tactics.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.PredicateExtensionality.fst.checked",... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.V2.Derived.smt",
"FStar.Stubs.Tactics.V2.Builtins.addns",
"FStar.Tactics.V1.Logic.split",
"FStar.Stubs.Tactics.V2.Builtins.prune"
] | [] | false | true | false | false | false | let tau2 =
| (fun () ->
prune "";
FStar.Tactics.split ();
addns "FStar.List";
addns "Prims";
smt ();
smt ()) | false | |
Pulse.C.Types.Base.fsti | Pulse.C.Types.Base.freeable_or_null | val freeable_or_null (#t: Type) (#td: typedef t) (r: ptr td) : Tot vprop | val freeable_or_null (#t: Type) (#td: typedef t) (r: ptr td) : Tot vprop | let freeable_or_null
(#t: Type)
(#td: typedef t)
(r: ptr td)
: Tot vprop
= if FStar.StrongExcludedMiddle.strong_excluded_middle (r == null _)
then emp
else freeable r | {
"file_name": "share/steel/examples/pulse/lib/c/Pulse.C.Types.Base.fsti",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 17,
"end_line": 259,
"start_col": 0,
"start_line": 252
} | module Pulse.C.Types.Base
open Pulse.Lib.Pervasives
/// Helper to compose two permissions into one
val prod_perm (p1 p2: perm) : Pure perm
(requires True)
(ensures (fun p ->
((p1 `lesser_equal_perm` full_perm /\ p2 `lesser_equal_perm` full_perm) ==>
p `lesser_equal_perm` full_perm) /\
p.v == (let open ... | {
"checked_file": "/",
"dependencies": [
"Pulse.Lib.Pervasives.fst.checked",
"prims.fst.checked",
"FStar.StrongExcludedMiddle.fst.checked",
"FStar.Real.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": false,
"source_file": "Pulse.C.Types.B... | [
{
"abbrev": false,
"full_module": "Pulse.Lib.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_module": "Pulse.C.Types",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: Pulse.C.Types.Base.ptr td -> Pulse.Lib.Core.vprop | Prims.Tot | [
"total"
] | [] | [
"Pulse.C.Types.Base.typedef",
"Pulse.C.Types.Base.ptr",
"FStar.StrongExcludedMiddle.strong_excluded_middle",
"Prims.eq2",
"Pulse.C.Types.Base.null",
"Pulse.Lib.Core.emp",
"Prims.bool",
"Pulse.C.Types.Base.freeable",
"Pulse.Lib.Core.vprop"
] | [] | false | false | false | false | false | let freeable_or_null (#t: Type) (#td: typedef t) (r: ptr td) : Tot vprop =
| if FStar.StrongExcludedMiddle.strong_excluded_middle (r == null _) then emp else freeable r | false |
Steel.ST.HigherReference.fst | Steel.ST.HigherReference.with_local | val with_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: ret_t -> vprop)
(body: (r: ref t) ->
STT ret_t
(pts_to r full_perm init `star` pre)
(fun v -> exists_ (pts_to r full_perm) `star` post v)
)
: STF ret_t pre post True (fun _ -> True) | val with_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: ret_t -> vprop)
(body: (r: ref t) ->
STT ret_t
(pts_to r full_perm init `star` pre)
(fun v -> exists_ (pts_to r full_perm) `star` post v)
)
: STF ret_t pre post True (fun _ -> True) | let with_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: ret_t -> vprop)
(body: (r: ref t) ->
STT ret_t
(pts_to r full_perm init `star` pre)
(fun v -> exists_ (pts_to r full_perm) `star` post v)
)
: STF ret_t pre post True (fun _ -> True)
= _push_frame ();
let r = _alloca ini... | {
"file_name": "lib/steel/Steel.ST.HigherReference.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 10,
"end_line": 145,
"start_col": 0,
"start_line": 128
} | (*
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.ST.Util.fsti.checked",
"Steel.ST.Coercions.fsti.checked",
"Steel.HigherReference.fsti.checked",
"prims.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.HigherRef... | [
{
"abbrev": true,
"full_module": "Steel.HigherReference",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Steel.ST.Coercions",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"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 | init: t -> body: (r: Steel.ST.HigherReference.ref t -> Steel.ST.Effect.STT ret_t)
-> Steel.ST.Effect.STF ret_t | Steel.ST.Effect.STF | [] | [] | [
"Steel.Effect.Common.vprop",
"Steel.ST.HigherReference.ref",
"Steel.Effect.Common.star",
"Steel.ST.HigherReference.pts_to",
"Steel.FractionalPermission.full_perm",
"Steel.ST.Util.exists_",
"Steel.ST.Util.return",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Pr... | [] | false | true | false | false | false | let with_local
(#t: Type)
(init: t)
(#pre: vprop)
(#ret_t: Type)
(#post: (ret_t -> vprop))
(body:
(r: ref t
-> STT ret_t
((pts_to r full_perm init) `star` pre)
(fun v -> (exists_ (pts_to r full_perm)) `star` (post v))))
... | _push_frame ();
let r = _alloca init in
let v = body r in
let _ = elim_exists () in
_free_and_pop_frame r;
return v | false |
FStar.Fin.fst | FStar.Fin.is_reflexive | val is_reflexive (#a:Type) (r: binary_relation a) : Type0 | val is_reflexive (#a:Type) (r: binary_relation a) : Type0 | let is_reflexive #a r = forall (x:a). x `r` x | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 58,
"start_col": 0,
"start_line": 58
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Fin.binary_relation a -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Fin.binary_relation",
"Prims.l_Forall",
"Prims.b2t"
] | [] | false | false | false | true | true | let is_reflexive #a r =
| forall (x: a). x `r` x | false |
FStar.Fin.fst | FStar.Fin.is_symmetric | val is_symmetric (#a:Type) (r: binary_relation a) : Type0 | val is_symmetric (#a:Type) (r: binary_relation a) : Type0 | let is_symmetric #a r = forall (x y:a). x `r` y == y `r` x | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 61,
"start_col": 0,
"start_line": 61
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Fin.binary_relation a -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Fin.binary_relation",
"Prims.l_Forall",
"Prims.eq2",
"Prims.bool"
] | [] | false | false | false | true | true | let is_symmetric #a r =
| forall (x: a) (y: a). x `r` y == y `r` x | false |
Pruning.fst | Pruning.f | val f : x: FStar.Integers.int -> Prims.unit | let f (x:int) = assert (x + 1 == 1 + x) | {
"file_name": "examples/native_tactics/Pruning.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 69,
"start_col": 0,
"start_line": 69
} | (*
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.Tactics.fst.checked",
"FStar.Reflection.V2.fst.checked",
"FStar.PropositionalExtensionality.fst.checked",
"FStar.PredicateExtensionality.fst.checked",... | [
{
"abbrev": false,
"full_module": "FStar.List",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Tactics.V2",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Reflection.V2",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | x: FStar.Integers.int -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"FStar.Integers.int",
"Prims._assert",
"Prims.eq2",
"FStar.Integers.int_t",
"FStar.Integers.Signed",
"FStar.Integers.Winfinite",
"FStar.Integers.op_Plus",
"Prims.unit"
] | [] | false | false | false | true | false | let f (x: int) =
| assert (x + 1 == 1 + x) | false | |
FStar.Fin.fst | FStar.Fin.is_transitive | val is_transitive (#a:Type) (r: binary_relation a) : Type0 | val is_transitive (#a:Type) (r: binary_relation a) : Type0 | let is_transitive #a r = forall (x y z:a). x `r` y /\ y `r` z ==> x `r` z | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 73,
"end_line": 64,
"start_col": 0,
"start_line": 64
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Fin.binary_relation a -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Fin.binary_relation",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.l_and",
"Prims.b2t"
] | [] | false | false | false | true | true | let is_transitive #a r =
| forall (x: a) (y: a) (z: a). x `r` y /\ y `r` z ==> x `r` z | false |
FStar.Fin.fst | FStar.Fin.find | val find (#a: Type) (s: S.seq a) (p: (a -> bool)) (i: under (S.length s))
: Pure (option (in_ s))
(requires True)
(ensures (function
| None -> (forall (k: nat{i <= k /\ k < S.length s}). p (S.index s k) == false)
| Some j -> i <= j /\ p (S.index s j)))
(decreases (S... | val find (#a: Type) (s: S.seq a) (p: (a -> bool)) (i: under (S.length s))
: Pure (option (in_ s))
(requires True)
(ensures (function
| None -> (forall (k: nat{i <= k /\ k < S.length s}). p (S.index s k) == false)
| Some j -> i <= j /\ p (S.index s j)))
(decreases (S... | let rec find (#a: Type) (s: S.seq a) (p: (a -> bool)) (i: under (S.length s)) =
if p (S.index s i)
then Some i
else if i + 1 < S.length s
then find #a s p (i + 1)
else None | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 16,
"end_line": 41,
"start_col": 0,
"start_line": 36
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.Seq.Base.seq a -> p: (_: a -> Prims.bool) -> i: FStar.Fin.under (FStar.Seq.Base.length s)
-> Prims.Pure (FStar.Pervasives.Native.option (FStar.Fin.in_ s)) | Prims.Pure | [
""
] | [] | [
"FStar.Seq.Base.seq",
"Prims.bool",
"FStar.Fin.under",
"FStar.Seq.Base.length",
"FStar.Seq.Base.index",
"FStar.Pervasives.Native.Some",
"FStar.Fin.in_",
"Prims.op_LessThan",
"Prims.op_Addition",
"FStar.Fin.find",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.option"
] | [
"recursion"
] | false | false | false | false | false | let rec find (#a: Type) (s: S.seq a) (p: (a -> bool)) (i: under (S.length s)) =
| if p (S.index s i) then Some i else if i + 1 < S.length s then find #a s p (i + 1) else None | false |
Hacl.Impl.Blake2.Generic.fst | Hacl.Impl.Blake2.Generic.blake2_init | val blake2_init:
#al:Spec.alg
-> #ms:m_spec
-> blake2_init_st al ms | val blake2_init:
#al:Spec.alg
-> #ms:m_spec
-> blake2_init_st al ms | let blake2_init #al #ms hash kk nn =
push_frame ();
let h0 = ST.get() in
let tmp = create 8ul (Spec.nat_to_word al 0) in
let r0 = rowi hash 0ul in
let r1 = rowi hash 1ul in
let r2 = rowi hash 2ul in
let r3 = rowi hash 3ul in
let iv0 = get_iv al 0ul in
let iv1 = get_iv al 1ul in
let iv2 = get_iv al 2... | {
"file_name": "code/blake2/Hacl.Impl.Blake2.Generic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 818,
"start_col": 0,
"start_line": 774
} | module Hacl.Impl.Blake2.Generic
open FStar.Mul
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.LoopCombinators
module ST = FStar.HyperStack.ST
module Seq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Spec = Spec.Blake2
open Hacl.Impl.Blake2.Co... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": false,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Blake2.Constants",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Hacl.Impl.Blake2.Generic.blake2_init_st al ms | Prims.Tot | [
"total"
] | [] | [
"Spec.Blake2.Definitions.alg",
"Hacl.Impl.Blake2.Core.m_spec",
"Hacl.Impl.Blake2.Core.state_p",
"Lib.IntTypes.size_t",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"Lib.IntTypes.v",
"Lib.IntTypes.U32",
"Lib.IntTypes.PUB",
"Spec.Blake2.Definitions.max_key",
"Prims.l_and",
"Spec.Blake2.Definitions.m... | [] | false | false | false | false | false | let blake2_init #al #ms hash kk nn =
| push_frame ();
let h0 = ST.get () in
let tmp = create 8ul (Spec.nat_to_word al 0) in
let r0 = rowi hash 0ul in
let r1 = rowi hash 1ul in
let r2 = rowi hash 2ul in
let r3 = rowi hash 3ul in
let iv0 = get_iv al 0ul in
let iv1 = get_iv al 1ul in
let iv2 = get_iv al 2ul in
let iv3 = get_iv al 3ul in
let iv4 = get_iv al 4ul... | false |
FStar.Fin.fst | FStar.Fin.is_reflexive_intro | val is_reflexive_intro (#a:Type) (r: binary_relation a)
: Lemma (requires forall (x:a). r x x) (ensures is_reflexive r) | val is_reflexive_intro (#a:Type) (r: binary_relation a)
: Lemma (requires forall (x:a). r x x) (ensures is_reflexive r) | let is_reflexive_intro #a r = reveal_opaque (`%is_reflexive) (is_reflexive #a) | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 78,
"end_line": 66,
"start_col": 0,
"start_line": 66
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Fin.binary_relation a
-> FStar.Pervasives.Lemma (requires forall (x: a). r x x) (ensures FStar.Fin.is_reflexive r) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.binary_relation",
"FStar.Pervasives.reveal_opaque",
"FStar.Fin.is_reflexive",
"Prims.unit"
] | [] | true | false | true | false | false | let is_reflexive_intro #a r =
| reveal_opaque (`%is_reflexive) (is_reflexive #a) | false |
FStar.Fin.fst | FStar.Fin.is_symmetric_intro | val is_symmetric_intro (#a:Type) (r: binary_relation a)
: Lemma (requires forall (x:a). r x x) (ensures is_reflexive r) | val is_symmetric_intro (#a:Type) (r: binary_relation a)
: Lemma (requires forall (x:a). r x x) (ensures is_reflexive r) | let is_symmetric_intro #a r = reveal_opaque (`%is_reflexive) (is_reflexive #a) | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 78,
"end_line": 68,
"start_col": 0,
"start_line": 68
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Fin.binary_relation a
-> FStar.Pervasives.Lemma (requires forall (x: a). r x x) (ensures FStar.Fin.is_reflexive r) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.binary_relation",
"FStar.Pervasives.reveal_opaque",
"FStar.Fin.is_reflexive",
"Prims.unit"
] | [] | true | false | true | false | false | let is_symmetric_intro #a r =
| reveal_opaque (`%is_reflexive) (is_reflexive #a) | false |
FStar.Fin.fst | FStar.Fin.is_transitive_intro | val is_transitive_intro (#a:Type) (r: binary_relation a)
: Lemma (requires forall (x:a). r x x) (ensures is_reflexive r) | val is_transitive_intro (#a:Type) (r: binary_relation a)
: Lemma (requires forall (x:a). r x x) (ensures is_reflexive r) | let is_transitive_intro #a r = reveal_opaque (`%is_reflexive) (is_reflexive #a) | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 79,
"end_line": 70,
"start_col": 0,
"start_line": 70
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | r: FStar.Fin.binary_relation a
-> FStar.Pervasives.Lemma (requires forall (x: a). r x x) (ensures FStar.Fin.is_reflexive r) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.binary_relation",
"FStar.Pervasives.reveal_opaque",
"FStar.Fin.is_reflexive",
"Prims.unit"
] | [] | true | false | true | false | false | let is_transitive_intro #a r =
| reveal_opaque (`%is_reflexive) (is_reflexive #a) | false |
FStar.Fin.fst | FStar.Fin.pigeonhole | val pigeonhole (#n: pos) (s: S.seq (under n))
: Pure (in_ s * in_ s)
(requires S.length s = n + 1)
(ensures (fun (i1, i2) -> i1 < i2 /\ S.index s i1 = S.index s i2))
(decreases n) | val pigeonhole (#n: pos) (s: S.seq (under n))
: Pure (in_ s * in_ s)
(requires S.length s = n + 1)
(ensures (fun (i1, i2) -> i1 < i2 /\ S.index s i1 = S.index s i2))
(decreases n) | let rec pigeonhole (#n: pos) (s: S.seq (under n)) =
if n = 1 then (0, 1)
else let k0 = S.index s 0 in
match find s (fun k -> k = k0) 1 with
| Some i -> 0, i
| None -> let (i1,i2) =
pigeonhole (S.init #(under (n-1)) n
(fun i -> let k = S.index s (... | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 55,
"start_col": 0,
"start_line": 46
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | s: FStar.Seq.Base.seq (FStar.Fin.under n) -> Prims.Pure (FStar.Fin.in_ s * FStar.Fin.in_ s) | Prims.Pure | [
""
] | [] | [
"Prims.pos",
"FStar.Seq.Base.seq",
"FStar.Fin.under",
"Prims.op_Equality",
"Prims.int",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Fin.in_",
"Prims.bool",
"FStar.Fin.find",
"Prims.op_Subtraction",
"FStar.Seq.Base.init",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.Seq.Base.index... | [
"recursion"
] | false | false | false | false | false | let rec pigeonhole (#n: pos) (s: S.seq (under n)) =
| if n = 1
then (0, 1)
else
let k0 = S.index s 0 in
match find s (fun k -> k = k0) 1 with
| Some i -> 0, i
| None ->
let i1, i2 =
pigeonhole (S.init #(under (n - 1))
n
(fun i ->
let k = S.index s (i + 1) in
if k < k0 then k else k - 1))
in
... | false |
FStar.Fin.fst | FStar.Fin.symm_lemma | val symm_lemma (#a:Type) (eq:equivalence_relation a) (x y:a)
: Lemma (eq x y == eq y x) | val symm_lemma (#a:Type) (eq:equivalence_relation a) (x y:a)
: Lemma (eq x y == eq y x) | let symm_lemma #a _ _ _ = reveal_opaque (`%is_symmetric) (is_symmetric #a) | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 74,
"start_col": 0,
"start_line": 74
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | eq: FStar.Fin.equivalence_relation a -> x: a -> y: a
-> FStar.Pervasives.Lemma (ensures eq x y == eq y x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Pervasives.reveal_opaque",
"FStar.Fin.binary_relation",
"FStar.Fin.is_symmetric",
"Prims.unit"
] | [] | true | false | true | false | false | let symm_lemma #a _ _ _ =
| reveal_opaque (`%is_symmetric) (is_symmetric #a) | false |
FStar.Fin.fst | FStar.Fin.refl_lemma | val refl_lemma (#a:Type) (eq: equivalence_relation a) (x:a)
: Lemma (eq x x) | val refl_lemma (#a:Type) (eq: equivalence_relation a) (x:a)
: Lemma (eq x x) | let refl_lemma #a _ _ = reveal_opaque (`%is_reflexive) (is_reflexive #a) | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 72,
"start_col": 0,
"start_line": 72
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | eq: FStar.Fin.equivalence_relation a -> x: a -> FStar.Pervasives.Lemma (ensures eq x x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Pervasives.reveal_opaque",
"FStar.Fin.binary_relation",
"FStar.Fin.is_reflexive",
"Prims.unit"
] | [] | true | false | true | false | false | let refl_lemma #a _ _ =
| reveal_opaque (`%is_reflexive) (is_reflexive #a) | false |
FStar.Fin.fst | FStar.Fin.trans_lemma | val trans_lemma (#a:Type) (eq: equivalence_relation a) (x y z:a)
: Lemma (requires (eq x y \/ eq y x) /\ (eq y z \/ eq z y))
(ensures (x `eq` z) && (z `eq` x)) | val trans_lemma (#a:Type) (eq: equivalence_relation a) (x y z:a)
: Lemma (requires (eq x y \/ eq y x) /\ (eq y z \/ eq z y))
(ensures (x `eq` z) && (z `eq` x)) | let trans_lemma #a _ _ _ _ = reveal_opaque (`%is_transitive) (is_transitive #a);
reveal_opaque (`%is_symmetric) (is_symmetric #a) | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 77,
"end_line": 77,
"start_col": 0,
"start_line": 76
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | eq: FStar.Fin.equivalence_relation a -> x: a -> y: a -> z: a
-> FStar.Pervasives.Lemma (requires (eq x y \/ eq y x) /\ (eq y z \/ eq z y))
(ensures eq x z && eq z x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Pervasives.reveal_opaque",
"FStar.Fin.binary_relation",
"FStar.Fin.is_symmetric",
"Prims.unit",
"FStar.Fin.is_transitive"
] | [] | true | false | true | false | false | let trans_lemma #a _ _ _ _ =
| reveal_opaque (`%is_transitive) (is_transitive #a);
reveal_opaque (`%is_symmetric) (is_symmetric #a) | false |
Steel.ST.Array.Util.fst | Steel.ST.Array.Util.array_literal | val array_literal
(#a:Type0)
(n:US.t)
(f:(i:US.t{US.v i < US.v n} -> a))
: ST (A.array a)
emp
(fun arr ->
A.pts_to arr full_perm (Seq.init (US.v n) (fun i -> f (US.uint_to_t i))))
(requires US.v n > 0)
(ensures fun arr -> A.length arr == US.v n) | val array_literal
(#a:Type0)
(n:US.t)
(f:(i:US.t{US.v i < US.v n} -> a))
: ST (A.array a)
emp
(fun arr ->
A.pts_to arr full_perm (Seq.init (US.v n) (fun i -> f (US.uint_to_t i))))
(requires US.v n > 0)
(ensures fun arr -> A.length arr == US.v n) | let array_literal #a n f =
let arr = A.alloc (f 0sz) n in
intro_pure
(array_literal_inv_pure n f 1 (Seq.create (US.v n) (f 0sz)));
intro_exists
(Seq.create (US.v n) (f 0sz))
(array_literal_inv n arr f 1);
Loops.for_loop
1sz
n
(fun i -> exists_ (array_literal_inv n arr f i))
(array_... | {
"file_name": "lib/steel/Steel.ST.Array.Util.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 12,
"end_line": 100,
"start_col": 0,
"start_line": 80
} | (*
Copyright 2021 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... | {
"checked_file": "/",
"dependencies": [
"Steel.ST.Util.fsti.checked",
"Steel.ST.Reference.fsti.checked",
"Steel.ST.Loops.fsti.checked",
"Steel.ST.Effect.fsti.checked",
"Steel.ST.Array.fsti.checked",
"Steel.FractionalPermission.fst.checked",
"prims.fst.checked",
"FStar.SizeT.fsti.che... | [
{
"abbrev": true,
"full_module": "Steel.ST.Loops",
"short_module": "Loops"
},
{
"abbrev": true,
"full_module": "Steel.ST.Reference",
"short_module": "R"
},
{
"abbrev": false,
"full_module": "Steel.ST.Util",
"short_module": null
},
{
"abbrev": false,
"full_modu... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: FStar.SizeT.t -> f: (i: FStar.SizeT.t{FStar.SizeT.v i < FStar.SizeT.v n} -> a)
-> Steel.ST.Effect.ST (Steel.ST.Array.array a) | Steel.ST.Effect.ST | [] | [] | [
"FStar.SizeT.t",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.SizeT.v",
"Steel.ST.Util.return",
"Steel.ST.Array.array",
"FStar.Ghost.hide",
"FStar.Set.set",
"Steel.Memory.iname",
"FStar.Set.empty",
"Steel.ST.Array.pts_to",
"Steel.FractionalPermission.full_perm",
"FStar.Seq.Base.init",
"Prims.n... | [] | false | true | false | false | false | let array_literal #a n f =
| let arr = A.alloc (f 0sz) n in
intro_pure (array_literal_inv_pure n f 1 (Seq.create (US.v n) (f 0sz)));
intro_exists (Seq.create (US.v n) (f 0sz)) (array_literal_inv n arr f 1);
Loops.for_loop 1sz
n
(fun i -> exists_ (array_literal_inv n arr f i))
(array_literal_loop_body n arr f);
let s = elim_exists () in
A.pts... | false |
FStar.Fin.fst | FStar.Fin.contains_eq_means_nonempty | val contains_eq_means_nonempty (#a:Type) (eq:equivalence_relation a) (s: S.seq a) (x:a)
: Lemma (requires contains_eq eq s x)
(ensures S.length s > 0)
[SMTPat(contains_eq eq s x)] | val contains_eq_means_nonempty (#a:Type) (eq:equivalence_relation a) (s: S.seq a) (x:a)
: Lemma (requires contains_eq eq s x)
(ensures S.length s > 0)
[SMTPat(contains_eq eq s x)] | let contains_eq_means_nonempty #a (eq:equivalence_relation a) (s: S.seq a) (x:a)
: Lemma (requires contains_eq eq s x)
(ensures S.length s > 0)
[SMTPat(contains_eq eq s x)]
= reveal_opaque (`%contains_eq) (contains_eq eq) | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 84,
"start_col": 0,
"start_line": 80
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | eq: FStar.Fin.equivalence_relation a -> s: FStar.Seq.Base.seq a -> x: a
-> FStar.Pervasives.Lemma (requires FStar.Fin.contains_eq eq s x)
(ensures FStar.Seq.Base.length s > 0)
[SMTPat (FStar.Fin.contains_eq eq s x)] | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Seq.Base.seq",
"FStar.Pervasives.reveal_opaque",
"Prims.logical",
"FStar.Fin.contains_eq",
"Prims.unit",
"Prims.squash",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"Prims.Cons",
"FStar.Pervasives.pattern",
"FStar.Pervasives.smt_pat"... | [] | true | false | true | false | false | let contains_eq_means_nonempty #a (eq: equivalence_relation a) (s: S.seq a) (x: a)
: Lemma (requires contains_eq eq s x) (ensures S.length s > 0) [SMTPat (contains_eq eq s x)] =
| reveal_opaque (`%contains_eq) (contains_eq eq) | false |
FStar.Fin.fst | FStar.Fin.find_eq | val find_eq (#a:Type) (eq:equivalence_relation a) (s: S.seq a) (x:a { contains_eq eq s x })
: (i: nat { (i < S.length s)
/\ (x `eq` S.index s i)
/\ (forall (j: under i). not (x `eq` S.index s j)) }) | val find_eq (#a:Type) (eq:equivalence_relation a) (s: S.seq a) (x:a { contains_eq eq s x })
: (i: nat { (i < S.length s)
/\ (x `eq` S.index s i)
/\ (forall (j: under i). not (x `eq` S.index s j)) }) | let rec find_eq #a (eq:equivalence_relation a) (s: S.seq a)
(x:a { contains_eq eq s x })
: Tot (i: nat { (i < S.length s) /\
(x `eq` S.index s i) /\
(forall (j: under i). not (x `eq` S.index s j)) })
(decreases S.length s)
= reveal_opaque (`%contains_e... | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 116,
"start_col": 0,
"start_line": 98
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
eq: FStar.Fin.equivalence_relation a ->
s: FStar.Seq.Base.seq a ->
x: a{FStar.Fin.contains_eq eq s x}
-> Prims.Tot
(i:
Prims.nat
{ i < FStar.Seq.Base.length s /\ eq x (FStar.Seq.Base.index s i) /\
(forall (j: FStar.Fin.under i). Prims.op_Negation (eq x (FStar.Seq.Base.index s ... | Prims.Tot | [
"",
"total"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Seq.Base.seq",
"FStar.Fin.contains_eq",
"Prims.op_Equality",
"Prims.int",
"FStar.Seq.Base.length",
"Prims.bool",
"FStar.Seq.Base.index",
"Prims.op_Addition",
"Prims.unit",
"FStar.Classical.forall_intro",
"FStar.Fin.under",
"Prims.b2t",
"Prims.op_Neg... | [
"recursion"
] | false | false | false | false | false | let rec find_eq #a (eq: equivalence_relation a) (s: S.seq a) (x: a{contains_eq eq s x})
: Tot
(i:
nat
{ (i < S.length s) /\ (x `eq` (S.index s i)) /\
(forall (j: under i). not (x `eq` (S.index s j))) }) (decreases S.length s) =
| reveal_opaque (`%contains_eq) (contains_eq eq);
if S.length s = 1
then 0
else
if x `eq` (S.index s 0)
then 0
else
(tail_contains_eq eq s x;
let ieq = find_eq eq (S.tail s) x in
let aux (i: under (1 + ieq)) : Lemma (not (x `eq` (S.index s i))) =
if i > 0 then assert (S.index (S.tail s) (i -... | false |
FStar.Fin.fst | FStar.Fin.tail_contains_eq | val tail_contains_eq
(#a: _)
(eq: equivalence_relation a)
(s: S.seq a)
(x: a{contains_eq eq s x /\ ~(eq x (S.head s))})
: Lemma (contains_eq eq (S.tail s) x) | val tail_contains_eq
(#a: _)
(eq: equivalence_relation a)
(s: S.seq a)
(x: a{contains_eq eq s x /\ ~(eq x (S.head s))})
: Lemma (contains_eq eq (S.tail s) x) | let tail_contains_eq #a (eq: equivalence_relation a) (s:S.seq a)
(x:a { contains_eq eq s x /\ ~(eq x (S.head s)) })
: Lemma (contains_eq eq (S.tail s) x)
= let t = S.tail s in
reveal_opaque (`%contains_eq) (contains_eq eq);
eliminate exists (i: under (S.length s)). eq x (S.inde... | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 93,
"start_col": 0,
"start_line": 86
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
eq: FStar.Fin.equivalence_relation a ->
s: FStar.Seq.Base.seq a ->
x: a{FStar.Fin.contains_eq eq s x /\ ~(eq x (FStar.Seq.Properties.head s))}
-> FStar.Pervasives.Lemma (ensures FStar.Fin.contains_eq eq (FStar.Seq.Properties.tail s) x) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Seq.Base.seq",
"Prims.l_and",
"FStar.Fin.contains_eq",
"Prims.l_not",
"Prims.b2t",
"FStar.Seq.Properties.head",
"FStar.Classical.Sugar.exists_elim",
"FStar.Fin.under",
"FStar.Seq.Base.length",
"FStar.Seq.Base.index",
"Prims.l_Exists",
"Prims.squash",
... | [] | false | false | true | false | false | let tail_contains_eq
#a
(eq: equivalence_relation a)
(s: S.seq a)
(x: a{contains_eq eq s x /\ ~(eq x (S.head s))})
: Lemma (contains_eq eq (S.tail s) x) =
| let t = S.tail s in
reveal_opaque (`%contains_eq) (contains_eq eq);
eliminate exists (i: under (S.length s)).
eq x (S.index s i)
returns exists (k: under (S.length t)). eq x (S.index t k)
with _.
assert (S.index s i == S.index t (i - 1)) | false |
Clear.fst | Clear.l1 | val l1 : x: Prims.bool -> y: Prims.int -> z: Prims.unit -> Prims.unit | let l1 (x : bool) (y : int) (z : unit) =
assert (phi ==> (psi ==> xi)) by tau1 () | {
"file_name": "examples/native_tactics/Clear.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 35,
"start_col": 0,
"start_line": 34
} | (*
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.List.fst.checked"
],
"interface_file": false,
"source_file": "Clear.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.bool -> y: Prims.int -> z: Prims.unit -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.int",
"Prims.unit",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Clear.phi",
"Clear.psi",
"Clear.xi",
"Clear.tau1"
] | [] | false | false | false | true | false | let l1 (x: bool) (y: int) (z: unit) =
| FStar.Tactics.Effect.assert_by_tactic (phi ==> (psi ==> xi))
(fun _ ->
();
tau1 ()) | false | |
Clear.fst | Clear.tau1 | val tau1 : _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | let tau1 = fun () ->
let _ = implies_intro () in
clear_top ();
let _ = implies_intro () in
clear_top ();
exact (`p) | {
"file_name": "examples/native_tactics/Clear.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 32,
"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.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.fst.checked"
],
"interface_file": false,
"source_file": "Clear.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.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.V2.Derived.exact",
"FStar.Stubs.Tactics.V2.Builtins.clear_top",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.implies_intro"
] | [] | false | true | false | false | false | let tau1 =
| fun () ->
let _ = implies_intro () in
clear_top ();
let _ = implies_intro () in
clear_top ();
exact (`p) | false | |
Clear.fst | Clear.tau2 | val tau2 : _: Prims.unit -> FStar.Tactics.Effect.Tac Prims.unit | let tau2 = fun () -> let e = cur_env () in
let n = List.length (vars_of_env e) in
let u = `int in
clear_all_of_type u;
let e = cur_env () in
// We're removing two binders
guard (List... | {
"file_name": "examples/native_tactics/Clear.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 66,
"end_line": 57,
"start_col": 0,
"start_line": 51
} | (*
Copyright 2008-2018 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.List.fst.checked"
],
"interface_file": false,
"source_file": "Clear.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.unit -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"Prims.unit",
"FStar.Tactics.V2.Derived.guard",
"Prims.op_Equality",
"Prims.int",
"FStar.List.Tot.Base.length",
"FStar.Stubs.Reflection.V2.Data.binding",
"FStar.Stubs.Reflection.V2.Builtins.vars_of_env",
"Prims.op_Subtraction",
"FStar.Stubs.Reflection.Types.env",
"FStar.Tactics.V2.Derived.cur_env"... | [] | false | true | false | false | false | let tau2 =
| fun () ->
let e = cur_env () in
let n = List.length (vars_of_env e) in
let u = `int in
clear_all_of_type u;
let e = cur_env () in
guard (List.length (vars_of_env e) = n - 2) | false | |
Clear.fst | Clear.clear_all_of_type | val clear_all_of_type (t: typ) : Tac unit | val clear_all_of_type (t: typ) : Tac unit | let clear_all_of_type (t : typ) : Tac unit =
let e = cur_env () in
let bs = vars_of_env e in
let _ = map (fun b -> if term_eq (type_of_binding b) t
then clear b
else ())
// We need to traverse the list backwards, to clear rightmost
// bin... | {
"file_name": "examples/native_tactics/Clear.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 6,
"end_line": 48,
"start_col": 0,
"start_line": 38
} | (*
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.List.fst.checked"
],
"interface_file": false,
"source_file": "Clear.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 | t: FStar.Stubs.Reflection.Types.typ -> FStar.Tactics.Effect.Tac Prims.unit | FStar.Tactics.Effect.Tac | [] | [] | [
"FStar.Stubs.Reflection.Types.typ",
"Prims.unit",
"Prims.list",
"FStar.Tactics.Util.map",
"FStar.Stubs.Reflection.V2.Data.binding",
"FStar.Stubs.Reflection.V2.Builtins.term_eq",
"FStar.Tactics.V2.Derived.type_of_binding",
"FStar.Stubs.Tactics.V2.Builtins.clear",
"Prims.bool",
"FStar.List.Tot.Base.... | [] | false | true | false | false | false | let clear_all_of_type (t: typ) : Tac unit =
| let e = cur_env () in
let bs = vars_of_env e in
let _ = map (fun b -> if term_eq (type_of_binding b) t then clear b) (List.rev bs) in
() | false |
FStar.Fin.fst | FStar.Fin.pigeonhole_eq | val pigeonhole_eq (#a:Type) (eq: equivalence_relation a)
(holes: S.seq a{S.length holes > 0})
(pigeons: S.seq (items_of eq holes))
: Pure (under (S.length pigeons) * under (S.length pigeons))
(requires S.length pigeons > S.length holes)
(ensu... | val pigeonhole_eq (#a:Type) (eq: equivalence_relation a)
(holes: S.seq a{S.length holes > 0})
(pigeons: S.seq (items_of eq holes))
: Pure (under (S.length pigeons) * under (S.length pigeons))
(requires S.length pigeons > S.length holes)
(ensu... | let rec pigeonhole_eq (#a:Type) (eq: equivalence_relation a)
(holes: S.seq a{S.length holes > 0})
(pigeons: S.seq (items_of eq holes)) =
if S.length holes = 1
then begin
reveal_opaque (`%contains_eq) (contains_eq eq);
trans_lemma eq (S.index pigeons 0) (S... | {
"file_name": "ulib/FStar.Fin.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 161,
"start_col": 0,
"start_line": 128
} | (*
Copyright 2008-2022 Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agre... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Seq.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.Sugar.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "FStar.Fin.fst"
... | [
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.Seq",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "FStar.List.Tot",
"short_module": "L"
},
{
"abbrev": false,
"full_module": "FStar",
"... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
eq: FStar.Fin.equivalence_relation a ->
holes: FStar.Seq.Base.seq a {FStar.Seq.Base.length holes > 0} ->
pigeons: FStar.Seq.Base.seq (FStar.Fin.items_of eq holes)
-> Prims.Pure
(FStar.Fin.under (FStar.Seq.Base.length pigeons) *
FStar.Fin.under (FStar.Seq.Base.length pigeons)) | Prims.Pure | [
""
] | [] | [
"FStar.Fin.equivalence_relation",
"FStar.Seq.Base.seq",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.Seq.Base.length",
"FStar.Fin.items_of",
"Prims.op_Equality",
"Prims.int",
"FStar.Pervasives.Native.Mktuple2",
"FStar.Fin.under",
"Prims.unit",
"FStar.Fin.trans_lemma",
"FStar.Seq.Base.index",
... | [
"recursion"
] | false | false | false | false | false | let rec pigeonhole_eq
(#a: Type)
(eq: equivalence_relation a)
(holes: S.seq a {S.length holes > 0})
(pigeons: S.seq (items_of eq holes))
=
| if S.length holes = 1
then
(reveal_opaque (`%contains_eq) (contains_eq eq);
trans_lemma eq (S.index pigeons 0) (S.index holes 0) (S.index pigeons 1);
(0, 1))
else
let first_pigeon = S.index pigeons 0 in
match find pigeons (fun k -> eq k first_pigeon) 1 with
| Some i ->
(symm_lemma eq (S.index pigeon... | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.equational | val equational (t: term) : bool | val equational (t: term) : bool | let equational (t:term) : bool =
match t.t with
| Tm_FStar host_term ->
(match R.inspect_ln host_term with
| R.Tv_Match _ _ _ -> true
| _ -> false)
| _ -> false | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 14,
"end_line": 45,
"start_col": 0,
"start_line": 39
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | t: Pulse.Syntax.Base.term -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"FStar.Stubs.Reflection.V2.Builtins.inspect_ln",
"FStar.Stubs.Reflection.Types.term",
"FStar.Pervasives.Native.option",
"FStar.Stubs.Reflection.Types.match_returns_ascription",
"Prims.list",
"FStar.... | [] | false | false | false | true | false | let equational (t: term) : bool =
| match t.t with
| Tm_FStar host_term ->
(match R.inspect_ln host_term with
| R.Tv_Match _ _ _ -> true
| _ -> false)
| _ -> false | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.refl_uvar | val refl_uvar (t: R.term) (uvs: env) : option var | val refl_uvar (t: R.term) (uvs: env) : option var | let refl_uvar (t:R.term) (uvs:env) : option var =
let open R in
match inspect_ln t with
| Tv_Var v ->
let {uniq=n} = inspect_namedv v in
if contains uvs n then Some n else None
| _ -> None | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 178,
"start_col": 0,
"start_line": 172
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | t: FStar.Stubs.Reflection.Types.term -> uvs: Pulse.Typing.Env.env
-> FStar.Pervasives.Native.option Pulse.Syntax.Base.var | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"Pulse.Typing.Env.env",
"FStar.Stubs.Reflection.V2.Builtins.inspect_ln",
"FStar.Stubs.Reflection.Types.namedv",
"Prims.nat",
"FStar.Sealed.sealed",
"FStar.Stubs.Reflection.Types.typ",
"FStar.Stubs.Reflection.V2.Data.ppname_t",
"Pulse.Typing.Env.contains",
"FSta... | [] | false | false | false | true | false | let refl_uvar (t: R.term) (uvs: env) : option var =
| let open R in
match inspect_ln t with
| Tv_Var v ->
let { uniq = n } = inspect_namedv v in
if contains uvs n then Some n else None
| _ -> None | false |
Clear.fst | Clear.l2 | val l2 : x: Prims.int -> y: Prims.bool -> z: Prims.int -> Prims.unit | let l2 (x : int) (y : bool) (z : int) =
assert (phi ==> (psi ==> xi)) by tau2 () | {
"file_name": "examples/native_tactics/Clear.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 60,
"start_col": 0,
"start_line": 59
} | (*
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.List.fst.checked"
],
"interface_file": false,
"source_file": "Clear.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 -> y: Prims.bool -> z: Prims.int -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.bool",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Clear.phi",
"Clear.psi",
"Clear.xi",
"Prims.unit",
"Clear.tau2"
] | [] | false | false | false | true | false | let l2 (x: int) (y: bool) (z: int) =
| FStar.Tactics.Effect.assert_by_tactic (phi ==> (psi ==> xi))
(fun _ ->
();
tau2 ()) | false | |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.is_uvar | val is_uvar (t: term) (uvs: env) : option var | val is_uvar (t: term) (uvs: env) : option var | let is_uvar (t:term) (uvs:env) : option var =
match t.t with
| Tm_FStar t -> refl_uvar t uvs
| _ -> None | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 183,
"start_col": 0,
"start_line": 180
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | t: Pulse.Syntax.Base.term -> uvs: Pulse.Typing.Env.env
-> FStar.Pervasives.Native.option Pulse.Syntax.Base.var | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"Pulse.Checker.Prover.Match.refl_uvar",
"Pulse.Syntax.Base.term'",
"FStar.Pervasives.Native.None",
"Pulse.Syntax.Base.var",
"FStar.Pervasives.Native.option"
] | [] | false | false | false | true | false | let is_uvar (t: term) (uvs: env) : option var =
| match t.t with
| Tm_FStar t -> refl_uvar t uvs
| _ -> None | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.contains_uvar | val contains_uvar (t: term) (uvs g: env) : T.Tac bool | val contains_uvar (t: term) (uvs g: env) : T.Tac bool | let contains_uvar (t:term) (uvs:env) (g:env) : T.Tac bool =
not (check_disjoint uvs (freevars t)) | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 39,
"end_line": 186,
"start_col": 0,
"start_line": 185
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | t: Pulse.Syntax.Base.term -> uvs: Pulse.Typing.Env.env -> g: Pulse.Typing.Env.env
-> FStar.Tactics.Effect.Tac Prims.bool | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Typing.Env.env",
"Prims.op_Negation",
"Pulse.Typing.Env.check_disjoint",
"Pulse.Syntax.Naming.freevars",
"Prims.bool"
] | [] | false | true | false | false | false | let contains_uvar (t: term) (uvs g: env) : T.Tac bool =
| not (check_disjoint uvs (freevars t)) | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.move_hd_end | val move_hd_end (g: env) (l: list vprop {Cons? l})
: vprop_equiv g (list_as_vprop l) (list_as_vprop (L.tl l @ [L.hd l])) | val move_hd_end (g: env) (l: list vprop {Cons? l})
: vprop_equiv g (list_as_vprop l) (list_as_vprop (L.tl l @ [L.hd l])) | let move_hd_end (g:env) (l:list vprop { Cons? l })
: vprop_equiv g (list_as_vprop l) (list_as_vprop (L.tl l @ [L.hd l])) = RU.magic () | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 85,
"end_line": 374,
"start_col": 0,
"start_line": 373
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
... | {
"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 | g: Pulse.Typing.Env.env -> l: Prims.list Pulse.Syntax.Base.vprop {Cons? l}
-> Pulse.Typing.vprop_equiv g
(Pulse.Typing.Combinators.list_as_vprop l)
(Pulse.Typing.Combinators.list_as_vprop (FStar.List.Tot.Base.tl l @ [FStar.List.Tot.Base.hd l]
)) | Prims.Tot | [
"total"
] | [] | [
"Pulse.Typing.Env.env",
"Prims.list",
"Pulse.Syntax.Base.vprop",
"Prims.b2t",
"Prims.uu___is_Cons",
"Pulse.RuntimeUtils.magic",
"Pulse.Typing.vprop_equiv",
"Pulse.Typing.Combinators.list_as_vprop",
"FStar.List.Tot.Base.append",
"FStar.List.Tot.Base.tl",
"Prims.Cons",
"FStar.List.Tot.Base.hd",
... | [] | false | false | false | false | false | let move_hd_end (g: env) (l: list vprop {Cons? l})
: vprop_equiv g (list_as_vprop l) (list_as_vprop (L.tl l @ [L.hd l])) =
| RU.magic () | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.remaining_ctxt_equiv_pst | val remaining_ctxt_equiv_pst
(#preamble: _)
(pst: prover_state preamble)
(remaining_ctxt': list vprop)
(d: vprop_equiv pst.pg (list_as_vprop pst.remaining_ctxt) (list_as_vprop remaining_ctxt'))
: prover_state preamble | val remaining_ctxt_equiv_pst
(#preamble: _)
(pst: prover_state preamble)
(remaining_ctxt': list vprop)
(d: vprop_equiv pst.pg (list_as_vprop pst.remaining_ctxt) (list_as_vprop remaining_ctxt'))
: prover_state preamble | let remaining_ctxt_equiv_pst (#preamble:_) (pst:prover_state preamble) (remaining_ctxt':list vprop)
(d:vprop_equiv pst.pg (list_as_vprop pst.remaining_ctxt) (list_as_vprop remaining_ctxt'))
: prover_state preamble =
{ pst with remaining_ctxt = remaining_ctxt';
remaining_ctxt_frame_typing = RU.magic (... | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 65,
"end_line": 381,
"start_col": 0,
"start_line": 376
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
... | {
"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 |
pst: Pulse.Checker.Prover.Base.prover_state preamble ->
remaining_ctxt': Prims.list Pulse.Syntax.Base.vprop ->
d:
Pulse.Typing.vprop_equiv (Mkprover_state?.pg pst)
(Pulse.Typing.Combinators.list_as_vprop (Mkprover_state?.remaining_ctxt pst))
(Pulse.Typing.Combinators.list_as_vprop rem... | Prims.Tot | [
"total"
] | [] | [
"Pulse.Checker.Prover.Base.preamble",
"Pulse.Checker.Prover.Base.prover_state",
"Prims.list",
"Pulse.Syntax.Base.vprop",
"Pulse.Typing.vprop_equiv",
"Pulse.Checker.Prover.Base.__proj__Mkprover_state__item__pg",
"Pulse.Typing.Combinators.list_as_vprop",
"Pulse.Checker.Prover.Base.__proj__Mkprover_state... | [] | false | false | false | false | false | let remaining_ctxt_equiv_pst
(#preamble: _)
(pst: prover_state preamble)
(remaining_ctxt': list vprop)
(d: vprop_equiv pst.pg (list_as_vprop pst.remaining_ctxt) (list_as_vprop remaining_ctxt'))
: prover_state preamble =
| {
pst with
remaining_ctxt = remaining_ctxt';
remaining_ctxt_frame_typing = RU.magic ();
k = k_elab_equiv pst.k (VE_Refl _ _) (RU.magic ())
} | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.has_structure | val has_structure (q: vprop) : bool | val has_structure (q: vprop) : bool | let has_structure (q:vprop) : bool =
match q.t with
| Tm_Star _ _ -> true
| _ -> false | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 14,
"end_line": 417,
"start_col": 0,
"start_line": 414
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
... | {
"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 | q: Pulse.Syntax.Base.vprop -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.vprop",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Base.term'",
"Prims.bool"
] | [] | false | false | false | true | false | let has_structure (q: vprop) : bool =
| match q.t with
| Tm_Star _ _ -> true
| _ -> false | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_blocks_helper | val gcm_blocks_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_bytes ... | val gcm_blocks_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_bytes ... | let gcm_blocks_helper (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
length p128... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 511,
"start_col": 0,
"start_line": 272
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.q... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Prims.unit",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"FStar.Seq.Base.length",
"Vale.AES.GCM_BE.gcm_encrypt_BE_snd_helper",
"FSta... | [] | false | false | true | false | false | let gcm_blocks_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_bytes ... | let ctr_BE_1:quad32 = j0_BE in
let ctr_BE_2:quad32 = inc32 j0_BE 1 in
let plain:seq quad32 = if p_num_bytes > length p128 * 16 then append p128 p_bytes else p128 in
let cipher:seq quad32 = if p_num_bytes > length p128 * 16 then append c128 c_bytes else c128 in
let cipher_bound:nat = length p128 + (if p_num_bytes > leng... | false |
Hacl.Impl.Ed25519.Group.fst | Hacl.Impl.Ed25519.Group.a_spec | val a_spec : Type0 | let a_spec = S.aff_point_c | {
"file_name": "code/ed25519/Hacl.Impl.Ed25519.Group.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 26,
"end_line": 21,
"start_col": 0,
"start_line": 21
} | module Hacl.Impl.Ed25519.Group
module ST = FStar.HyperStack.ST
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum25519
open Hacl.Impl.Ed25519.PointConstants
module LSeq = Lib.Sequence
module F51 = Hacl.Impl.Ed25519.Field51
module BE = Hacl.Impl.Exponentiation.Definitions
mod... | {
"checked_file": "/",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Impl.Ed25519.Po... | [
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation.Definitions",
"short_module": "BE"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Field51",
"short_module": "F51"
},
{
"abbre... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 0,
"initial_ifuel": 0,
"max_fuel": 0,
"max_ifuel": 0,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | Type0 | Prims.Tot | [
"total"
] | [] | [
"Spec.Ed25519.aff_point_c"
] | [] | false | false | false | true | true | let a_spec =
| S.aff_point_c | false | |
Hacl.Impl.Blake2.Generic.fst | Hacl.Impl.Blake2.Generic.blake2_round | val blake2_round : #al:Spec.alg -> #ms:m_spec -> wv:state_p al ms -> m:block_w al -> i:size_t ->
Stack unit
(requires (fun h -> live h wv /\ live h m /\ disjoint wv m))
(ensures (fun h0 _ h1 -> modifies (loc wv) h0 h1
/\ state_v h1 wv == Spec.blake2_round al (as_seq h0 m) (v i) (sta... | val blake2_round : #al:Spec.alg -> #ms:m_spec -> wv:state_p al ms -> m:block_w al -> i:size_t ->
Stack unit
(requires (fun h -> live h wv /\ live h m /\ disjoint wv m))
(ensures (fun h0 _ h1 -> modifies (loc wv) h0 h1
/\ state_v h1 wv == Spec.blake2_round al (as_seq h0 m) (v i) (sta... | let blake2_round #al #ms wv m i =
push_frame();
let start_idx = (i %. size 10) *. size 16 in
assert (v start_idx == (v i % 10) * 16);
assert (v start_idx <= 144);
let m_st = alloc_state al ms in
gather_state m_st m start_idx;
let x = rowi m_st 0ul in
let y = rowi m_st 1ul in
let z = rowi m_st 2ul in
... | {
"file_name": "code/blake2/Hacl.Impl.Blake2.Generic.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 14,
"end_line": 304,
"start_col": 0,
"start_line": 278
} | module Hacl.Impl.Blake2.Generic
open FStar.Mul
open FStar.HyperStack
open FStar.HyperStack.ST
open Lib.IntTypes
open Lib.Buffer
open Lib.ByteBuffer
open Lib.LoopCombinators
module ST = FStar.HyperStack.ST
module Seq = Lib.Sequence
module Loops = Lib.LoopCombinators
module Spec = Spec.Blake2
open Hacl.Impl.Blake2.Co... | {
"checked_file": "/",
"dependencies": [
"Spec.Blake2.fst.checked",
"prims.fst.checked",
"LowStar.Modifies.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.LoopCombinators.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.ByteSequence.fsti.checked",
"L... | [
{
"abbrev": false,
"full_module": "Hacl.Impl.Blake2.Core",
"short_module": null
},
{
"abbrev": false,
"full_module": "Hacl.Impl.Blake2.Constants",
"short_module": null
},
{
"abbrev": true,
"full_module": "Spec.Blake2",
"short_module": "Spec"
},
{
"abbrev": true,
... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
wv: Hacl.Impl.Blake2.Core.state_p al ms ->
m: Hacl.Impl.Blake2.Core.block_w al ->
i: Lib.IntTypes.size_t
-> FStar.HyperStack.ST.Stack Prims.unit | FStar.HyperStack.ST.Stack | [] | [] | [
"Spec.Blake2.Definitions.alg",
"Hacl.Impl.Blake2.Core.m_spec",
"Hacl.Impl.Blake2.Core.state_p",
"Hacl.Impl.Blake2.Core.block_w",
"Lib.IntTypes.size_t",
"FStar.HyperStack.ST.pop_frame",
"Prims.unit",
"Hacl.Impl.Blake2.Generic.undiag",
"Hacl.Impl.Blake2.Generic.blake2_mixing",
"Hacl.Impl.Blake2.Gene... | [] | false | true | false | false | false | let blake2_round #al #ms wv m i =
| push_frame ();
let start_idx = (i %. size 10) *. size 16 in
assert (v start_idx == (v i % 10) * 16);
assert (v start_idx <= 144);
let m_st = alloc_state al ms in
gather_state m_st m start_idx;
let x = rowi m_st 0ul in
let y = rowi m_st 1ul in
let z = rowi m_st 2ul in
let w = rowi m_st 3ul in
let h1 = ST.get () in
asser... | false |
Hacl.HMAC_DRBG.fst | Hacl.HMAC_DRBG.mk_generate | val mk_generate: #a:supported_alg -> HMAC.compute_st a -> generate_st a | val mk_generate: #a:supported_alg -> HMAC.compute_st a -> generate_st a | let mk_generate #a hmac output st n additional_input_len additional_input =
if st.reseed_counter.(0ul) >. reseed_interval then
false
else
begin
S.hmac_input_bound a;
Math.Lemmas.lemma_div_mod (v n) (hash_length a);
let State k v ctr = st in
if additional_input_len >. 0ul then
update hm... | {
"file_name": "code/drbg/Hacl.HMAC_DRBG.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 7,
"end_line": 302,
"start_col": 0,
"start_line": 261
} | module Hacl.HMAC_DRBG
open FStar.HyperStack.ST
module ST = FStar.HyperStack.ST
open Spec.Hash.Definitions
open Lib.IntTypes
open Lib.Buffer
module HS = FStar.HyperStack
module B = LowStar.Buffer
module LSeq = Lib.Sequence
module HMAC = Hacl.HMAC
module S = Spec.HMAC_DRBG
friend Spec.HMAC_DRBG
unfold
let hash_len... | {
"checked_file": "/",
"dependencies": [
"Spec.HMAC_DRBG.fst.checked",
"Spec.HMAC_DRBG.fst.checked",
"Spec.Hash.Definitions.fst.checked",
"Spec.Agile.HMAC.fsti.checked",
"prims.fst.checked",
"LowStar.Buffer.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"... | [
{
"abbrev": true,
"full_module": "Spec.HMAC_DRBG",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.HMAC",
"short_module": "HMAC"
},
{
"abbrev": true,
"full_module": "Lib.Sequence",
"short_module": "LSeq"
},
{
"abbrev": true,
"full_module": "LowSt... | {
"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 | hmac: Hacl.HMAC.compute_st a -> Hacl.HMAC_DRBG.generate_st a | Prims.Tot | [
"total"
] | [] | [
"Hacl.HMAC_DRBG.supported_alg",
"Hacl.HMAC.compute_st",
"Lib.Buffer.buffer",
"Lib.IntTypes.uint8",
"Hacl.HMAC_DRBG.state",
"Lib.IntTypes.size_t",
"Lib.Buffer.lbuffer",
"Prims.bool",
"Hacl.HMAC_DRBG.hash_len",
"FStar.UInt32.__uint_to_t",
"Prims.l_and",
"Lib.Buffer.disjoint",
"Lib.Buffer.MUT",... | [] | false | false | false | false | false | let mk_generate #a hmac output st n additional_input_len additional_input =
| if st.reseed_counter.(0ul) >. reseed_interval
then false
else
(S.hmac_input_bound a;
Math.Lemmas.lemma_div_mod (v n) (hash_length a);
let State k v ctr = st in
if additional_input_len >. 0ul then update hmac additional_input_len additional_input k v;
let output:lbuffer uint8 n = output in
let max ... | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.is_smt_fallback | val is_smt_fallback (t: R.term) : bool | val is_smt_fallback (t: R.term) : bool | let is_smt_fallback (t:R.term) : bool =
match R.inspect_ln t with
| R.Tv_FVar fv ->
let name = R.inspect_fv fv in
name = ["Steel";"Effect";"Common";"smt_fallback"] ||
name = ["Pulse"; "Lib"; "Core"; "equate_by_smt"]
| _ -> false | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 14,
"end_line": 73,
"start_col": 0,
"start_line": 67
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | t: FStar.Stubs.Reflection.Types.term -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.V2.Builtins.inspect_ln",
"FStar.Stubs.Reflection.Types.fv",
"Prims.op_BarBar",
"Prims.op_Equality",
"Prims.list",
"Prims.string",
"Prims.Cons",
"Prims.Nil",
"FStar.Stubs.Reflection.Types.name",
"FStar.Stubs.Reflection.V2.Builtins.inspe... | [] | false | false | false | true | false | let is_smt_fallback (t: R.term) : bool =
| match R.inspect_ln t with
| R.Tv_FVar fv ->
let name = R.inspect_fv fv in
name = ["Steel"; "Effect"; "Common"; "smt_fallback"] ||
name = ["Pulse"; "Lib"; "Core"; "equate_by_smt"]
| _ -> false | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.type_of_fv | val type_of_fv (g: env) (fv: R.fv) : T.Tac (option R.term) | val type_of_fv (g: env) (fv: R.fv) : T.Tac (option R.term) | let type_of_fv (g:env) (fv:R.fv)
: T.Tac (option R.term)
= let n = R.inspect_fv fv in
match R.lookup_typ (fstar_env g) n with
| None -> None
| Some se ->
match R.inspect_sigelt se with
| R.Unk -> None
| R.Sg_Let _ lbs -> (
L.tryPick
(fun lb ->
let lbv = R... | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 54,
"end_line": 65,
"start_col": 0,
"start_line": 47
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | g: Pulse.Typing.Env.env -> fv: FStar.Stubs.Reflection.Types.fv
-> FStar.Tactics.Effect.Tac (FStar.Pervasives.Native.option FStar.Stubs.Reflection.Types.term) | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Typing.Env.env",
"FStar.Stubs.Reflection.Types.fv",
"FStar.Stubs.Reflection.V2.Builtins.lookup_typ",
"Pulse.Typing.Env.fstar_env",
"FStar.Pervasives.Native.None",
"FStar.Stubs.Reflection.Types.term",
"FStar.Stubs.Reflection.Types.sigelt",
"FStar.Stubs.Reflection.V2.Builtins.inspect_sigelt",
"... | [] | false | true | false | false | false | let type_of_fv (g: env) (fv: R.fv) : T.Tac (option R.term) =
| let n = R.inspect_fv fv in
match R.lookup_typ (fstar_env g) n with
| None -> None
| Some se ->
match R.inspect_sigelt se with
| R.Unk -> None
| R.Sg_Let _ lbs ->
(L.tryPick (fun lb ->
let lbv = R.inspect_lb lb in
if R.inspect_fv lbv.lb_fv = n then Some lbv.lb_typ else None)
lbs... | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.is_reveal | val is_reveal (t: term) : bool | val is_reveal (t: term) : bool | let is_reveal (t:term) : bool =
match leftmost_head t with
| Some hd ->
(match is_fvar hd with
| Some (l, [_]) -> l = RUtil.reveal_lid
| _ -> false)
| _ -> false | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 14,
"end_line": 212,
"start_col": 0,
"start_line": 206
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | t: Pulse.Syntax.Base.term -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Syntax.Pure.leftmost_head",
"Pulse.Syntax.Pure.is_fvar",
"FStar.Stubs.Reflection.Types.name",
"Pulse.Syntax.Base.universe",
"Prims.op_Equality",
"Prims.list",
"Prims.string",
"Pulse.Reflection.Util.reveal_lid",
"FStar.Pervasives.Native.option",
"FStar.Pervasives.... | [] | false | false | false | true | false | let is_reveal (t: term) : bool =
| match leftmost_head t with
| Some hd ->
(match is_fvar hd with
| Some (l, [_]) -> l = RUtil.reveal_lid
| _ -> false)
| _ -> false | false |
FStar.HyperStack.fst | FStar.HyperStack.stackref | val stackref : a: Type0 -> Type0 | let stackref (a:Type) = mstackref a (Heap.trivial_preorder a) | {
"file_name": "ulib/FStar.HyperStack.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 22,
"start_col": 0,
"start_line": 22
} | (*
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.Monotonic.HyperStack.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "FStar.HyperStack.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.HyperStack.mstackref",
"FStar.Heap.trivial_preorder"
] | [] | false | false | false | true | true | let stackref (a: Type) =
| mstackref a (Heap.trivial_preorder a) | false | |
FStar.HyperStack.fst | FStar.HyperStack.mmstackref | val mmstackref : a: Type0 -> Type0 | let mmstackref (a:Type) = mmmstackref a (Heap.trivial_preorder a) | {
"file_name": "ulib/FStar.HyperStack.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 65,
"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.Monotonic.HyperStack.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "FStar.HyperStack.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.HyperStack.mmmstackref",
"FStar.Heap.trivial_preorder"
] | [] | false | false | false | true | true | let mmstackref (a: Type) =
| mmmstackref a (Heap.trivial_preorder a) | false | |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.eligible_for_smt_equality | val eligible_for_smt_equality (g: env) (t0 t1: term) : T.Tac bool | val eligible_for_smt_equality (g: env) (t0 t1: term) : T.Tac bool | let eligible_for_smt_equality (g:env) (t0 t1:term)
: T.Tac bool
= let either_equational () = equational t0 || equational t1 in
let head_eq (t0 t1:R.term) =
match R.inspect_ln t0, R.inspect_ln t1 with
| R.Tv_App h0 _, R.Tv_App h1 _ ->
TermEq.term_eq h0 h1
| _ -> false
in
match ... | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 31,
"end_line": 169,
"start_col": 0,
"start_line": 108
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | g: Pulse.Typing.Env.env -> t0: Pulse.Syntax.Base.term -> t1: Pulse.Syntax.Base.term
-> FStar.Tactics.Effect.Tac Prims.bool | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Syntax.Base.term",
"FStar.Pervasives.Native.Mktuple2",
"Pulse.Syntax.Base.term'",
"Pulse.Syntax.Base.__proj__Mkterm__item__t",
"Pulse.Syntax.Base.host_term",
"FStar.Stubs.Reflection.Types.term",
"Prims.list",
"FStar.Stubs.Reflection.V2.Data.argv",
"Prims.op_AmpAmp",
... | [] | false | true | false | false | false | let eligible_for_smt_equality (g: env) (t0 t1: term) : T.Tac bool =
| let either_equational () = equational t0 || equational t1 in
let head_eq (t0 t1: R.term) =
match R.inspect_ln t0, R.inspect_ln t1 with
| R.Tv_App h0 _, R.Tv_App h1 _ -> TermEq.term_eq h0 h1
| _ -> false
in
match t0.t, t1.t with
| Tm_FStar t0, Tm_FStar t1 ->
(let h0, args0 = R.collect_app_ln t0 in
let h1, ar... | false |
FStar.HyperStack.fst | FStar.HyperStack.ref | val ref : a: Type0 -> Type0 | let ref (a:Type) = mref a (Heap.trivial_preorder a) | {
"file_name": "ulib/FStar.HyperStack.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 51,
"end_line": 23,
"start_col": 0,
"start_line": 23
} | (*
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.Monotonic.HyperStack.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "FStar.HyperStack.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.HyperStack.mref",
"FStar.Heap.trivial_preorder"
] | [] | false | false | false | true | true | let ref (a: Type) =
| mref a (Heap.trivial_preorder a) | false | |
FStar.HyperStack.fst | FStar.HyperStack.mmref | val mmref : a: Type0 -> Type0 | let mmref (a:Type) = mmmref a (Heap.trivial_preorder a) | {
"file_name": "ulib/FStar.HyperStack.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 55,
"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.Monotonic.HyperStack.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "FStar.HyperStack.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"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: Type0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"FStar.Monotonic.HyperStack.mmmref",
"FStar.Heap.trivial_preorder"
] | [] | false | false | false | true | true | let mmref (a: Type) =
| mmmref a (Heap.trivial_preorder a) | false | |
FStar.HyperStack.fst | FStar.HyperStack.reference_distinct_sel_disjoint | val reference_distinct_sel_disjoint (#a: Type0) (h: mem) (r1 r2: reference a)
: Lemma
(requires
(h `contains` r1 /\ h `contains` r2 /\ frameOf r1 == frameOf r2 /\ as_addr r1 == as_addr r2)
) (ensures (sel h r1 == sel h r2)) | val reference_distinct_sel_disjoint (#a: Type0) (h: mem) (r1 r2: reference a)
: Lemma
(requires
(h `contains` r1 /\ h `contains` r2 /\ frameOf r1 == frameOf r2 /\ as_addr r1 == as_addr r2)
) (ensures (sel h r1 == sel h r2)) | let reference_distinct_sel_disjoint
(#a:Type0) (h: mem) (r1: reference a) (r2: reference a)
: Lemma
(requires (
h `contains` r1 /\
h `contains` r2 /\
frameOf r1 == frameOf r2 /\
as_addr r1 == as_addr r2
))
(ensures (
sel h r1 == sel h r2
))
= mreference_distinct_sel_disjoint h r1 r2 | {
"file_name": "ulib/FStar.HyperStack.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 42,
"end_line": 43,
"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.Monotonic.HyperStack.fsti.checked",
"FStar.Heap.fst.checked"
],
"interface_file": false,
"source_file": "FStar.HyperStack.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.Monotonic.HyperStack",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar",
"short_module": null
},
{
"abbrev": false,
"full_module": "FSt... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
h: FStar.Monotonic.HyperStack.mem ->
r1: FStar.HyperStack.reference a ->
r2: FStar.HyperStack.reference a
-> FStar.Pervasives.Lemma
(requires
FStar.Monotonic.HyperStack.contains h r1 /\ FStar.Monotonic.HyperStack.contains h r2 /\
FStar.Monotonic.HyperStack.frameOf r1 == FStar.Monoto... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"FStar.Monotonic.HyperStack.mem",
"FStar.HyperStack.reference",
"FStar.Monotonic.HyperStack.mreference_distinct_sel_disjoint",
"FStar.Heap.trivial_preorder",
"Prims.unit",
"Prims.l_and",
"FStar.Monotonic.HyperStack.contains",
"Prims.eq2",
"FStar.Monotonic.HyperHeap.rid",
"FStar.Monotonic.HyperStac... | [] | true | false | true | false | false | let reference_distinct_sel_disjoint (#a: Type0) (h: mem) (r1 r2: reference a)
: Lemma
(requires
(h `contains` r1 /\ h `contains` r2 /\ frameOf r1 == frameOf r2 /\ as_addr r1 == as_addr r2)
) (ensures (sel h r1 == sel h r2)) =
| mreference_distinct_sel_disjoint h r1 r2 | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.is_reveal_uvar | val is_reveal_uvar (t: term) (uvs: env) : option (universe & term & var) | val is_reveal_uvar (t: term) (uvs: env) : option (universe & term & var) | let is_reveal_uvar (t:term) (uvs:env) : option (universe & term & var) =
match is_pure_app t with
| Some (hd, None, arg) ->
(match is_pure_app hd with
| Some (hd, Some Implicit, ty) ->
let arg_uvar_index_opt = is_uvar arg uvs in
(match arg_uvar_index_opt with
| Some n ->
(ma... | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 13,
"end_line": 204,
"start_col": 0,
"start_line": 188
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
"abbrev": true,
"full_module": "Pulse.Syntax.Printer",
"short_module": "P"
},
{
"a... | {
"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 | t: Pulse.Syntax.Base.term -> uvs: Pulse.Typing.Env.env
-> FStar.Pervasives.Native.option ((Pulse.Syntax.Base.universe * Pulse.Syntax.Base.term) *
Pulse.Syntax.Base.var) | Prims.Tot | [
"total"
] | [] | [
"Pulse.Syntax.Base.term",
"Pulse.Typing.Env.env",
"Pulse.Syntax.Pure.is_pure_app",
"Pulse.Syntax.Base.var",
"Pulse.Syntax.Pure.is_fvar",
"FStar.Stubs.Reflection.Types.name",
"Pulse.Syntax.Base.universe",
"Prims.op_Equality",
"Prims.list",
"Prims.string",
"Pulse.Reflection.Util.reveal_lid",
"FS... | [] | false | false | false | true | false | let is_reveal_uvar (t: term) (uvs: env) : option (universe & term & var) =
| match is_pure_app t with
| Some (hd, None, arg) ->
(match is_pure_app hd with
| Some (hd, Some Implicit, ty) ->
let arg_uvar_index_opt = is_uvar arg uvs in
(match arg_uvar_index_opt with
| Some n ->
(match is_fvar hd with
| Some (l, [u]) -> if l = RUtil.reveal_lid then So... | false |
Vale.AES.GCM_BE.fst | Vale.AES.GCM_BE.gcm_blocks_dec_helper | val gcm_blocks_dec_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_by... | val gcm_blocks_dec_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_by... | let gcm_blocks_dec_helper (alg:algorithm) (key:seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes:seq quad32)
(p_num_bytes a_num_bytes:nat)
(iv:supported_iv_BE) (j0_BE h enc_hash length_quad:quad32) : Lemma
(requires // Required by gcm_blocks
length ... | {
"file_name": "vale/code/crypto/aes/Vale.AES.GCM_BE.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 953,
"start_col": 0,
"start_line": 721
} | module Vale.AES.GCM_BE
open Vale.Def.Opaque_s
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.AES.GCM_BE_s
open Vale.AES.AES_BE_s
open Vale.AES.GCM_helpers_BE
open Vale.AES.GCTR_BE_s
open Vale.AES.GCTR_BE
open Vale.AES.GHash_BE_s
open FStar.Mul
open FStar.Seq
open Vale.Def.Words_s
open Vale.Def.Words.Seq_s
open F... | {
"checked_file": "/",
"dependencies": [
"Vale.Lib.Seqs.fsti.checked",
"Vale.Def.Words_s.fsti.checked",
"Vale.Def.Words.Seq_s.fsti.checked",
"Vale.Def.Types_s.fst.checked",
"Vale.Def.Opaque_s.fsti.checked",
"Vale.Arch.Types.fsti.checked",
"Vale.AES.GHash_BE_s.fst.checked",
"Vale.AES.... | [
{
"abbrev": false,
"full_module": "FStar.Calc",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Seq_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words_s",
"short_module": null
},
{
"abbrev": false,
"full_mod... | {
"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 |
alg: Vale.AES.AES_common_s.algorithm ->
key: FStar.Seq.Base.seq Vale.Def.Words_s.nat32 ->
a128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
a_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p128: FStar.Seq.Base.seq Vale.Def.Types_s.quad32 ->
p_bytes: FStar.Seq.Base.seq Vale.Def.Types_s.q... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.AES.AES_common_s.algorithm",
"FStar.Seq.Base.seq",
"Vale.Def.Words_s.nat32",
"Vale.Def.Types_s.quad32",
"Prims.nat",
"Vale.AES.GCM_BE_s.supported_iv_BE",
"Prims.unit",
"Prims.op_GreaterThan",
"FStar.Mul.op_Star",
"FStar.Seq.Base.length",
"FStar.Calc.calc_finish",
"Prims.eq2",
"FStar.Se... | [] | false | false | true | false | false | let gcm_blocks_dec_helper
(alg: algorithm)
(key: seq nat32)
(a128 a_bytes p128 p_bytes c128 c_bytes: seq quad32)
(p_num_bytes a_num_bytes: nat)
(iv: supported_iv_BE)
(j0_BE h enc_hash length_quad: quad32)
: Lemma
(requires
length p128 * 16 <= p_num_bytes /\ p_num_by... | let ctr_BE_1:quad32 = j0_BE in
let ctr_BE_2:quad32 = inc32 j0_BE 1 in
let plain:seq quad32 = if p_num_bytes > length p128 * 16 then append p128 p_bytes else p128 in
let cipher:seq quad32 = if p_num_bytes > length p128 * 16 then append c128 c_bytes else c128 in
let cipher_bound:nat = length p128 + (if p_num_bytes > leng... | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.coerce_eq | val coerce_eq: #a: Type -> #b: Type -> x: a -> squash (a == b) -> y: b{y == x} | val coerce_eq: #a: Type -> #b: Type -> x: a -> squash (a == b) -> y: b{y == x} | let coerce_eq (#a #b:Type) (x:a) (_:squash (a == b)) : y:b{y == x} = x | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 70,
"end_line": 297,
"start_col": 0,
"start_line": 297
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
... | {
"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.squash (a == b) -> y: b{y == x} | Prims.Tot | [
"total"
] | [] | [
"Prims.squash",
"Prims.eq2"
] | [] | false | false | false | false | false | let coerce_eq (#a: Type) (#b: Type) (x: a) (_: squash (a == b)) : y: b{y == x} =
| x | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.try_match_pq | val try_match_pq (g: env) (uvs: env{disjoint uvs g}) (p q: vprop)
: T.Tac (ss: PS.ss_t{(PS.dom ss) `Set.subset` (freevars q)} & option (vprop_equiv g p ss.(q))) | val try_match_pq (g: env) (uvs: env{disjoint uvs g}) (p q: vprop)
: T.Tac (ss: PS.ss_t{(PS.dom ss) `Set.subset` (freevars q)} & option (vprop_equiv g p ss.(q))) | let try_match_pq (g:env) (uvs:env { disjoint uvs g}) (p q:vprop)
: T.Tac (ss:PS.ss_t { PS.dom ss `Set.subset` freevars q } &
option (vprop_equiv g p ss.(q))) =
let r = unify g uvs p q in
match r with
| (| ss, None |) -> (| ss, None |)
| (| ss, Some _ |) -> (| ss, Some (RU.magic #(vprop_equiv _ _ _... | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 73,
"end_line": 295,
"start_col": 0,
"start_line": 288
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
... | {
"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 |
g: Pulse.Typing.Env.env ->
uvs: Pulse.Typing.Env.env{Pulse.Typing.Env.disjoint uvs g} ->
p: Pulse.Syntax.Base.vprop ->
q: Pulse.Syntax.Base.vprop
-> FStar.Tactics.Effect.Tac
(Prims.dtuple2 (ss:
Pulse.Checker.Prover.Substs.ss_t
{FStar.Set.subset (Pulse.Checker.Prover.Substs.d... | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Typing.Env.env",
"Pulse.Typing.Env.disjoint",
"Pulse.Syntax.Base.vprop",
"Pulse.Checker.Prover.Substs.ss_t",
"FStar.Set.subset",
"Pulse.Syntax.Base.var",
"Pulse.Checker.Prover.Substs.dom",
"Pulse.Syntax.Naming.freevars",
"Prims.Mkdtuple2",
"FStar.Pervasives.Native.option",
"Pulse.Typing.v... | [] | false | true | false | false | false | let try_match_pq (g: env) (uvs: env{disjoint uvs g}) (p q: vprop)
: T.Tac (ss: PS.ss_t{(PS.dom ss) `Set.subset` (freevars q)} & option (vprop_equiv g p ss.(q))) =
| let r = unify g uvs p q in
match r with
| (| ss , None |) -> (| ss, None |)
| (| ss , Some _ |) -> (| ss, Some (RU.magic #(vprop_equiv _ _ _) ()) |) | false |
Hacl.Impl.Ed25519.Group.fst | Hacl.Impl.Ed25519.Group.linv_ctx | val linv_ctx (a: LSeq.lseq uint64 0) : Type0 | val linv_ctx (a: LSeq.lseq uint64 0) : Type0 | let linv_ctx (a:LSeq.lseq uint64 0) : Type0 = True | {
"file_name": "code/ed25519/Hacl.Impl.Ed25519.Group.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 50,
"end_line": 28,
"start_col": 0,
"start_line": 28
} | module Hacl.Impl.Ed25519.Group
module ST = FStar.HyperStack.ST
open FStar.HyperStack.All
open FStar.Mul
open Lib.IntTypes
open Lib.Buffer
open Hacl.Bignum25519
open Hacl.Impl.Ed25519.PointConstants
module LSeq = Lib.Sequence
module F51 = Hacl.Impl.Ed25519.Field51
module BE = Hacl.Impl.Exponentiation.Definitions
mod... | {
"checked_file": "/",
"dependencies": [
"Spec.Ed25519.Lemmas.fsti.checked",
"Spec.Ed25519.fst.checked",
"prims.fst.checked",
"Lib.Sequence.fsti.checked",
"Lib.IntTypes.fsti.checked",
"Lib.Buffer.fsti.checked",
"Hacl.Impl.Exponentiation.Definitions.fst.checked",
"Hacl.Impl.Ed25519.Po... | [
{
"abbrev": true,
"full_module": "Spec.Ed25519",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Exponentiation.Definitions",
"short_module": "BE"
},
{
"abbrev": true,
"full_module": "Hacl.Impl.Ed25519.Field51",
"short_module": "F51"
},
{
"abbre... | {
"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 | a: Lib.Sequence.lseq Lib.IntTypes.uint64 0 -> Type0 | Prims.Tot | [
"total"
] | [] | [
"Lib.Sequence.lseq",
"Lib.IntTypes.uint64",
"Prims.l_True"
] | [] | false | false | false | false | true | let linv_ctx (a: LSeq.lseq uint64 0) : Type0 =
| True | false |
Pulse.Checker.Prover.Match.fst | Pulse.Checker.Prover.Match.match_q_aux | val match_q_aux:
#preamble: _ ->
pst: prover_state preamble ->
q: vprop ->
unsolved': list vprop ->
squash (pst.unsolved == q :: unsolved') ->
i: nat
-> T.Tac (option (pst': prover_state preamble {pst' `pst_extends` pst})) | val match_q_aux:
#preamble: _ ->
pst: prover_state preamble ->
q: vprop ->
unsolved': list vprop ->
squash (pst.unsolved == q :: unsolved') ->
i: nat
-> T.Tac (option (pst': prover_state preamble {pst' `pst_extends` pst})) | let rec match_q_aux (#preamble:_) (pst:prover_state preamble)
(q:vprop) (unsolved':list vprop)
(_:squash (pst.unsolved == q::unsolved'))
(i:nat)
: T.Tac (option (pst':prover_state preamble { pst' `pst_extends` pst })) =
if L.length pst.remaining_ctxt = 0
then None
else if i = L.length pst.remaining_ctxt
... | {
"file_name": "lib/steel/pulse/Pulse.Checker.Prover.Match.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 42,
"end_line": 403,
"start_col": 0,
"start_line": 383
} | (*
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.Typing.Util.fsti.checked",
"Pulse.Typing.Metatheory.fsti.checked",
"Pulse.Typing.Combinators.fsti.checked",
"Pulse.Typing.fst.checked",
"Pulse.Syntax.Printer.fsti.checked",
"Pulse.Syntax.fst.checked",
"Pulse.RuntimeUtils.fsti.checked",
... | [
{
"abbrev": true,
"full_module": "FStar.Reflection.Typing",
"short_module": "RT"
},
{
"abbrev": true,
"full_module": "Pulse.Typing.Metatheory",
"short_module": "Metatheory"
},
{
"abbrev": true,
"full_module": "Pulse.Checker.Prover.Substs",
"short_module": "PS"
},
{
... | {
"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 |
pst: Pulse.Checker.Prover.Base.prover_state preamble ->
q: Pulse.Syntax.Base.vprop ->
unsolved': Prims.list Pulse.Syntax.Base.vprop ->
_: Prims.squash (Mkprover_state?.unsolved pst == q :: unsolved') ->
i: Prims.nat
-> FStar.Tactics.Effect.Tac
(FStar.Pervasives.Native.option (pst':
... | FStar.Tactics.Effect.Tac | [] | [] | [
"Pulse.Checker.Prover.Base.preamble",
"Pulse.Checker.Prover.Base.prover_state",
"Pulse.Syntax.Base.vprop",
"Prims.list",
"Prims.squash",
"Prims.eq2",
"Pulse.Checker.Prover.Base.__proj__Mkprover_state__item__unsolved",
"Prims.Cons",
"Prims.nat",
"Prims.op_Equality",
"Prims.int",
"FStar.List.Tot... | [
"recursion"
] | false | true | false | false | false | let rec match_q_aux
(#preamble: _)
(pst: prover_state preamble)
(q: vprop)
(unsolved': list vprop)
(_: squash (pst.unsolved == q :: unsolved'))
(i: nat)
: T.Tac (option (pst': prover_state preamble {pst' `pst_extends` pst})) =
| if L.length pst.remaining_ctxt = 0
then None
else
if i = L.length pst.remaining_ctxt
then None
else
let p = L.hd pst.remaining_ctxt in
let pst_opt = match_step pst p (L.tl pst.remaining_ctxt) q unsolved' () in
match pst_opt with
| Some pst -> Some pst
| None ->
let pst =
remainin... | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.