file_name stringlengths 5 52 | name stringlengths 4 95 | original_source_type stringlengths 0 23k | source_type stringlengths 9 23k | source_definition stringlengths 9 57.9k | source dict | source_range dict | file_context stringlengths 0 721k | dependencies dict | opens_and_abbrevs listlengths 2 94 | vconfig dict | interleaved bool 1
class | verbose_type stringlengths 1 7.42k | effect stringclasses 118
values | effect_flags listlengths 0 2 | mutual_with listlengths 0 11 | ideal_premises listlengths 0 236 | proof_features listlengths 0 1 | is_simple_lemma bool 2
classes | is_div bool 2
classes | is_proof bool 2
classes | is_simply_typed bool 2
classes | is_type bool 2
classes | partial_definition stringlengths 5 3.99k | completed_definiton stringlengths 1 1.63M | isa_cross_project_example bool 1
class |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.concatMap | val concatMap: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b) | val concatMap: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b) | let rec concatMap f = function
| [] -> []
| a::tl ->
let fa = f a in
let ftl = concatMap f tl in
append fa ftl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 181,
"start_col": 0,
"start_line": 176
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> Prims.list 'b) -> _: Prims.list 'a -> Prims.list 'b | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.Nil",
"FStar.List.Tot.Base.append",
"FStar.List.Tot.Base.concatMap"
] | [
"recursion"
] | false | false | false | true | false | let rec concatMap f =
| function
| [] -> []
| a :: tl ->
let fa = f a in
let ftl = concatMap f tl in
append fa ftl | false |
Vale.PPC64LE.Memory_Sems.fst | Vale.PPC64LE.Memory_Sems.lemma_is_full_update | val lemma_is_full_update
(vfh: vale_full_heap)
(h hk hk': vale_heap)
(k: heaplet_id)
(mh mh' mhk mhk': machine_heap)
(mt mt': memtaint)
(t: base_typ)
(b: buffer t)
(ptr: int)
(v_size index: nat)
(v: base_typ_as_vale_type t)
(tn: taint)
: Lemma
... | val lemma_is_full_update
(vfh: vale_full_heap)
(h hk hk': vale_heap)
(k: heaplet_id)
(mh mh' mhk mhk': machine_heap)
(mt mt': memtaint)
(t: base_typ)
(b: buffer t)
(ptr: int)
(v_size index: nat)
(v: base_typ_as_vale_type t)
(tn: taint)
: Lemma
... | let lemma_is_full_update
(vfh:vale_full_heap) (h hk hk':vale_heap) (k:heaplet_id) (mh mh' mhk mhk':machine_heap) (mt mt':memtaint)
(t:base_typ) (b:buffer t) (ptr:int) (v_size:nat)
(index:nat) (v:base_typ_as_vale_type t) (tn:taint)
: Lemma
(requires
vfh.vf_layout.vl_inner.vl_heaplets_initialized /\
... | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 705,
"start_col": 0,
"start_line": 657
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Def.Words_s
module I = Vale.Interop
module S = Vale.PPC64LE.Semantics_s
module MB = LowStar.Monotonic.Buffer
module UV = LowStar.BufferView.Up
module DV = LowStar.Bu... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.BufferViewStore.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Buff... | [
{
"abbrev": false,
"full_module": "Vale.X64.BufferViewStore",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Interop.Base",
"short_module": "IB"
},
{
"abbrev": false,
"full_module": "Vale.Arch.Heap",
"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 |
vfh: Vale.Arch.HeapImpl.vale_full_heap ->
h: Vale.Arch.HeapImpl.vale_heap ->
hk: Vale.Arch.HeapImpl.vale_heap ->
hk': Vale.Arch.HeapImpl.vale_heap ->
k: Vale.Arch.HeapImpl.heaplet_id ->
mh: Vale.Arch.MachineHeap_s.machine_heap ->
mh': Vale.Arch.MachineHeap_s.machine_heap ->
mhk: Vale.Ar... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.Arch.HeapImpl.vale_full_heap",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.Arch.HeapImpl.heaplet_id",
"Vale.Arch.MachineHeap_s.machine_heap",
"Vale.PPC64LE.Memory.memtaint",
"Vale.Arch.HeapTypes_s.base_typ",
"Vale.Arch.HeapImpl.buffer",
"Prims.int",
"Prims.nat",
"Vale.PPC64LE.Memory.base_typ_as_va... | [] | false | false | true | false | false | let lemma_is_full_update
(vfh: vale_full_heap)
(h hk hk': vale_heap)
(k: heaplet_id)
(mh mh' mhk mhk': machine_heap)
(mt mt': memtaint)
(t: base_typ)
(b: buffer t)
(ptr: int)
(v_size index: nat)
(v: base_typ_as_vale_type t)
(tn: taint)
: Lemma
... | reveal_opaque (`%valid_layout_buffer_id) valid_layout_buffer_id;
let vfh' = coerce (heap_upd (coerce vfh) mh' mt') in
let dom_upd = Set.intersect (vfh.vf_layout.vl_inner.vl_heaplet_sets k) (Map.domain mhk) in
let mhk'' = Map.concat mhk (Map.restrict dom_upd mh') in
assert (Map.equal mhk'' mhk');
let unchanged (j: heapl... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.fold_left2 | val fold_left2 : f:('a -> 'b -> 'c -> Tot 'a) -> accu:'a -> l1:(list 'b) -> l2:(list 'c) ->
Pure 'a (requires (length l1 == length l2)) (ensures (fun _ -> True)) (decreases l1) | val fold_left2 : f:('a -> 'b -> 'c -> Tot 'a) -> accu:'a -> l1:(list 'b) -> l2:(list 'c) ->
Pure 'a (requires (length l1 == length l2)) (ensures (fun _ -> True)) (decreases l1) | let rec fold_left2 f accu l1 l2 =
match (l1, l2) with
| ([], []) -> accu
| (a1::l1, a2::l2) -> fold_left2 f (f accu a1 a2) l1 l2 | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 57,
"end_line": 221,
"start_col": 0,
"start_line": 218
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> _: 'b -> _: 'c -> 'a) -> accu: 'a -> l1: Prims.list 'b -> l2: Prims.list 'c
-> Prims.Pure 'a | Prims.Pure | [
""
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"FStar.List.Tot.Base.fold_left2"
] | [
"recursion"
] | false | false | false | false | false | let rec fold_left2 f accu l1 l2 =
| match (l1, l2) with
| [], [] -> accu
| a1 :: l1, a2 :: l2 -> fold_left2 f (f accu a1 a2) l1 l2 | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_code_AESNI_enc | val va_code_AESNI_enc : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | val va_code_AESNI_enc : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | let va_code_AESNI_enc dst src =
(mk_ins (make_instr (I.ins_AESNI_enc) (OReg dst) (OReg src))) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 89,
"start_col": 0,
"start_line": 88
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm -> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Taint_Semantics.mk_ins",
"Vale.X64.InsLemmas.make_instr",
"Prims.Cons",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Instruction_s.inOut",
"Vale.X64.Instruction_s.opXmm",
"Prims.Nil",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Instruction_s.Preser... | [] | false | false | false | true | false | let va_code_AESNI_enc dst src =
| (mk_ins (make_instr (I.ins_AESNI_enc) (OReg dst) (OReg src))) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_AESNI_enc | val va_lemma_AESNI_enc : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm -> src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_enc dst src) va_s0 /\ va_is_dst_xmm dst va_s0 /\
va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensures (fun (va_s... | val va_lemma_AESNI_enc : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm -> src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_enc dst src) va_s0 /\ va_is_dst_xmm dst va_s0 /\
va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensures (fun (va_s... | let va_lemma_AESNI_enc va_b0 va_s0 dst src =
va_reveal_opaque (`%va_code_AESNI_enc) (va_code_AESNI_enc dst src);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_enc) (OReg dst) (OReg src))) va_s0;
let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_AESNI_enc) (OReg dst) ... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 102,
"start_col": 0,
"start_line": 96
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"Vale.X64.Taint_Se... | [] | false | false | false | false | false | let va_lemma_AESNI_enc va_b0 va_s0 dst src =
| va_reveal_opaque (`%va_code_AESNI_enc) (va_code_AESNI_enc dst src);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_enc) (OReg dst) (OReg src))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_AESNI_enc) (OReg dst) (OReg src))) va_s0
in
(va_sM, va_fM) | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.unzip | val unzip : l: Prims.list (_ * _) -> Prims.list _ * Prims.list _ | let unzip l = split l | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 21,
"end_line": 426,
"start_col": 0,
"start_line": 426
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list (_ * _) -> Prims.list _ * Prims.list _ | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.split"
] | [] | false | false | false | true | false | let unzip l =
| split l | false | |
Vale.PPC64LE.Memory_Sems.fst | Vale.PPC64LE.Memory_Sems.low_lemma_store_mem128_full | val low_lemma_store_mem128_full (b:buffer128) (i:nat) (v:quad32) (vfh:vale_full_heap) (t:taint) (hid:heaplet_id) : Lemma
(requires (
let (h, mt) = (Map16.get vfh.vf_heaplets hid, vfh.vf_layout.vl_taint) in
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b /\
valid_lay... | val low_lemma_store_mem128_full (b:buffer128) (i:nat) (v:quad32) (vfh:vale_full_heap) (t:taint) (hid:heaplet_id) : Lemma
(requires (
let (h, mt) = (Map16.get vfh.vf_heaplets hid, vfh.vf_layout.vl_taint) in
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b /\
valid_lay... | let low_lemma_store_mem128_full b i v vfh t hid =
let (h, mt, hk) = (vfh.vf_heap, vfh.vf_layout.vl_taint, Map16.get vfh.vf_heaplets hid) in
let ptr = buffer_addr b hk + scale16 i in
let mh' = S.update_heap128 ptr v (heap_get (coerce vfh)) in
let mt' = S.update_n ptr 16 (heap_taint (coerce vfh)) t in
let hk' =... | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 1007,
"start_col": 0,
"start_line": 992
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Def.Words_s
module I = Vale.Interop
module S = Vale.PPC64LE.Semantics_s
module MB = LowStar.Monotonic.Buffer
module UV = LowStar.BufferView.Up
module DV = LowStar.Bu... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.BufferViewStore.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Buff... | [
{
"abbrev": false,
"full_module": "Vale.X64.BufferViewStore",
"short_module": null
},
{
"abbrev": true,
"full_module": "Vale.Interop.Base",
"short_module": "IB"
},
{
"abbrev": false,
"full_module": "Vale.Lib.BufferViewHelpers",
"short_module": null
},
{
"abbrev": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
b: Vale.PPC64LE.Memory.buffer128 ->
i: Prims.nat ->
v: Vale.PPC64LE.Memory.quad32 ->
vfh: Vale.Arch.HeapImpl.vale_full_heap ->
t: Vale.Arch.HeapTypes_s.taint ->
hid: Vale.Arch.HeapImpl.heaplet_id
-> FStar.Pervasives.Lemma
(requires
(let _ =
Vale.Lib.Map16.get (Mkvale... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.PPC64LE.Memory.buffer128",
"Prims.nat",
"Vale.PPC64LE.Memory.quad32",
"Vale.Arch.HeapImpl.vale_full_heap",
"Vale.Arch.HeapTypes_s.taint",
"Vale.Arch.HeapImpl.heaplet_id",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.PPC64LE.Memory.memtaint",
"Prims.unit",
"Vale.PPC64LE.Memory_Sems.lemma_is_full_upd... | [] | false | false | true | false | false | let low_lemma_store_mem128_full b i v vfh t hid =
| let h, mt, hk = (vfh.vf_heap, vfh.vf_layout.vl_taint, Map16.get vfh.vf_heaplets hid) in
let ptr = buffer_addr b hk + scale16 i in
let mh' = S.update_heap128 ptr v (heap_get (coerce vfh)) in
let mt' = S.update_n ptr 16 (heap_taint (coerce vfh)) t in
let hk' = buffer_write b i v hk in
let mhk' = S.update_heap128 ptr v (g... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.for_all | val for_all: ('a -> Tot bool) -> list 'a -> Tot bool | val for_all: ('a -> Tot bool) -> list 'a -> Tot bool | let rec for_all f l = match l with
| [] -> true
| hd::tl -> if f hd then for_all f tl else false | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 52,
"end_line": 305,
"start_col": 0,
"start_line": 303
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> Prims.bool) -> l: Prims.list 'a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Base.for_all"
] | [
"recursion"
] | false | false | false | true | false | let rec for_all f l =
| match l with
| [] -> true
| hd :: tl -> if f hd then for_all f tl else false | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.existsb | val existsb: #a:Type
-> f:(a -> Tot bool)
-> list a
-> Tot bool | val existsb: #a:Type
-> f:(a -> Tot bool)
-> list a
-> Tot bool | let rec existsb #a f l = match l with
| [] -> false
| hd::tl -> if f hd then true else existsb f tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 258,
"start_col": 0,
"start_line": 256
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: a -> Prims.bool) -> l: Prims.list a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Base.existsb"
] | [
"recursion"
] | false | false | false | true | false | let rec existsb #a f l =
| match l with
| [] -> false
| hd :: tl -> if f hd then true else existsb f tl | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.for_all_mem | val for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a)
: Lemma (for_all f l <==> (forall x. memP x l ==> f x)) | val for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a)
: Lemma (for_all f l <==> (forall x. memP x l ==> f x)) | let rec for_all_mem
(#a: Type)
(f: (a -> Tot bool))
(l: list a)
: Lemma
(for_all f l <==> (forall x . memP x l ==> f x))
= match l with
| [] -> ()
| _ :: q -> for_all_mem f q | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 29,
"end_line": 316,
"start_col": 0,
"start_line": 308
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: a -> Prims.bool) -> l: Prims.list a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.for_all f l <==> (forall (x: a). FStar.List.Tot.Base.memP x l ==> f x)) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Base.for_all_mem",
"Prims.unit",
"Prims.l_True",
"Prims.squash",
"Prims.l_iff",
"Prims.b2t",
"FStar.List.Tot.Base.for_all",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [
"recursion"
] | false | false | true | false | false | let rec for_all_mem (#a: Type) (f: (a -> Tot bool)) (l: list a)
: Lemma (for_all f l <==> (forall x. memP x l ==> f x)) =
| match l with
| [] -> ()
| _ :: q -> for_all_mem f q | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_Pclmulqdq | val va_wpProof_Pclmulqdq : dst:va_operand_xmm -> src:va_operand_xmm -> dstHi:bool -> srcHi:bool ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Pclmulqdq dst src dstHi srcHi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_... | val va_wpProof_Pclmulqdq : dst:va_operand_xmm -> src:va_operand_xmm -> dstHi:bool -> srcHi:bool ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_Pclmulqdq dst src dstHi srcHi va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_... | let va_wpProof_Pclmulqdq dst src dstHi srcHi va_s0 va_k =
let (va_sM, va_f0) = va_lemma_Pclmulqdq (va_code_Pclmulqdq dst src dstHi srcHi) va_s0 dst src
dstHi srcHi in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 48,
"start_col": 0,
"start_line": 40
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
dstHi: Prims.bool ->
srcHi: Prims.bool ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Prims.bool",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_x... | [] | false | false | false | false | false | let va_wpProof_Pclmulqdq dst src dstHi srcHi va_s0 va_k =
| let va_sM, va_f0 =
va_lemma_Pclmulqdq (va_code_Pclmulqdq dst src dstHi srcHi) va_s0 dst src dstHi srcHi
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.find | val find: #a:Type
-> f:(a -> Tot bool)
-> list a
-> Tot (option (x:a{f x})) | val find: #a:Type
-> f:(a -> Tot bool)
-> list a
-> Tot (option (x:a{f x})) | let rec find #a f l = match l with
| [] -> None #(x:a{f x}) //These type annotations are only present because it makes bootstrapping go much faster
| hd::tl -> if f hd then Some #(x:a{f x}) hd else find f tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 268,
"start_col": 0,
"start_line": 266
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: a -> Prims.bool) -> l: Prims.list a -> FStar.Pervasives.Native.option (x: a{f x}) | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.Pervasives.Native.None",
"Prims.b2t",
"FStar.Pervasives.Native.Some",
"FStar.List.Tot.Base.find",
"FStar.Pervasives.Native.option"
] | [
"recursion"
] | false | false | false | false | false | let rec find #a f l =
| match l with
| [] -> None #(x: a{f x})
| hd :: tl -> if f hd then Some #(x: a{f x}) hd else find f tl | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.mem | val mem: #a:eqtype -> a -> list a -> Tot bool | val mem: #a:eqtype -> a -> list a -> Tot bool | let rec mem #a x = function
| [] -> false
| hd::tl -> if hd = x then true else mem x tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 47,
"end_line": 242,
"start_col": 0,
"start_line": 240
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.list",
"Prims.op_Equality",
"Prims.bool",
"FStar.List.Tot.Base.mem"
] | [
"recursion"
] | false | false | false | false | false | let rec mem #a x =
| function
| [] -> false
| hd :: tl -> if hd = x then true else mem x tl | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.filter | val filter : #a: Type -> f:(a -> Tot bool) -> l: list a -> Tot (m:list a{forall x. memP x m ==> f x}) | val filter : #a: Type -> f:(a -> Tot bool) -> l: list a -> Tot (m:list a{forall x. memP x m ==> f x}) | let rec filter #a f = function
| [] -> []
| hd::tl -> if f hd then hd::filter f tl else filter f tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 59,
"end_line": 279,
"start_col": 0,
"start_line": 277
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: a -> Prims.bool) -> l: Prims.list a
-> m: Prims.list a {forall (x: a). FStar.List.Tot.Base.memP x m ==> f x} | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.list",
"Prims.Nil",
"Prims.Cons",
"FStar.List.Tot.Base.filter",
"Prims.l_Forall",
"Prims.l_imp",
"FStar.List.Tot.Base.memP",
"Prims.b2t"
] | [
"recursion"
] | false | false | false | false | false | let rec filter #a f =
| function
| [] -> []
| hd :: tl -> if f hd then hd :: filter f tl else filter f tl | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_codegen_success_AESNI_keygen_assist | val va_codegen_success_AESNI_keygen_assist : dst:va_operand_xmm -> src:va_operand_xmm -> imm:nat8
-> Tot va_pbool | val va_codegen_success_AESNI_keygen_assist : dst:va_operand_xmm -> src:va_operand_xmm -> imm:nat8
-> Tot va_pbool | let va_codegen_success_AESNI_keygen_assist dst src imm =
(va_ttrue ()) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 15,
"end_line": 409,
"start_col": 0,
"start_line": 408
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
imm: Vale.Def.Types_s.nat8
-> Vale.X64.Decls.va_pbool | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.Def.Types_s.nat8",
"Vale.X64.Decls.va_ttrue",
"Vale.X64.Decls.va_pbool"
] | [] | false | false | false | true | false | let va_codegen_success_AESNI_keygen_assist dst src imm =
| (va_ttrue ()) | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.bool_of_compare | val bool_of_compare : #a:Type -> (a -> a -> Tot int) -> a -> a -> Tot bool | val bool_of_compare : #a:Type -> (a -> a -> Tot int) -> a -> a -> Tot bool | let bool_of_compare #a f x y = f x y < 0 | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 499,
"start_col": 0,
"start_line": 499
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: a -> _: a -> Prims.int) -> x: a -> y: a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.op_LessThan",
"Prims.bool"
] | [] | false | false | false | true | false | let bool_of_compare #a f x y =
| f x y < 0 | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.collect | val collect: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b) | val collect: ('a -> Tot (list 'b)) -> list 'a -> Tot (list 'b) | let rec collect f l = match l with
| [] -> []
| hd::tl -> append (f hd) (collect f tl) | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 326,
"start_col": 0,
"start_line": 324
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> Prims.list 'b) -> l: Prims.list 'a -> Prims.list 'b | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.Nil",
"FStar.List.Tot.Base.append",
"FStar.List.Tot.Base.collect"
] | [
"recursion"
] | false | false | false | true | false | let rec collect f l =
| match l with
| [] -> []
| hd :: tl -> append (f hd) (collect f tl) | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.subset | val subset: #a:eqtype -> list a -> list a -> Tot bool | val subset: #a:eqtype -> list a -> list a -> Tot bool | let rec subset #a la lb =
match la with
| [] -> true
| h :: tl -> mem h lb && subset tl lb | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 40,
"end_line": 382,
"start_col": 0,
"start_line": 379
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | la: Prims.list a -> lb: Prims.list a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.list",
"Prims.op_AmpAmp",
"FStar.List.Tot.Base.mem",
"FStar.List.Tot.Base.subset",
"Prims.bool"
] | [
"recursion"
] | false | false | false | false | false | let rec subset #a la lb =
| match la with
| [] -> true
| h :: tl -> mem h lb && subset tl lb | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.tryPick | val tryPick: ('a -> Tot (option 'b)) -> list 'a -> Tot (option 'b) | val tryPick: ('a -> Tot (option 'b)) -> list 'a -> Tot (option 'b) | let rec tryPick f l = match l with
| [] -> None
| hd::tl ->
match f hd with
| Some x -> Some x
| None -> tryPick f tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 31,
"end_line": 348,
"start_col": 0,
"start_line": 343
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> FStar.Pervasives.Native.option 'b) -> l: Prims.list 'a
-> FStar.Pervasives.Native.option 'b | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.option",
"Prims.list",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.Some",
"FStar.List.Tot.Base.tryPick"
] | [
"recursion"
] | false | false | false | true | false | let rec tryPick f l =
| match l with
| [] -> None
| hd :: tl ->
match f hd with
| Some x -> Some x
| None -> tryPick f tl | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.compare_of_bool | val compare_of_bool : #a:eqtype -> (a -> a -> Tot bool) -> a -> a -> Tot int | val compare_of_bool : #a:eqtype -> (a -> a -> Tot bool) -> a -> a -> Tot int | let compare_of_bool #a rel x y =
if x `rel` y then -1
else if x = y then 0
else 1 | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 10,
"end_line": 512,
"start_col": 0,
"start_line": 509
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | rel: (_: a -> _: a -> Prims.bool) -> x: a -> y: a -> Prims.int | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.bool",
"Prims.op_Minus",
"Prims.op_Equality",
"Prims.int"
] | [] | false | false | false | false | false | let compare_of_bool #a rel x y =
| if x `rel` y then - 1 else if x = y then 0 else 1 | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.strict_prefix_of | val strict_prefix_of : l1: Prims.list _ -> l2: Prims.list _ -> Prims.Pure Type0 | let strict_prefix_of = strict_suffix_of | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 39,
"end_line": 541,
"start_col": 0,
"start_line": 541
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | l1: Prims.list _ -> l2: Prims.list _ -> Prims.Pure Type0 | Prims.Pure | [
""
] | [] | [
"FStar.List.Tot.Base.strict_suffix_of",
"Prims.list",
"Prims.l_True"
] | [] | false | false | false | false | true | let strict_prefix_of =
| strict_suffix_of | false | |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.tryFind | val tryFind: ('a -> Tot bool) -> list 'a -> Tot (option 'a) | val tryFind: ('a -> Tot bool) -> list 'a -> Tot (option 'a) | let rec tryFind p l = match l with
| [] -> None
| hd::tl -> if p hd then Some hd else tryFind p tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 336,
"start_col": 0,
"start_line": 334
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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: (_: 'a -> Prims.bool) -> l: Prims.list 'a -> FStar.Pervasives.Native.option 'a | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.Pervasives.Native.None",
"FStar.Pervasives.Native.Some",
"FStar.List.Tot.Base.tryFind",
"FStar.Pervasives.Native.option"
] | [
"recursion"
] | false | false | false | true | false | let rec tryFind p l =
| match l with
| [] -> None
| hd :: tl -> if p hd then Some hd else tryFind p tl | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.choose | val choose: ('a -> Tot (option 'b)) -> list 'a -> Tot (list 'b) | val choose: ('a -> Tot (option 'b)) -> list 'a -> Tot (list 'b) | let rec choose f l = match l with
| [] -> []
| hd::tl ->
match f hd with
| Some x -> x::(choose f tl)
| None -> choose f tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 30,
"end_line": 359,
"start_col": 0,
"start_line": 354
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> FStar.Pervasives.Native.option 'b) -> l: Prims.list 'a -> Prims.list 'b | Prims.Tot | [
"total"
] | [] | [
"FStar.Pervasives.Native.option",
"Prims.list",
"Prims.Nil",
"Prims.Cons",
"FStar.List.Tot.Base.choose"
] | [
"recursion"
] | false | false | false | true | false | let rec choose f l =
| match l with
| [] -> []
| hd :: tl ->
match f hd with
| Some x -> x :: (choose f tl)
| None -> choose f tl | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.partition | val partition: f:('a -> Tot bool) -> list 'a -> Tot (list 'a * list 'a) | val partition: f:('a -> Tot bool) -> list 'a -> Tot (list 'a * list 'a) | let rec partition f = function
| [] -> [], []
| hd::tl ->
let l1, l2 = partition f tl in
if f hd
then hd::l1, l2
else l1, hd::l2 | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 373,
"start_col": 0,
"start_line": 367
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> Prims.bool) -> _: Prims.list 'a -> Prims.list 'a * Prims.list 'a | Prims.Tot | [
"total"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Nil",
"Prims.Cons",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.partition"
] | [
"recursion"
] | false | false | false | true | false | let rec partition f =
| function
| [] -> [], []
| hd :: tl ->
let l1, l2 = partition f tl in
if f hd then hd :: l1, l2 else l1, hd :: l2 | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.noRepeats | val noRepeats : #a:eqtype -> list a -> Tot bool | val noRepeats : #a:eqtype -> list a -> Tot bool | let rec noRepeats #a la =
match la with
| [] -> true
| h :: tl -> not(mem h tl) && noRepeats tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 44,
"end_line": 391,
"start_col": 0,
"start_line": 388
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | la: Prims.list a -> Prims.bool | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.list",
"Prims.op_AmpAmp",
"Prims.op_Negation",
"FStar.List.Tot.Base.mem",
"FStar.List.Tot.Base.noRepeats",
"Prims.bool"
] | [
"recursion"
] | false | false | false | false | false | let rec noRepeats #a la =
| match la with
| [] -> true
| h :: tl -> not (mem h tl) && noRepeats tl | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_VAESNI_enc | val va_lemma_VAESNI_enc : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src1:va_operand_xmm -> src2:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_VAESNI_enc dst src1 src2) va_s0 /\ va_is_dst_xmm dst
va_s0 /\ va_is_src_xmm src1 va_s0 /\ va_is_src_xmm src2 va... | val va_lemma_VAESNI_enc : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src1:va_operand_xmm -> src2:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_VAESNI_enc dst src1 src2) va_s0 /\ va_is_dst_xmm dst
va_s0 /\ va_is_src_xmm src1 va_s0 /\ va_is_src_xmm src2 va... | let va_lemma_VAESNI_enc va_b0 va_s0 dst src1 src2 =
va_reveal_opaque (`%va_code_VAESNI_enc) (va_code_VAESNI_enc dst src1 src2);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_VAESNI_enc) (OReg dst) (OReg src1) (OReg src2))) va_s0;
let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr ... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 133,
"start_col": 0,
"start_line": 127
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src1: Vale.X64.Decls.va_operand_xmm ->
src2: Vale.X64.Decls.va_operand_xmm
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"Vale.X64.Taint_Se... | [] | false | false | false | false | false | let va_lemma_VAESNI_enc va_b0 va_s0 dst src1 src2 =
| va_reveal_opaque (`%va_code_VAESNI_enc) (va_code_VAESNI_enc dst src1 src2);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_VAESNI_enc) (OReg dst) (OReg src1) (OReg src2))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_VAESNI_enc) (OReg dst) (OReg src1) (OReg src2))) va_s0
... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_code_VAESNI_enc_last | val va_code_VAESNI_enc_last : dst:va_operand_xmm -> src1:va_operand_xmm -> src2:va_operand_xmm ->
Tot va_code | val va_code_VAESNI_enc_last : dst:va_operand_xmm -> src1:va_operand_xmm -> src2:va_operand_xmm ->
Tot va_code | let va_code_VAESNI_enc_last dst src1 src2 =
(mk_ins (make_instr (I.ins_VAESNI_enc_last) (OReg dst) (OReg src1) (OReg src2))) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 82,
"end_line": 182,
"start_col": 0,
"start_line": 181
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src1: Vale.X64.Decls.va_operand_xmm ->
src2: Vale.X64.Decls.va_operand_xmm
-> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Taint_Semantics.mk_ins",
"Vale.X64.InsLemmas.make_instr",
"Prims.Cons",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Instruction_s.out",
"Vale.X64.Instruction_s.opXmm",
"Prims.Nil",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Instruction_s.Preserve... | [] | false | false | false | true | false | let va_code_VAESNI_enc_last dst src1 src2 =
| (mk_ins (make_instr (I.ins_VAESNI_enc_last) (OReg dst) (OReg src1) (OReg src2))) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_code_AESNI_dec | val va_code_AESNI_dec : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | val va_code_AESNI_dec : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | let va_code_AESNI_dec dst src =
(mk_ins (make_instr (I.ins_AESNI_dec) (OReg dst) (OReg src))) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 216,
"start_col": 0,
"start_line": 215
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm -> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Taint_Semantics.mk_ins",
"Vale.X64.InsLemmas.make_instr",
"Prims.Cons",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Instruction_s.inOut",
"Vale.X64.Instruction_s.opXmm",
"Prims.Nil",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Instruction_s.Preser... | [] | false | false | false | true | false | let va_code_AESNI_dec dst src =
| (mk_ins (make_instr (I.ins_AESNI_dec) (OReg dst) (OReg src))) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_VAESNI_enc | val va_wpProof_VAESNI_enc : dst:va_operand_xmm -> src1:va_operand_xmm -> src2:va_operand_xmm ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_VAESNI_enc dst src1 src2 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (... | val va_wpProof_VAESNI_enc : dst:va_operand_xmm -> src1:va_operand_xmm -> src2:va_operand_xmm ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_VAESNI_enc dst src1 src2 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (... | let va_wpProof_VAESNI_enc dst src1 src2 va_s0 va_k =
let (va_sM, va_f0) = va_lemma_VAESNI_enc (va_code_VAESNI_enc dst src1 src2) va_s0 dst src1 src2 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));
va_lemma_norm_mo... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 144,
"start_col": 0,
"start_line": 137
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src1: Vale.X64.Decls.va_operand_xmm ->
src2: Vale.X64.Decls.va_operand_xmm ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Ni... | [] | false | false | false | false | false | let va_wpProof_VAESNI_enc dst src1 src2 va_s0 va_k =
| let va_sM, va_f0 = va_lemma_VAESNI_enc (va_code_VAESNI_enc dst src1 src2) va_s0 dst src1 src2 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
let va_g = (... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_AESNI_enc | val va_wpProof_AESNI_enc : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_enc dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_enc dst src) ([va_... | val va_wpProof_AESNI_enc : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_enc dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_enc dst src) ([va_... | let va_wpProof_AESNI_enc dst src va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AESNI_enc (va_code_AESNI_enc dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 113,
"start_col": 0,
"start_line": 106
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Ni... | [] | false | false | false | false | false | let va_wpProof_AESNI_enc dst src va_s0 va_k =
| let va_sM, va_f0 = va_lemma_AESNI_enc (va_code_AESNI_enc dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
let va_g = () in
(va_sM, v... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.split | val split: list ('a * 'b) -> Tot (list 'a * list 'b) | val split: list ('a * 'b) -> Tot (list 'a * list 'b) | let rec split l = match l with
| [] -> ([],[])
| (hd1,hd2)::tl ->
let (tl1,tl2) = split tl in
(hd1::tl1,hd2::tl2) | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 26,
"end_line": 421,
"start_col": 0,
"start_line": 417
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list ('a * 'b) -> Prims.list 'a * Prims.list 'b | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Nil",
"Prims.Cons",
"FStar.List.Tot.Base.split"
] | [
"recursion"
] | false | false | false | true | false | let rec split l =
| match l with
| [] -> ([], [])
| (hd1, hd2) :: tl ->
let tl1, tl2 = split tl in
(hd1 :: tl1, hd2 :: tl2) | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.lemma_splitAt_snd_length | val lemma_splitAt_snd_length (#a: Type) (n: nat) (l: list a)
: Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n)) | val lemma_splitAt_snd_length (#a: Type) (n: nat) (l: list a)
: Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n)) | let rec lemma_splitAt_snd_length (#a:Type) (n:nat) (l:list a) :
Lemma
(requires (n <= length l))
(ensures (length (snd (splitAt n l)) = length l - n)) =
match n, l with
| 0, _ -> ()
| _, [] -> ()
| _, _ :: l' -> lemma_splitAt_snd_length (n - 1) l' | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 53,
"end_line": 457,
"start_col": 0,
"start_line": 450
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> l: Prims.list a
-> FStar.Pervasives.Lemma (requires n <= FStar.List.Tot.Base.length l)
(ensures
FStar.List.Tot.Base.length (FStar.Pervasives.Native.snd (FStar.List.Tot.Base.splitAt n l)) =
FStar.List.Tot.Base.length l - n) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.nat",
"Prims.list",
"FStar.Pervasives.Native.Mktuple2",
"Prims.int",
"FStar.List.Tot.Base.lemma_splitAt_snd_length",
"Prims.op_Subtraction",
"Prims.unit",
"Prims.b2t",
"Prims.op_LessThanOrEqual",
"FStar.List.Tot.Base.length",
"Prims.squash",
"Prims.op_Equality",
"FStar.Pervasives.Nati... | [
"recursion"
] | false | false | true | false | false | let rec lemma_splitAt_snd_length (#a: Type) (n: nat) (l: list a)
: Lemma (requires (n <= length l)) (ensures (length (snd (splitAt n l)) = length l - n)) =
| match n, l with
| 0, _ -> ()
| _, [] -> ()
| _, _ :: l' -> lemma_splitAt_snd_length (n - 1) l' | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.assoc | val assoc: #a:eqtype -> #b:Type -> a -> list (a * b) -> Tot (option b) | val assoc: #a:eqtype -> #b:Type -> a -> list (a * b) -> Tot (option b) | let rec assoc #a #b x = function
| [] -> None
| (x', y)::tl -> if x=x' then Some y else assoc x tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 54,
"end_line": 411,
"start_col": 0,
"start_line": 409
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list (a * b) -> FStar.Pervasives.Native.option b | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.list",
"FStar.Pervasives.Native.tuple2",
"FStar.Pervasives.Native.None",
"Prims.op_Equality",
"FStar.Pervasives.Native.Some",
"Prims.bool",
"FStar.List.Tot.Base.assoc",
"FStar.Pervasives.Native.option"
] | [
"recursion"
] | false | false | false | false | false | let rec assoc #a #b x =
| function
| [] -> None
| (x', y) :: tl -> if x = x' then Some y else assoc x tl | false |
Vale.PPC64LE.Memory_Sems.fst | Vale.PPC64LE.Memory_Sems.low_lemma_store_mem128_lo64_full | val low_lemma_store_mem128_lo64_full (b:buffer128) (i:nat) (v:nat64) (vfh:vale_full_heap) (t:taint) (hid:heaplet_id) : Lemma
(requires (
let (h, mt) = (Map16.get vfh.vf_heaplets hid, vfh.vf_layout.vl_taint) in
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b /\
valid... | val low_lemma_store_mem128_lo64_full (b:buffer128) (i:nat) (v:nat64) (vfh:vale_full_heap) (t:taint) (hid:heaplet_id) : Lemma
(requires (
let (h, mt) = (Map16.get vfh.vf_heaplets hid, vfh.vf_layout.vl_taint) in
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b /\
valid... | let low_lemma_store_mem128_lo64_full b i v vfh t hid =
let (h, mt, hk) = (vfh.vf_heap, vfh.vf_layout.vl_taint, Map16.get vfh.vf_heaplets hid) in
let v' = insert_nat64 (buffer_read b i hk) v 0 in
let ptr = buffer_addr b hk + scale16 i in
let mh' = S.update_heap128 ptr v' (heap_get (coerce vfh)) in
let mt' = S.... | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 1104,
"start_col": 0,
"start_line": 1085
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Def.Words_s
module I = Vale.Interop
module S = Vale.PPC64LE.Semantics_s
module MB = LowStar.Monotonic.Buffer
module UV = LowStar.BufferView.Up
module DV = LowStar.Bu... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.BufferViewStore.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Buff... | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Two_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.BufferViewStore",
"short_module": null
},
{
"abbrev": t... | {
"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 |
b: Vale.PPC64LE.Memory.buffer128 ->
i: Prims.nat ->
v: Vale.Def.Types_s.nat64 ->
vfh: Vale.Arch.HeapImpl.vale_full_heap ->
t: Vale.Arch.HeapTypes_s.taint ->
hid: Vale.Arch.HeapImpl.heaplet_id
-> FStar.Pervasives.Lemma
(requires
(let _ =
Vale.Lib.Map16.get (Mkvale_ful... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.PPC64LE.Memory.buffer128",
"Prims.nat",
"Vale.Def.Types_s.nat64",
"Vale.Arch.HeapImpl.vale_full_heap",
"Vale.Arch.HeapTypes_s.taint",
"Vale.Arch.HeapImpl.heaplet_id",
"Vale.Arch.HeapImpl.vale_heap",
"FStar.Map.t",
"Prims.int",
"FStar.Set.equal",
"FStar.Map.domain",
"FStar.Set.complement"... | [] | false | false | true | false | false | let low_lemma_store_mem128_lo64_full b i v vfh t hid =
| let h, mt, hk = (vfh.vf_heap, vfh.vf_layout.vl_taint, Map16.get vfh.vf_heaplets hid) in
let v' = insert_nat64 (buffer_read b i hk) v 0 in
let ptr = buffer_addr b hk + scale16 i in
let mh' = S.update_heap128 ptr v' (heap_get (coerce vfh)) in
let mt' = S.update_n ptr 16 (heap_taint (coerce vfh)) t in
let hk' = buffer_wri... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.unsnoc | val unsnoc: #a:Type -> l:list a{length l > 0} -> Tot (list a * a) | val unsnoc: #a:Type -> l:list a{length l > 0} -> Tot (list a * a) | let unsnoc #a l =
let l1, l2 = splitAt (length l - 1) l in
lemma_splitAt_snd_length (length l - 1) l;
l1, hd l2 | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 11,
"end_line": 465,
"start_col": 0,
"start_line": 462
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list a {FStar.List.Tot.Base.length l > 0} -> Prims.list a * a | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.b2t",
"Prims.op_GreaterThan",
"FStar.List.Tot.Base.length",
"FStar.Pervasives.Native.Mktuple2",
"FStar.List.Tot.Base.hd",
"Prims.unit",
"FStar.List.Tot.Base.lemma_splitAt_snd_length",
"Prims.op_Subtraction",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.splitAt"
] | [] | false | false | false | false | false | let unsnoc #a l =
| let l1, l2 = splitAt (length l - 1) l in
lemma_splitAt_snd_length (length l - 1) l;
l1, hd l2 | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.no_repeats_p | val no_repeats_p : #a:Type -> list a -> Tot prop | val no_repeats_p : #a:Type -> list a -> Tot prop | let rec no_repeats_p #a la =
match la with
| [] -> True
| h :: tl -> ~(memP h tl) /\ no_repeats_p tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 46,
"end_line": 400,
"start_col": 0,
"start_line": 397
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | la: Prims.list a -> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.l_True",
"Prims.l_and",
"Prims.l_not",
"FStar.List.Tot.Base.memP",
"FStar.List.Tot.Base.no_repeats_p",
"Prims.prop"
] | [
"recursion"
] | false | false | false | true | true | let rec no_repeats_p #a la =
| match la with
| [] -> True
| h :: tl -> ~(memP h tl) /\ no_repeats_p tl | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.split3 | val split3: #a:Type -> l:list a -> i:nat{i < length l} -> Tot (list a * a * list a) | val split3: #a:Type -> l:list a -> i:nat{i < length l} -> Tot (list a * a * list a) | let split3 #a l i =
let a, rest = splitAt i l in
lemma_splitAt_snd_length i l;
let b :: c = rest in
a, b, c | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 9,
"end_line": 475,
"start_col": 0,
"start_line": 471
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list a -> i: Prims.nat{i < FStar.List.Tot.Base.length l}
-> (Prims.list a * a) * Prims.list a | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.nat",
"Prims.b2t",
"Prims.op_LessThan",
"FStar.List.Tot.Base.length",
"FStar.Pervasives.Native.Mktuple3",
"FStar.Pervasives.Native.tuple3",
"Prims.unit",
"FStar.List.Tot.Base.lemma_splitAt_snd_length",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.splitAt"
] | [] | false | false | false | false | false | let split3 #a l i =
| let a, rest = splitAt i l in
lemma_splitAt_snd_length i l;
let b :: c = rest in
a, b, c | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.unzip3 | val unzip3: list ('a * 'b * 'c) -> Tot (list 'a * list 'b * list 'c) | val unzip3: list ('a * 'b * 'c) -> Tot (list 'a * list 'b * list 'c) | let rec unzip3 l = match l with
| [] -> ([],[],[])
| (hd1,hd2,hd3)::tl ->
let (tl1,tl2,tl3) = unzip3 tl in
(hd1::tl1,hd2::tl2,hd3::tl3) | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 436,
"start_col": 0,
"start_line": 432
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list (('a * 'b) * 'c) -> (Prims.list 'a * Prims.list 'b) * Prims.list 'c | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"FStar.Pervasives.Native.tuple3",
"FStar.Pervasives.Native.Mktuple3",
"Prims.Nil",
"Prims.Cons",
"FStar.List.Tot.Base.unzip3"
] | [
"recursion"
] | false | false | false | true | false | let rec unzip3 l =
| match l with
| [] -> ([], [], [])
| (hd1, hd2, hd3) :: tl ->
let tl1, tl2, tl3 = unzip3 tl in
(hd1 :: tl1, hd2 :: tl2, hd3 :: tl3) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_code_AESNI_enc_last | val va_code_AESNI_enc_last : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | val va_code_AESNI_enc_last : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | let va_code_AESNI_enc_last dst src =
(mk_ins (make_instr (I.ins_AESNI_enc_last) (OReg dst) (OReg src))) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 68,
"end_line": 151,
"start_col": 0,
"start_line": 150
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm -> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Taint_Semantics.mk_ins",
"Vale.X64.InsLemmas.make_instr",
"Prims.Cons",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Instruction_s.inOut",
"Vale.X64.Instruction_s.opXmm",
"Prims.Nil",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Instruction_s.Preser... | [] | false | false | false | true | false | let va_code_AESNI_enc_last dst src =
| (mk_ins (make_instr (I.ins_AESNI_enc_last) (OReg dst) (OReg src))) | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.list_unref | val list_unref : #a:Type -> #p:(a -> Type0) -> list (x:a{p x}) -> Tot (list a) | val list_unref : #a:Type -> #p:(a -> Type0) -> list (x:a{p x}) -> Tot (list a) | let rec list_unref #a #p l =
match l with
| [] -> []
| x::xs -> x :: list_unref xs | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 33,
"end_line": 547,
"start_col": 0,
"start_line": 544
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list (x: a{p x}) -> Prims.list a | Prims.Tot | [
"total"
] | [] | [
"Prims.list",
"Prims.Nil",
"Prims.Cons",
"FStar.List.Tot.Base.list_unref"
] | [
"recursion"
] | false | false | false | false | false | let rec list_unref #a #p l =
| match l with
| [] -> []
| x :: xs -> x :: list_unref xs | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_AESNI_enc_last | val va_wpProof_AESNI_enc_last : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_enc_last dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_enc_last... | val va_wpProof_AESNI_enc_last : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_enc_last dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_enc_last... | let va_wpProof_AESNI_enc_last dst src va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AESNI_enc_last (va_code_AESNI_enc_last dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));
va_lemma_norm_mods ([v... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 175,
"start_col": 0,
"start_line": 168
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Ni... | [] | false | false | false | false | false | let va_wpProof_AESNI_enc_last dst src va_s0 va_k =
| let va_sM, va_f0 = va_lemma_AESNI_enc_last (va_code_AESNI_enc_last dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
let va_g = () in... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.splitAt | val splitAt (#a: Type) (n: nat) (l: list a) : Tot (list a * list a) | val splitAt (#a: Type) (n: nat) (l: list a) : Tot (list a * list a) | let rec splitAt (#a:Type) (n:nat) (l:list a) : Tot (list a * list a) =
if n = 0 then [], l
else
match l with
| [] -> [], l
| x :: xs -> let l1, l2 = splitAt (n-1) xs in x :: l1, l2 | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 61,
"end_line": 448,
"start_col": 0,
"start_line": 443
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | n: Prims.nat -> l: Prims.list a -> Prims.list a * Prims.list a | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.list",
"Prims.op_Equality",
"Prims.int",
"FStar.Pervasives.Native.Mktuple2",
"Prims.Nil",
"Prims.bool",
"Prims.Cons",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.splitAt",
"Prims.op_Subtraction"
] | [
"recursion"
] | false | false | false | true | false | let rec splitAt (#a: Type) (n: nat) (l: list a) : Tot (list a * list a) =
| if n = 0
then [], l
else
match l with
| [] -> [], l
| x :: xs ->
let l1, l2 = splitAt (n - 1) xs in
x :: l1, l2 | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_quick_AESNI_dec | val va_quick_AESNI_dec (dst src: va_operand_xmm) : (va_quickCode unit (va_code_AESNI_dec dst src)) | val va_quick_AESNI_dec (dst src: va_operand_xmm) : (va_quickCode unit (va_code_AESNI_dec dst src)) | let va_quick_AESNI_dec (dst:va_operand_xmm) (src:va_operand_xmm) : (va_quickCode unit
(va_code_AESNI_dec dst src)) =
(va_QProc (va_code_AESNI_dec dst src) ([va_Mod_flags; va_mod_xmm dst]) (va_wp_AESNI_dec dst src)
(va_wpProof_AESNI_dec dst src)) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 273,
"start_col": 0,
"start_line": 270
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsAes.va_code_AESNI_dec dst src) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.QuickCode.va_QProc",
"Prims.unit",
"Vale.X64.InsAes.va_code_AESNI_dec",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Nil",
"Vale.X64.InsAes.va_wp_AESNI_dec",
"Vale.X64.InsAes.va_wpP... | [] | false | false | false | false | false | let va_quick_AESNI_dec (dst src: va_operand_xmm) : (va_quickCode unit (va_code_AESNI_dec dst src)) =
| (va_QProc (va_code_AESNI_dec dst src)
([va_Mod_flags; va_mod_xmm dst])
(va_wp_AESNI_dec dst src)
(va_wpProof_AESNI_dec dst src)) | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.strict_suffix_of | val strict_suffix_of (#a: Type) (l1 l2: list a)
: Pure Type0 (requires True) (ensures (fun _ -> True)) (decreases l2) | val strict_suffix_of (#a: Type) (l1 l2: list a)
: Pure Type0 (requires True) (ensures (fun _ -> True)) (decreases l2) | let rec strict_suffix_of (#a: Type) (l1 l2: list a)
: Pure Type0
(requires True)
(ensures (fun _ -> True))
(decreases l2)
= match l2 with
| [] -> False
| _ :: q -> l1 == q \/ l1 `strict_suffix_of` q | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 48,
"end_line": 538,
"start_col": 0,
"start_line": 531
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | l1: Prims.list a -> l2: Prims.list a -> Prims.Pure Type0 | Prims.Pure | [
""
] | [] | [
"Prims.list",
"Prims.l_False",
"Prims.l_or",
"Prims.eq2",
"FStar.List.Tot.Base.strict_suffix_of",
"Prims.l_True"
] | [
"recursion"
] | false | false | false | false | true | let rec strict_suffix_of (#a: Type) (l1 l2: list a)
: Pure Type0 (requires True) (ensures (fun _ -> True)) (decreases l2) =
| match l2 with
| [] -> False
| _ :: q -> l1 == q \/ l1 `strict_suffix_of` q | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_AESNI_enc_last | val va_lemma_AESNI_enc_last : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_enc_last dst src) va_s0 /\ va_is_dst_xmm dst
va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensure... | val va_lemma_AESNI_enc_last : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_enc_last dst src) va_s0 /\ va_is_dst_xmm dst
va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensure... | let va_lemma_AESNI_enc_last va_b0 va_s0 dst src =
va_reveal_opaque (`%va_code_AESNI_enc_last) (va_code_AESNI_enc_last dst src);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_enc_last) (OReg dst) (OReg src))) va_s0;
let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_AE... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 164,
"start_col": 0,
"start_line": 158
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"Vale.X64.Taint_Se... | [] | false | false | false | false | false | let va_lemma_AESNI_enc_last va_b0 va_s0 dst src =
| va_reveal_opaque (`%va_code_AESNI_enc_last) (va_code_AESNI_enc_last dst src);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_enc_last) (OReg dst) (OReg src))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_AESNI_enc_last) (OReg dst) (OReg src))) va_s0
in
(va_sM, va_fM... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.sortWith | val sortWith: ('a -> 'a -> Tot int) -> l:list 'a -> Tot (list 'a) (decreases (length l)) | val sortWith: ('a -> 'a -> Tot int) -> l:list 'a -> Tot (list 'a) (decreases (length l)) | let rec sortWith f = function
| [] -> []
| pivot::tl ->
let hi, lo = partition (bool_of_compare f pivot) tl in
partition_length (bool_of_compare f pivot) tl;
append (sortWith f lo) (pivot::sortWith f hi) | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 50,
"end_line": 528,
"start_col": 0,
"start_line": 523
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> _: 'a -> Prims.int) -> l: Prims.list 'a -> Prims.Tot (Prims.list 'a) | Prims.Tot | [
"total",
""
] | [] | [
"Prims.int",
"Prims.list",
"Prims.Nil",
"FStar.List.Tot.Base.append",
"FStar.List.Tot.Base.sortWith",
"Prims.Cons",
"Prims.unit",
"FStar.List.Tot.Base.partition_length",
"FStar.List.Tot.Base.bool_of_compare",
"FStar.Pervasives.Native.tuple2",
"FStar.List.Tot.Base.partition"
] | [
"recursion"
] | false | false | false | true | false | let rec sortWith f =
| function
| [] -> []
| pivot :: tl ->
let hi, lo = partition (bool_of_compare f pivot) tl in
partition_length (bool_of_compare f pivot) tl;
append (sortWith f lo) (pivot :: sortWith f hi) | false |
ConstructiveLogic.fst | ConstructiveLogic.ex1 | val ex1 : p: Prims.prop -> Prims.unit | let ex1 (p : prop) =
assert (p ==> p)
by (let b = implies_intro () in
hyp (binding_to_namedv b)) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 36,
"end_line": 60,
"start_col": 0,
"start_line": 57
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.unit",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.implies_intro"
] | [] | false | false | false | true | false | let ex1 (p: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p ==> p)
(fun _ ->
();
(let b = implies_intro () in
hyp (binding_to_namedv b))) | false | |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_VAESNI_enc_last | val va_wpProof_VAESNI_enc_last : dst:va_operand_xmm -> src1:va_operand_xmm -> src2:va_operand_xmm
-> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_VAESNI_enc_last dst src1 src2 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_... | val va_wpProof_VAESNI_enc_last : dst:va_operand_xmm -> src1:va_operand_xmm -> src2:va_operand_xmm
-> va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_VAESNI_enc_last dst src1 src2 va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_... | let va_wpProof_VAESNI_enc_last dst src1 src2 va_s0 va_k =
let (va_sM, va_f0) = va_lemma_VAESNI_enc_last (va_code_VAESNI_enc_last dst src1 src2) va_s0 dst
src1 src2 in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 208,
"start_col": 0,
"start_line": 200
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src1: Vale.X64.Decls.va_operand_xmm ->
src2: Vale.X64.Decls.va_operand_xmm ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Ni... | [] | false | false | false | false | false | let va_wpProof_VAESNI_enc_last dst src1 src2 va_s0 va_k =
| let va_sM, va_f0 =
va_lemma_VAESNI_enc_last (va_code_VAESNI_enc_last dst src1 src2) va_s0 dst src1 src2
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.list_refb | val list_refb: #a:eqtype -> #p:(a -> Tot bool) ->
l:list a { for_all p l } ->
Tot (l':list (x:a{ p x }) {
length l = length l' /\
(forall i. {:pattern (index l i) } index l i = index l' i) }) | val list_refb: #a:eqtype -> #p:(a -> Tot bool) ->
l:list a { for_all p l } ->
Tot (l':list (x:a{ p x }) {
length l = length l' /\
(forall i. {:pattern (index l i) } index l i = index l' i) }) | let rec list_refb #a #p l =
match l with
| hd :: tl -> hd :: list_refb #a #p tl
| [] -> [] | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 557,
"start_col": 0,
"start_line": 554
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list a {FStar.List.Tot.Base.for_all p l}
-> l':
Prims.list (x: a{p x})
{ FStar.List.Tot.Base.length l = FStar.List.Tot.Base.length l' /\
(forall (i:
Prims.nat{i < FStar.List.Tot.Base.length l /\ i < FStar.List.Tot.Base.length l'}).
{:pattern FStar.List.Tot.Base.index... | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.bool",
"Prims.list",
"Prims.b2t",
"FStar.List.Tot.Base.for_all",
"Prims.Cons",
"FStar.List.Tot.Base.list_refb",
"Prims.Nil",
"Prims.l_and",
"Prims.op_Equality",
"Prims.nat",
"FStar.List.Tot.Base.length",
"Prims.l_Forall",
"Prims.op_LessThan",
"FStar.List.Tot.Base.i... | [
"recursion"
] | false | false | false | false | false | let rec list_refb #a #p l =
| match l with
| hd :: tl -> hd :: list_refb #a #p tl
| [] -> [] | false |
Vale.PPC64LE.Memory_Sems.fst | Vale.PPC64LE.Memory_Sems.low_lemma_store_mem128_hi64 | val low_lemma_store_mem128_hi64 (b:buffer128) (i:nat) (v:nat64) (h:vale_heap) : Lemma
(requires
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b
)
(ensures (
let v' = insert_nat64 (buffer_read b i h) v 1 in
let m = S.update_heap64 (buffer_addr b h + scale16 i + 8... | val low_lemma_store_mem128_hi64 (b:buffer128) (i:nat) (v:nat64) (h:vale_heap) : Lemma
(requires
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b
)
(ensures (
let v' = insert_nat64 (buffer_read b i h) v 1 in
let m = S.update_heap64 (buffer_addr b h + scale16 i + 8... | let low_lemma_store_mem128_hi64 b i v h =
reveal_opaque (`%S.valid_addr128) S.valid_addr128;
let ptr = buffer_addr b h + scale16 i in
let v128 = buffer_read b i h in
let v' = insert_nat64 v128 v 1 in
low_lemma_load_mem128 b i h;
low_lemma_store_mem128 b i v' h;
assert (S.valid_addr128 ptr (get_heap h));
... | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 1122,
"start_col": 0,
"start_line": 1108
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Def.Words_s
module I = Vale.Interop
module S = Vale.PPC64LE.Semantics_s
module MB = LowStar.Monotonic.Buffer
module UV = LowStar.BufferView.Up
module DV = LowStar.Bu... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.BufferViewStore.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Buff... | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Two_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.BufferViewStore",
"short_module": null
},
{
"abbrev": t... | {
"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 |
b: Vale.PPC64LE.Memory.buffer128 ->
i: Prims.nat ->
v: Vale.Def.Types_s.nat64 ->
h: Vale.Arch.HeapImpl.vale_heap
-> FStar.Pervasives.Lemma
(requires
i < FStar.Seq.Base.length (Vale.PPC64LE.Memory.buffer_as_seq h b) /\
Vale.PPC64LE.Memory.buffer_readable h b /\ Vale.PPC64LE.Memor... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.PPC64LE.Memory.buffer128",
"Prims.nat",
"Vale.Def.Types_s.nat64",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.Def.Types_s.insert_nat64_reveal",
"Prims.unit",
"Vale.Arch.MachineHeap_s.update_heap32_reveal",
"Vale.Arch.MachineHeap_s.update_heap64_reveal",
"Vale.Arch.MachineHeap_s.update_heap128_reveal... | [] | true | false | true | false | false | let low_lemma_store_mem128_hi64 b i v h =
| reveal_opaque (`%S.valid_addr128) S.valid_addr128;
let ptr = buffer_addr b h + scale16 i in
let v128 = buffer_read b i h in
let v' = insert_nat64 v128 v 1 in
low_lemma_load_mem128 b i h;
low_lemma_store_mem128 b i v' h;
assert (S.valid_addr128 ptr (get_heap h));
Vale.Arch.MachineHeap.update_heap32_get_heap32 ptr (get_h... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.partition_length | val partition_length: f:('a -> Tot bool)
-> l:list 'a
-> Lemma (requires True)
(ensures (length (fst (partition f l))
+ length (snd (partition f l)) = length l)) | val partition_length: f:('a -> Tot bool)
-> l:list 'a
-> Lemma (requires True)
(ensures (length (fst (partition f l))
+ length (snd (partition f l)) = length l)) | let rec partition_length f l = match l with
| [] -> ()
| hd::tl -> partition_length f tl | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 35,
"end_line": 488,
"start_col": 0,
"start_line": 486
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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 | f: (_: 'a -> Prims.bool) -> l: Prims.list 'a
-> FStar.Pervasives.Lemma
(ensures
FStar.List.Tot.Base.length (FStar.Pervasives.Native.fst (FStar.List.Tot.Base.partition f l)) +
FStar.List.Tot.Base.length (FStar.Pervasives.Native.snd (FStar.List.Tot.Base.partition f l)) =
FStar.List.Tot.Base.length... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.bool",
"Prims.list",
"FStar.List.Tot.Base.partition_length",
"Prims.unit"
] | [
"recursion"
] | false | false | true | false | false | let rec partition_length f l =
| match l with
| [] -> ()
| hd :: tl -> partition_length f tl | false |
ConstructiveLogic.fst | ConstructiveLogic.ex2 | val ex2 : p: Prims.prop -> q: Prims.prop -> Prims.unit | let ex2 (p q : prop) =
assert (p ==> q ==> p)
by (let bp = implies_intro () in
let _ = implies_intro () in
hyp (binding_to_namedv bp);
qed ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 89,
"start_col": 0,
"start_line": 84
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> q: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.implies_intro"
] | [] | false | false | false | true | false | let ex2 (p q: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p ==> q ==> p)
(fun _ ->
();
(let bp = implies_intro () in
let _ = implies_intro () in
hyp (binding_to_namedv bp);
qed ())) | false | |
ConstructiveLogic.fst | ConstructiveLogic.ex1_qed | val ex1_qed : p: Prims.prop -> Prims.unit | let ex1_qed (p : prop) =
assert (p ==> p)
by (let b = implies_intro () in
hyp (binding_to_namedv b);
qed ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 77,
"start_col": 0,
"start_line": 73
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.implies_intro"
] | [] | false | false | false | true | false | let ex1_qed (p: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p ==> p)
(fun _ ->
();
(let b = implies_intro () in
hyp (binding_to_namedv b);
qed ())) | false | |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_VAESNI_enc_last | val va_lemma_VAESNI_enc_last : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src1:va_operand_xmm -> src2:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_VAESNI_enc_last dst src1 src2) va_s0 /\ va_is_dst_xmm
dst va_s0 /\ va_is_src_xmm src1 va_s0 /\ va_is_src_x... | val va_lemma_VAESNI_enc_last : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src1:va_operand_xmm -> src2:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_VAESNI_enc_last dst src1 src2) va_s0 /\ va_is_dst_xmm
dst va_s0 /\ va_is_src_xmm src1 va_s0 /\ va_is_src_x... | let va_lemma_VAESNI_enc_last va_b0 va_s0 dst src1 src2 =
va_reveal_opaque (`%va_code_VAESNI_enc_last) (va_code_VAESNI_enc_last dst src1 src2);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_VAESNI_enc_last) (OReg dst) (OReg src1) (OReg src2)))
va_s0;
let (va_sM, va_fM) = va_eval_... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 196,
"start_col": 0,
"start_line": 189
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src1: Vale.X64.Decls.va_operand_xmm ->
src2: Vale.X64.Decls.va_operand_xmm
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"Vale.X64.Taint_Se... | [] | false | false | false | false | false | let va_lemma_VAESNI_enc_last va_b0 va_s0 dst src1 src2 =
| va_reveal_opaque (`%va_code_VAESNI_enc_last) (va_code_VAESNI_enc_last dst src1 src2);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_VAESNI_enc_last) (OReg dst) (OReg src1) (OReg src2))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_VAESNI_enc_last) (OReg dst) (OReg src1) ... | false |
Vale.PPC64LE.Memory_Sems.fst | Vale.PPC64LE.Memory_Sems.low_lemma_store_mem128_hi64_full | val low_lemma_store_mem128_hi64_full (b:buffer128) (i:nat) (v:nat64) (vfh:vale_full_heap) (t:taint) (hid:heaplet_id) : Lemma
(requires (
let (h, mt) = (Map16.get vfh.vf_heaplets hid, vfh.vf_layout.vl_taint) in
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b /\
valid... | val low_lemma_store_mem128_hi64_full (b:buffer128) (i:nat) (v:nat64) (vfh:vale_full_heap) (t:taint) (hid:heaplet_id) : Lemma
(requires (
let (h, mt) = (Map16.get vfh.vf_heaplets hid, vfh.vf_layout.vl_taint) in
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b /\
valid... | let low_lemma_store_mem128_hi64_full b i v vfh t hid =
reveal_opaque (`%valid_layout_buffer_id) valid_layout_buffer_id;
let (h, mt, hk) = (vfh.vf_heap, vfh.vf_layout.vl_taint, Map16.get vfh.vf_heaplets hid) in
let v' = insert_nat64 (buffer_read b i h) v 1 in
let ptr = buffer_addr b hk + scale16 i in
let mh' =... | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 4,
"end_line": 1145,
"start_col": 0,
"start_line": 1125
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Def.Words_s
module I = Vale.Interop
module S = Vale.PPC64LE.Semantics_s
module MB = LowStar.Monotonic.Buffer
module UV = LowStar.BufferView.Up
module DV = LowStar.Bu... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.BufferViewStore.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Buff... | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Two_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.BufferViewStore",
"short_module": null
},
{
"abbrev": t... | {
"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 |
b: Vale.PPC64LE.Memory.buffer128 ->
i: Prims.nat ->
v: Vale.Def.Types_s.nat64 ->
vfh: Vale.Arch.HeapImpl.vale_full_heap ->
t: Vale.Arch.HeapTypes_s.taint ->
hid: Vale.Arch.HeapImpl.heaplet_id
-> FStar.Pervasives.Lemma
(requires
(let _ =
Vale.Lib.Map16.get (Mkvale_ful... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.PPC64LE.Memory.buffer128",
"Prims.nat",
"Vale.Def.Types_s.nat64",
"Vale.Arch.HeapImpl.vale_full_heap",
"Vale.Arch.HeapTypes_s.taint",
"Vale.Arch.HeapImpl.heaplet_id",
"Vale.Arch.HeapImpl.vale_heap",
"FStar.Map.t",
"Prims.int",
"FStar.Set.equal",
"FStar.Map.domain",
"FStar.Set.complement"... | [] | false | false | true | false | false | let low_lemma_store_mem128_hi64_full b i v vfh t hid =
| reveal_opaque (`%valid_layout_buffer_id) valid_layout_buffer_id;
let h, mt, hk = (vfh.vf_heap, vfh.vf_layout.vl_taint, Map16.get vfh.vf_heaplets hid) in
let v' = insert_nat64 (buffer_read b i h) v 1 in
let ptr = buffer_addr b hk + scale16 i in
let mh' = S.update_heap128 ptr v' (heap_get (coerce vfh)) in
let mt' = S.upd... | false |
FStar.List.Tot.Base.fst | FStar.List.Tot.Base.list_ref | val list_ref: #a:eqtype -> #p:(a -> Tot prop) -> l:list a {
forall x. {:pattern mem x l} mem x l ==> p x
} -> Tot (l':list (x:a{ p x }) {
length l = length l' /\
(forall i. {:pattern (index l i) } index l i = index l' i) }) | val list_ref: #a:eqtype -> #p:(a -> Tot prop) -> l:list a {
forall x. {:pattern mem x l} mem x l ==> p x
} -> Tot (l':list (x:a{ p x }) {
length l = length l' /\
(forall i. {:pattern (index l i) } index l i = index l' i) }) | let rec list_ref #a #p l =
match l with
| hd :: tl ->
assert (mem hd l);
assert (p hd);
assert (forall x. {:pattern mem x tl} mem x tl ==> mem x l);
hd :: list_ref #a #p tl
| [] -> [] | {
"file_name": "ulib/FStar.List.Tot.Base.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 12,
"end_line": 571,
"start_col": 0,
"start_line": 564
} | (*
Copyright 2008-2014 Nikhil Swamy and Microsoft Research
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by appli... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": false,
"source_file": "FStar.List.Tot.Base.fst"
} | [
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.List.Tot",
"short_module": null
},
{
"abbrev": false,
"full_module": "FStar.Pervasives",
"short_module": null
},
{
"abbrev": false,
"full_modul... | {
"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.list a
{forall (x: a). {:pattern FStar.List.Tot.Base.mem x l} FStar.List.Tot.Base.mem x l ==> p x}
-> l':
Prims.list (x: a{p x})
{ FStar.List.Tot.Base.length l = FStar.List.Tot.Base.length l' /\
(forall (i:
Prims.nat{i < FStar.List.Tot.Base.length l /\ i < FSt... | Prims.Tot | [
"total"
] | [] | [
"Prims.eqtype",
"Prims.prop",
"Prims.list",
"Prims.l_Forall",
"Prims.l_imp",
"Prims.b2t",
"FStar.List.Tot.Base.mem",
"Prims.Cons",
"FStar.List.Tot.Base.list_ref",
"Prims.unit",
"Prims._assert",
"Prims.Nil",
"Prims.l_and",
"Prims.op_Equality",
"Prims.nat",
"FStar.List.Tot.Base.length",
... | [
"recursion"
] | false | false | false | false | false | let rec list_ref #a #p l =
| match l with
| hd :: tl ->
assert (mem hd l);
assert (p hd);
assert (forall x. {:pattern mem x tl} mem x tl ==> mem x l);
hd :: list_ref #a #p tl
| [] -> [] | false |
ConstructiveLogic.fst | ConstructiveLogic.ex6 | val ex6 : p: Prims.prop -> q: Prims.prop -> Prims.unit | let ex6 (p q : prop) =
assert (p ==> q \/ p)
by (let bp = implies_intro () in
right ();
hyp (binding_to_namedv bp);
qed ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 135,
"start_col": 0,
"start_line": 130
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> q: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_or",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.V2.Logic.right",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.... | [] | false | false | false | true | false | let ex6 (p q: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p ==> q \/ p)
(fun _ ->
();
(let bp = implies_intro () in
right ();
hyp (binding_to_namedv bp);
qed ())) | false | |
ConstructiveLogic.fst | ConstructiveLogic.ex5 | val ex5 : p: Prims.prop -> q: Prims.prop -> Prims.unit | let ex5 (p q : prop) =
assert (p ==> p \/ q)
by (let bp = implies_intro () in
left ();
hyp (binding_to_namedv bp);
qed ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 128,
"start_col": 0,
"start_line": 123
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> q: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_or",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.V2.Logic.left",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V... | [] | false | false | false | true | false | let ex5 (p q: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p ==> p \/ q)
(fun _ ->
();
(let bp = implies_intro () in
left ();
hyp (binding_to_namedv bp);
qed ())) | false | |
ConstructiveLogic.fst | ConstructiveLogic.ex13 | val ex13 : p: (_: Prims.nat -> Prims.prop) -> q: (_: Prims.nat -> Prims.prop) -> Prims.unit | let ex13 (p q : nat -> prop) =
assert ((forall x. p x /\ q x) ==> (exists x. p x \/ q x))
by (tadmit ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 20,
"end_line": 199,
"start_col": 0,
"start_line": 197
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: (_: Prims.nat -> Prims.prop) -> q: (_: Prims.nat -> Prims.prop) -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_Forall",
"Prims.l_and",
"Prims.l_Exists",
"Prims.l_or",
"Prims.unit",
"FStar.Tactics.V2.Derived.tadmit"
] | [] | false | false | false | true | false | let ex13 (p q: (nat -> prop)) =
| FStar.Tactics.Effect.assert_by_tactic ((forall x. p x /\ q x) ==> (exists x. p x \/ q x))
(fun _ ->
();
(tadmit ())) | false | |
ConstructiveLogic.fst | ConstructiveLogic.ex4 | val ex4 : p: Prims.prop -> q: Prims.prop -> Prims.unit | let ex4 (p q : prop) =
assert (p /\ q ==> p)
by (let h = implies_intro () in
let (bp, bq) = destruct_and (binding_to_term h) in
hyp (binding_to_namedv bp);
qed ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 119,
"start_col": 0,
"start_line": 114
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> q: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_and",
"Prims.unit",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Pervasives.Native.tuple2",
"FStar.Tacti... | [] | false | false | false | true | false | let ex4 (p q: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p /\ q ==> p)
(fun _ ->
();
(let h = implies_intro () in
let bp, bq = destruct_and (binding_to_term h) in
hyp (binding_to_namedv bp);
qed ())) | false | |
ConstructiveLogic.fst | ConstructiveLogic.ex8 | val ex8 : p: Prims.prop -> q: Prims.prop -> Prims.unit | let ex8 (p q : prop) =
assert ((p ==> q) ==> p ==> q)
by (let i = implies_intro () in
let h = implies_intro () in
mapply i;
mapply h;
qed ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 162,
"start_col": 0,
"start_line": 156
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> q: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.MApply.mapply",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.MApply.termable_binding",
"FStar.Tactics.V2.Logic.implies_intro"
] | [] | false | false | false | true | false | let ex8 (p q: prop) =
| FStar.Tactics.Effect.assert_by_tactic ((p ==> q) ==> p ==> q)
(fun _ ->
();
(let i = implies_intro () in
let h = implies_intro () in
mapply i;
mapply h;
qed ())) | false | |
ConstructiveLogic.fst | ConstructiveLogic.ex3 | val ex3 : p: Prims.prop -> q: Prims.prop -> Prims.unit | let ex3 (p q : prop) =
assert (p ==> q ==> q /\ p)
by (let bp = implies_intro () in
let bq = implies_intro () in
split ();
(* Now we have two goals: q and p *)
hyp (binding_to_namedv bq);
(* Only one goal left, p *)
hyp (binding_to_namedv bp);
... | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 110,
"start_col": 0,
"start_line": 100
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> q: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_and",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.V2.Logic.split",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics... | [] | false | false | false | true | false | let ex3 (p q: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p ==> q ==> q /\ p)
(fun _ ->
();
(let bp = implies_intro () in
let bq = implies_intro () in
split ();
hyp (binding_to_namedv bq);
hyp (binding_to_namedv bp);
qed ())) | false | |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_AESNI_dec | val va_wpProof_AESNI_dec : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_dec dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_dec dst src) ([va_... | val va_wpProof_AESNI_dec : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_dec dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_dec dst src) ([va_... | let va_wpProof_AESNI_dec dst src va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AESNI_dec (va_code_AESNI_dec dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 267,
"start_col": 0,
"start_line": 260
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Ni... | [] | false | false | false | false | false | let va_wpProof_AESNI_dec dst src va_s0 va_k =
| let va_sM, va_f0 = va_lemma_AESNI_dec (va_code_AESNI_dec dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
let va_g = () in
(va_sM, v... | false |
ConstructiveLogic.fst | ConstructiveLogic.ex9 | val ex9 : p: Prims.prop -> Prims.unit | let ex9 (p : prop) =
assert (p ==> (forall (_x:int). p))
by (let bp = implies_intro () in
let _bx = forall_intro () in
hyp (binding_to_namedv bp);
qed ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 172,
"start_col": 0,
"start_line": 167
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_Forall",
"Prims.int",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.forall... | [] | false | false | false | true | false | let ex9 (p: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p ==> (forall (_x: int). p))
(fun _ ->
();
(let bp = implies_intro () in
let _bx = forall_intro () in
hyp (binding_to_namedv bp);
qed ())) | false | |
Vale.PPC64LE.Memory_Sems.fst | Vale.PPC64LE.Memory_Sems.low_lemma_store_mem128_lo64 | val low_lemma_store_mem128_lo64 (b:buffer128) (i:nat) (v:nat64) (h:vale_heap) : Lemma
(requires
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b
)
(ensures (
let v' = insert_nat64 (buffer_read b i h) v 0 in
let m = S.update_heap64 (buffer_addr b h + scale16 i) v ... | val low_lemma_store_mem128_lo64 (b:buffer128) (i:nat) (v:nat64) (h:vale_heap) : Lemma
(requires
i < Seq.length (buffer_as_seq h b) /\
buffer_readable h b /\
buffer_writeable b
)
(ensures (
let v' = insert_nat64 (buffer_read b i h) v 0 in
let m = S.update_heap64 (buffer_addr b h + scale16 i) v ... | let low_lemma_store_mem128_lo64 b i v h =
let ptr = buffer_addr b h + scale16 i in
let v128 = buffer_read b i h in
let v' = insert_nat64 v128 v 0 in
low_lemma_load_mem128 b i h;
low_lemma_store_mem128 b i v' h;
S.get_heap_val128_reveal ();
update_heap128_lo ptr v' (get_heap h);
S.update_heap64_reveal ()... | {
"file_name": "vale/code/arch/ppc64le/Vale.PPC64LE.Memory_Sems.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 24,
"end_line": 1083,
"start_col": 0,
"start_line": 1073
} | module Vale.PPC64LE.Memory_Sems
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.PPC64LE.Machine_s
open Vale.PPC64LE.Memory
open Vale.Def.Words_s
module I = Vale.Interop
module S = Vale.PPC64LE.Semantics_s
module MB = LowStar.Monotonic.Buffer
module UV = LowStar.BufferView.Up
module DV = LowStar.Bu... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.BufferViewStore.fsti.checked",
"Vale.PPC64LE.Semantics_s.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Memory.fst.checked",
"Vale.PPC64LE.Machine_s.fst.checked",
"Vale.Lib.Buff... | [
{
"abbrev": false,
"full_module": "Vale.Def.Words.Four_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Def.Words.Two_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.BufferViewStore",
"short_module": null
},
{
"abbrev": t... | {
"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 |
b: Vale.PPC64LE.Memory.buffer128 ->
i: Prims.nat ->
v: Vale.Def.Types_s.nat64 ->
h: Vale.Arch.HeapImpl.vale_heap
-> FStar.Pervasives.Lemma
(requires
i < FStar.Seq.Base.length (Vale.PPC64LE.Memory.buffer_as_seq h b) /\
Vale.PPC64LE.Memory.buffer_readable h b /\ Vale.PPC64LE.Memor... | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Vale.PPC64LE.Memory.buffer128",
"Prims.nat",
"Vale.Def.Types_s.nat64",
"Vale.Arch.HeapImpl.vale_heap",
"Vale.Def.Types_s.insert_nat64_reveal",
"Prims.unit",
"Vale.Arch.MachineHeap_s.update_heap32_reveal",
"Vale.Arch.MachineHeap_s.update_heap64_reveal",
"Vale.PPC64LE.Memory_Sems.update_heap128_lo",
... | [] | true | false | true | false | false | let low_lemma_store_mem128_lo64 b i v h =
| let ptr = buffer_addr b h + scale16 i in
let v128 = buffer_read b i h in
let v' = insert_nat64 v128 v 0 in
low_lemma_load_mem128 b i h;
low_lemma_store_mem128 b i v' h;
S.get_heap_val128_reveal ();
update_heap128_lo ptr v' (get_heap h);
S.update_heap64_reveal ();
S.update_heap32_reveal ();
insert_nat64_reveal () | false |
ConstructiveLogic.fst | ConstructiveLogic.ex10 | val ex10 : p: (_: Prims.int -> Prims.prop) -> Prims.unit | let ex10 (p : int -> prop) =
assert ((forall x. p x) ==> (exists x. p x))
by (let bf = implies_intro () in
witness (`0);
let bp0 = instantiate (binding_to_term bf) (`0) in
hyp (binding_to_namedv bp0)) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 38,
"end_line": 184,
"start_col": 0,
"start_line": 179
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: (_: Prims.int -> Prims.prop) -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.int",
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_Forall",
"Prims.l_Exists",
"Prims.unit",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V2.Logic.instantiate",
"FSt... | [] | false | false | false | true | false | let ex10 (p: (int -> prop)) =
| FStar.Tactics.Effect.assert_by_tactic ((forall x. p x) ==> (exists x. p x))
(fun _ ->
();
(let bf = implies_intro () in
witness (`0);
let bp0 = instantiate (binding_to_term bf) (`0) in
hyp (binding_to_namedv bp0))) | false | |
ConstructiveLogic.fst | ConstructiveLogic.ex7 | val ex7 : p: Prims.prop -> q: Prims.prop -> Prims.unit | let ex7 (p q : prop) =
assert (p \/ q ==> q \/ p)
by (let bp_or_q = implies_intro () in
cases_or (binding_to_term bp_or_q);
(* first case *)
let bp = implies_intro () in
right ();
hyp (binding_to_namedv bp);
(* second case *)
let bq =... | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 151,
"start_col": 0,
"start_line": 139
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.prop -> q: Prims.prop -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_or",
"Prims.unit",
"FStar.Tactics.V2.Derived.qed",
"FStar.Tactics.V2.Logic.hyp",
"FStar.Tactics.V2.SyntaxCoercions.binding_to_namedv",
"FStar.Tactics.V2.Logic.left",
"FStar.Tactics.NamedView.binding",
"FStar.Tactics.V... | [] | false | false | false | true | false | let ex7 (p q: prop) =
| FStar.Tactics.Effect.assert_by_tactic (p \/ q ==> q \/ p)
(fun _ ->
();
(let bp_or_q = implies_intro () in
cases_or (binding_to_term bp_or_q);
let bp = implies_intro () in
right ();
hyp (binding_to_namedv bp);
let bq = implies_intro () in
left ();
hy... | false | |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_AESNI_dec | val va_lemma_AESNI_dec : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm -> src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_dec dst src) va_s0 /\ va_is_dst_xmm dst va_s0 /\
va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensures (fun (va_s... | val va_lemma_AESNI_dec : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm -> src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_dec dst src) va_s0 /\ va_is_dst_xmm dst va_s0 /\
va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensures (fun (va_s... | let va_lemma_AESNI_dec va_b0 va_s0 dst src =
va_reveal_opaque (`%va_code_AESNI_dec) (va_code_AESNI_dec dst src);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_dec) (OReg dst) (OReg src))) va_s0;
let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_AESNI_dec) (OReg dst) ... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 240,
"start_col": 0,
"start_line": 234
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"Vale.X64.Taint_Se... | [] | false | false | false | false | false | let va_lemma_AESNI_dec va_b0 va_s0 dst src =
| va_reveal_opaque (`%va_code_AESNI_dec) (va_code_AESNI_dec dst src);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_dec) (OReg dst) (OReg src))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_AESNI_dec) (OReg dst) (OReg src))) va_s0
in
(va_sM, va_fM) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_AESNI_dec_last | val va_lemma_AESNI_dec_last : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_dec_last dst src) va_s0 /\ va_is_dst_xmm dst
va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensure... | val va_lemma_AESNI_dec_last : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_dec_last dst src) va_s0 /\ va_is_dst_xmm dst
va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensure... | let va_lemma_AESNI_dec_last va_b0 va_s0 dst src =
va_reveal_opaque (`%va_code_AESNI_dec_last) (va_code_AESNI_dec_last dst src);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_dec_last) (OReg dst) (OReg src))) va_s0;
let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_AE... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 305,
"start_col": 0,
"start_line": 299
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"Vale.X64.Taint_Se... | [] | false | false | false | false | false | let va_lemma_AESNI_dec_last va_b0 va_s0 dst src =
| va_reveal_opaque (`%va_code_AESNI_dec_last) (va_code_AESNI_dec_last dst src);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_dec_last) (OReg dst) (OReg src))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_AESNI_dec_last) (OReg dst) (OReg src))) va_s0
in
(va_sM, va_fM... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_code_AESNI_dec_last | val va_code_AESNI_dec_last : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | val va_code_AESNI_dec_last : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | let va_code_AESNI_dec_last dst src =
(mk_ins (make_instr (I.ins_AESNI_dec_last) (OReg dst) (OReg src))) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 68,
"end_line": 280,
"start_col": 0,
"start_line": 279
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm -> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Taint_Semantics.mk_ins",
"Vale.X64.InsLemmas.make_instr",
"Prims.Cons",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Instruction_s.inOut",
"Vale.X64.Instruction_s.opXmm",
"Prims.Nil",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Instruction_s.Preser... | [] | false | false | false | true | false | let va_code_AESNI_dec_last dst src =
| (mk_ins (make_instr (I.ins_AESNI_dec_last) (OReg dst) (OReg src))) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_code_AESNI_keygen_assist | val va_code_AESNI_keygen_assist : dst:va_operand_xmm -> src:va_operand_xmm -> imm:nat8 -> Tot
va_code | val va_code_AESNI_keygen_assist : dst:va_operand_xmm -> src:va_operand_xmm -> imm:nat8 -> Tot
va_code | let va_code_AESNI_keygen_assist dst src imm =
(mk_ins (make_instr (I.ins_AESNI_keygen_assist imm) (OReg dst) (OReg src))) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 77,
"end_line": 405,
"start_col": 0,
"start_line": 404
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
imm: Vale.Def.Types_s.nat8
-> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.Def.Types_s.nat8",
"Vale.X64.Taint_Semantics.mk_ins",
"Vale.X64.InsLemmas.make_instr",
"Prims.Cons",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Instruction_s.out",
"Vale.X64.Instruction_s.opXmm",
"Prims.Nil",
"Vale.X64.Instruction_s.instr_operand",
"Vale... | [] | false | false | false | true | false | let va_code_AESNI_keygen_assist dst src imm =
| (mk_ins (make_instr (I.ins_AESNI_keygen_assist imm) (OReg dst) (OReg src))) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_AESNI_dec_last | val va_wpProof_AESNI_dec_last : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_dec_last dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_dec_last... | val va_wpProof_AESNI_dec_last : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_dec_last dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_dec_last... | let va_wpProof_AESNI_dec_last dst src va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AESNI_dec_last (va_code_AESNI_dec_last dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));
va_lemma_norm_mods ([v... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 332,
"start_col": 0,
"start_line": 325
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Ni... | [] | false | false | false | false | false | let va_wpProof_AESNI_dec_last dst src va_s0 va_k =
| let va_sM, va_f0 = va_lemma_AESNI_dec_last (va_code_AESNI_dec_last dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
let va_g = () in... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_code_AESNI_imc | val va_code_AESNI_imc : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | val va_code_AESNI_imc : dst:va_operand_xmm -> src:va_operand_xmm -> Tot va_code | let va_code_AESNI_imc dst src =
(mk_ins (make_instr (I.ins_AESNI_imc) (OReg dst) (OReg src))) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 63,
"end_line": 345,
"start_col": 0,
"start_line": 344
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm -> Vale.X64.Decls.va_code | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Taint_Semantics.mk_ins",
"Vale.X64.InsLemmas.make_instr",
"Prims.Cons",
"Vale.X64.Instruction_s.instr_out",
"Vale.X64.Instruction_s.out",
"Vale.X64.Instruction_s.opXmm",
"Prims.Nil",
"Vale.X64.Instruction_s.instr_operand",
"Vale.X64.Instruction_s.Preserve... | [] | false | false | false | true | false | let va_code_AESNI_imc dst src =
| (mk_ins (make_instr (I.ins_AESNI_imc) (OReg dst) (OReg src))) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_AESNI_imc | val va_wpProof_AESNI_imc : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_imc dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_imc dst src) ([va_... | val va_wpProof_AESNI_imc : dst:va_operand_xmm -> src:va_operand_xmm -> va_s0:va_state ->
va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_imc dst src va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensure (va_code_AESNI_imc dst src) ([va_... | let va_wpProof_AESNI_imc dst src va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AESNI_imc (va_code_AESNI_imc dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 393,
"start_col": 0,
"start_line": 386
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Ni... | [] | false | false | false | false | false | let va_wpProof_AESNI_imc dst src va_s0 va_k =
| let va_sM, va_f0 = va_lemma_AESNI_imc (va_code_AESNI_imc dst src) va_s0 dst src in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_s0;
let va_g = () in
(va_sM, v... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_quick_AESNI_dec_last | val va_quick_AESNI_dec_last (dst src: va_operand_xmm)
: (va_quickCode unit (va_code_AESNI_dec_last dst src)) | val va_quick_AESNI_dec_last (dst src: va_operand_xmm)
: (va_quickCode unit (va_code_AESNI_dec_last dst src)) | let va_quick_AESNI_dec_last (dst:va_operand_xmm) (src:va_operand_xmm) : (va_quickCode unit
(va_code_AESNI_dec_last dst src)) =
(va_QProc (va_code_AESNI_dec_last dst src) ([va_Mod_flags; va_mod_xmm dst]) (va_wp_AESNI_dec_last
dst src) (va_wpProof_AESNI_dec_last dst src)) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 49,
"end_line": 338,
"start_col": 0,
"start_line": 335
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsAes.va_code_AESNI_dec_last dst src) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.QuickCode.va_QProc",
"Prims.unit",
"Vale.X64.InsAes.va_code_AESNI_dec_last",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Nil",
"Vale.X64.InsAes.va_wp_AESNI_dec_last",
"Vale.X64.Ins... | [] | false | false | false | false | false | let va_quick_AESNI_dec_last (dst src: va_operand_xmm)
: (va_quickCode unit (va_code_AESNI_dec_last dst src)) =
| (va_QProc (va_code_AESNI_dec_last dst src)
([va_Mod_flags; va_mod_xmm dst])
(va_wp_AESNI_dec_last dst src)
(va_wpProof_AESNI_dec_last dst src)) | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_quick_AESNI_imc | val va_quick_AESNI_imc (dst src: va_operand_xmm) : (va_quickCode unit (va_code_AESNI_imc dst src)) | val va_quick_AESNI_imc (dst src: va_operand_xmm) : (va_quickCode unit (va_code_AESNI_imc dst src)) | let va_quick_AESNI_imc (dst:va_operand_xmm) (src:va_operand_xmm) : (va_quickCode unit
(va_code_AESNI_imc dst src)) =
(va_QProc (va_code_AESNI_imc dst src) ([va_Mod_flags; va_mod_xmm dst]) (va_wp_AESNI_imc dst src)
(va_wpProof_AESNI_imc dst src)) | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 35,
"end_line": 399,
"start_col": 0,
"start_line": 396
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 | dst: Vale.X64.Decls.va_operand_xmm -> src: Vale.X64.Decls.va_operand_xmm
-> Vale.X64.QuickCode.va_quickCode Prims.unit (Vale.X64.InsAes.va_code_AESNI_imc dst src) | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.QuickCode.va_QProc",
"Prims.unit",
"Vale.X64.InsAes.va_code_AESNI_imc",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCode.va_mod_xmm",
"Prims.Nil",
"Vale.X64.InsAes.va_wp_AESNI_imc",
"Vale.X64.InsAes.va_wpP... | [] | false | false | false | false | false | let va_quick_AESNI_imc (dst src: va_operand_xmm) : (va_quickCode unit (va_code_AESNI_imc dst src)) =
| (va_QProc (va_code_AESNI_imc dst src)
([va_Mod_flags; va_mod_xmm dst])
(va_wp_AESNI_imc dst src)
(va_wpProof_AESNI_imc dst src)) | false |
ConstructiveLogic.fst | ConstructiveLogic.ex11 | val ex11 : p: (_: Prims.nat -> Prims.prop) -> q: (_: Prims.nat -> Prims.prop) -> Prims.unit | let ex11 (p q : nat -> prop) =
assert ((forall x. p x) ==> (forall x. p x \/ q x))
by (smt ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 191,
"start_col": 0,
"start_line": 189
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: (_: Prims.nat -> Prims.prop) -> q: (_: Prims.nat -> Prims.prop) -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_Forall",
"Prims.l_or",
"Prims.unit",
"FStar.Tactics.V2.Derived.smt"
] | [] | false | false | false | true | false | let ex11 (p q: (nat -> prop)) =
| FStar.Tactics.Effect.assert_by_tactic ((forall x. p x) ==> (forall x. p x \/ q x))
(fun _ ->
();
(smt ())) | false | |
ConstructiveLogic.fst | ConstructiveLogic.modulo_add | val modulo_add (p: pos) (a b c: int)
: Lemma (requires (b % p == c % p)) (ensures ((a + b) % p == (a + c) % p)) | val modulo_add (p: pos) (a b c: int)
: Lemma (requires (b % p == c % p)) (ensures ((a + b) % p == (a + c) % p)) | let modulo_add (p:pos) (a b c : int)
: Lemma (requires (b % p == c % p)) (ensures ((a + b) % p == (a + c) % p))
= FStar.Math.Lemmas.modulo_distributivity a b p;
FStar.Math.Lemmas.modulo_distributivity a c p | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 49,
"end_line": 28,
"start_col": 0,
"start_line": 25
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: Prims.pos -> a: Prims.int -> b: Prims.int -> c: Prims.int
-> FStar.Pervasives.Lemma (requires b % p == c % p) (ensures (a + b) % p == (a + c) % p) | FStar.Pervasives.Lemma | [
"lemma"
] | [] | [
"Prims.pos",
"Prims.int",
"FStar.Math.Lemmas.modulo_distributivity",
"Prims.unit",
"Prims.eq2",
"Prims.op_Modulus",
"Prims.squash",
"Prims.op_Addition",
"Prims.Nil",
"FStar.Pervasives.pattern"
] | [] | true | false | true | false | false | let modulo_add (p: pos) (a b c: int)
: Lemma (requires (b % p == c % p)) (ensures ((a + b) % p == (a + c) % p)) =
| FStar.Math.Lemmas.modulo_distributivity a b p;
FStar.Math.Lemmas.modulo_distributivity a c p | false |
ConstructiveLogic.fst | ConstructiveLogic.ex14 | val ex14 : a: Type -> p: (_: a -> Prims.prop) -> q: (_: a -> Prims.prop) -> Prims.unit | let ex14 (a:Type) (p q : a -> prop) =
assert ((forall x. p x ==> q x) ==> (forall x. p x) ==> (forall x. q x))
by (smt ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 203,
"start_col": 0,
"start_line": 201
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | a: Type -> p: (_: a -> Prims.prop) -> q: (_: a -> Prims.prop) -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_Forall",
"Prims.unit",
"FStar.Tactics.V2.Derived.smt"
] | [] | false | false | false | true | false | let ex14 (a: Type) (p q: (a -> prop)) =
| FStar.Tactics.Effect.assert_by_tactic ((forall x. p x ==> q x) ==>
(forall x. p x) ==> (forall x. q x))
(fun _ ->
();
(smt ())) | false | |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_AESNI_imc | val va_lemma_AESNI_imc : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm -> src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_imc dst src) va_s0 /\ va_is_dst_xmm dst va_s0 /\
va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensures (fun (va_s... | val va_lemma_AESNI_imc : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm -> src:va_operand_xmm
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_imc dst src) va_s0 /\ va_is_dst_xmm dst va_s0 /\
va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\ aesni_enabled))
(ensures (fun (va_s... | let va_lemma_AESNI_imc va_b0 va_s0 dst src =
va_reveal_opaque (`%va_code_AESNI_imc) (va_code_AESNI_imc dst src);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_imc) (OReg dst) (OReg src))) va_s0;
let (va_sM, va_fM) = va_eval_ins (mk_ins (make_instr (I.ins_AESNI_imc) (OReg dst) ... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 368,
"start_col": 0,
"start_line": 362
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"Vale.X64.Taint_Se... | [] | false | false | false | false | false | let va_lemma_AESNI_imc va_b0 va_s0 dst src =
| va_reveal_opaque (`%va_code_AESNI_imc) (va_code_AESNI_imc dst src);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_imc) (OReg dst) (OReg src))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_AESNI_imc) (OReg dst) (OReg src))) va_s0
in
(va_sM, va_fM) | false |
ConstructiveLogic.fst | ConstructiveLogic.ex12 | val ex12 : p: (_: Prims.nat -> Prims.prop) -> q: (_: Prims.nat -> Prims.prop) -> Prims.unit | let ex12 (p q : nat -> prop) =
assert ((forall x. p x /\ q x) ==> (forall x. p x))
by (smt ()) | {
"file_name": "examples/tactics/eci19/ConstructiveLogic.fst",
"git_rev": "10183ea187da8e8c426b799df6c825e24c0767d3",
"git_url": "https://github.com/FStarLang/FStar.git",
"project_name": "FStar"
} | {
"end_col": 17,
"end_line": 195,
"start_col": 0,
"start_line": 193
} | module ConstructiveLogic
open FStar.Tactics.V2
(*
As you probably know by now, verification in F* works by first computing
verification conditions for terms, and then discharging them via the SMT
solver (when they are not trivial).
When a program fails to verify, the user can take one of many paths.
Firstly, one can... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Tactics.V2.fst.checked",
"FStar.Tactics.Effect.fsti.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Math.Lemmas.fst.checked"
],
"interface_file": false,
"source_file": "ConstructiveLogic.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 | p: (_: Prims.nat -> Prims.prop) -> q: (_: Prims.nat -> Prims.prop) -> Prims.unit | Prims.Tot | [
"total"
] | [] | [
"Prims.nat",
"Prims.prop",
"FStar.Tactics.Effect.assert_by_tactic",
"Prims.l_imp",
"Prims.l_Forall",
"Prims.l_and",
"Prims.unit",
"FStar.Tactics.V2.Derived.smt"
] | [] | false | false | false | true | false | let ex12 (p q: (nat -> prop)) =
| FStar.Tactics.Effect.assert_by_tactic ((forall x. p x /\ q x) ==> (forall x. p x))
(fun _ ->
();
(smt ())) | false | |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_wpProof_AESNI_keygen_assist | val va_wpProof_AESNI_keygen_assist : dst:va_operand_xmm -> src:va_operand_xmm -> imm:nat8 ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_keygen_assist dst src imm va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensu... | val va_wpProof_AESNI_keygen_assist : dst:va_operand_xmm -> src:va_operand_xmm -> imm:nat8 ->
va_s0:va_state -> va_k:(va_state -> unit -> Type0)
-> Ghost (va_state & va_fuel & unit)
(requires (va_t_require va_s0 /\ va_wp_AESNI_keygen_assist dst src imm va_s0 va_k))
(ensures (fun (va_sM, va_f0, va_g) -> va_t_ensu... | let va_wpProof_AESNI_keygen_assist dst src imm va_s0 va_k =
let (va_sM, va_f0) = va_lemma_AESNI_keygen_assist (va_code_AESNI_keygen_assist dst src imm) va_s0
dst src imm in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM (va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst
va_sM va_s... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 22,
"end_line": 430,
"start_col": 0,
"start_line": 422
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"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 |
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
imm: Vale.Def.Types_s.nat8 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Prims.Ghost ((Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) * Prims.unit) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_operand_xmm",
"Vale.Def.Types_s.nat8",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.Mktuple3",
"Vale.X64.QuickCode.va_lemma_norm_mods",
"Prims.Cons",
"Vale.X64.QuickCode.mod_t",
"Vale.X64.QuickCode.va_Mod_flags",
"Vale.X64.QuickCo... | [] | false | false | false | false | false | let va_wpProof_AESNI_keygen_assist dst src imm va_s0 va_k =
| let va_sM, va_f0 =
va_lemma_AESNI_keygen_assist (va_code_AESNI_keygen_assist dst src imm) va_s0 dst src imm
in
va_lemma_upd_update va_sM;
assert (va_state_eq va_sM
(va_update_flags va_sM (va_update_ok va_sM (va_update_operand_xmm dst va_sM va_s0))));
va_lemma_norm_mods ([va_Mod_flags; va_mod_xmm dst]) va_sM va_... | false |
Vale.AES.X64.AESGCM.fst | Vale.AES.X64.AESGCM.va_qcode_AES_GCM_decrypt_6mult | val va_qcode_AES_GCM_decrypt_6mult
(va_mods: va_mods_t)
(alg: algorithm)
(h_LE: quad32)
(iv_b in_b out_b scratch_b: buffer128)
(key_words: (seq nat32))
(round_keys: (seq quad32))
(keys_b hkeys_b: buffer128)
: (va_quickCode unit (va_code_AES_GCM_decrypt_6mult alg)) | val va_qcode_AES_GCM_decrypt_6mult
(va_mods: va_mods_t)
(alg: algorithm)
(h_LE: quad32)
(iv_b in_b out_b scratch_b: buffer128)
(key_words: (seq nat32))
(round_keys: (seq quad32))
(keys_b hkeys_b: buffer128)
: (va_quickCode unit (va_code_AES_GCM_decrypt_6mult alg)) | let va_qcode_AES_GCM_decrypt_6mult (va_mods:va_mods_t) (alg:algorithm) (h_LE:quad32)
(iv_b:buffer128) (in_b:buffer128) (out_b:buffer128) (scratch_b:buffer128) (key_words:(seq nat32))
(round_keys:(seq quad32)) (keys_b:buffer128) (hkeys_b:buffer128) : (va_quickCode unit
(va_code_AES_GCM_decrypt_6mult alg)) =
(qbl... | {
"file_name": "obj/Vale.AES.X64.AESGCM.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 85,
"end_line": 8040,
"start_col": 0,
"start_line": 7909
} | module Vale.AES.X64.AESGCM
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_mods: Vale.X64.QuickCode.va_mods_t ->
alg: Vale.AES.AES_common_s.algorithm ->
h_LE: Vale.X64.Decls.quad32 ->
iv_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
out_b: Vale.X64.Memory.buffer128 ->
scratch_b: Vale.X64.Memory.buffer128 ->
key_words: FStar.Seq.Base.seq... | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.QuickCode.va_mods_t",
"Vale.AES.AES_common_s.algorithm",
"Vale.X64.Decls.quad32",
"Vale.X64.Memory.buffer128",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.QuickCodes.qblock",
"Prims.unit",
"Prims.Cons",
"Vale.X64.Decls.va_code",
"Vale.X64.Machine_s.IfElse",
"Vale.X64.Dec... | [] | false | false | false | false | false | let va_qcode_AES_GCM_decrypt_6mult
(va_mods: va_mods_t)
(alg: algorithm)
(h_LE: quad32)
(iv_b in_b out_b scratch_b: buffer128)
(key_words: (seq nat32))
(round_keys: (seq quad32))
(keys_b hkeys_b: buffer128)
: (va_quickCode unit (va_code_AES_GCM_decrypt_6mult alg)) =
| (qblock va_mods
(fun (va_s: va_state) ->
let va_old_s:va_state = va_s in
va_QBind va_range1
"***** PRECONDITION NOT MET AT line 2445 column 8 of file /home/gebner/fstar_dataset/projects/hacl-star/vale/code/thirdPartyPorts/OpenSSL/aes/Vale.AES.X64.AESGCM.vaf *****"
(va_qIf va_mods... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_AESNI_keygen_assist | val va_lemma_AESNI_keygen_assist : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm -> imm:nat8
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_keygen_assist dst src imm) va_s0 /\
va_is_dst_xmm dst va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\... | val va_lemma_AESNI_keygen_assist : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm -> imm:nat8
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_AESNI_keygen_assist dst src imm) va_s0 /\
va_is_dst_xmm dst va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s0 /\... | let va_lemma_AESNI_keygen_assist va_b0 va_s0 dst src imm =
va_reveal_opaque (`%va_code_AESNI_keygen_assist) (va_code_AESNI_keygen_assist dst src imm);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_keygen_assist imm) (OReg dst) (OReg src))) va_s0;
let (va_sM, va_fM) = va_eval_i... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 418,
"start_col": 0,
"start_line": 412
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
imm: Vale.Def.Types_s.nat8
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Vale.Def.Types_s.nat8",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval... | [] | false | false | false | false | false | let va_lemma_AESNI_keygen_assist va_b0 va_s0 dst src imm =
| va_reveal_opaque (`%va_code_AESNI_keygen_assist) (va_code_AESNI_keygen_assist dst src imm);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_AESNI_keygen_assist imm) (OReg dst) (OReg src))) va_s0;
let va_sM, va_fM =
va_eval_ins (mk_ins (make_instr (I.ins_AESNI_keygen_assist imm) (OReg dst) (OR... | false |
Vale.AES.X64.AESGCM.fst | Vale.AES.X64.AESGCM.va_lemma_AES_GCM_decrypt_6mult | val va_lemma_AES_GCM_decrypt_6mult : va_b0:va_code -> va_s0:va_state -> alg:algorithm ->
h_LE:quad32 -> iv_b:buffer128 -> in_b:buffer128 -> out_b:buffer128 -> scratch_b:buffer128 ->
key_words:(seq nat32) -> round_keys:(seq quad32) -> keys_b:buffer128 -> hkeys_b:buffer128
-> Ghost (va_state & va_fuel)
(requires ... | val va_lemma_AES_GCM_decrypt_6mult : va_b0:va_code -> va_s0:va_state -> alg:algorithm ->
h_LE:quad32 -> iv_b:buffer128 -> in_b:buffer128 -> out_b:buffer128 -> scratch_b:buffer128 ->
key_words:(seq nat32) -> round_keys:(seq quad32) -> keys_b:buffer128 -> hkeys_b:buffer128
-> Ghost (va_state & va_fuel)
(requires ... | let va_lemma_AES_GCM_decrypt_6mult va_b0 va_s0 alg h_LE iv_b in_b out_b scratch_b key_words
round_keys keys_b hkeys_b =
let (va_mods:va_mods_t) = [va_Mod_flags; va_Mod_mem_heaplet 3; va_Mod_mem_heaplet 2;
va_Mod_mem_heaplet 6; va_Mod_xmm 15; va_Mod_xmm 14; va_Mod_xmm 13; va_Mod_xmm 12; va_Mod_xmm
11; va_Mod... | {
"file_name": "obj/Vale.AES.X64.AESGCM.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 8088,
"start_col": 0,
"start_line": 8043
} | module Vale.AES.X64.AESGCM
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
alg: Vale.AES.AES_common_s.algorithm ->
h_LE: Vale.X64.Decls.quad32 ->
iv_b: Vale.X64.Memory.buffer128 ->
in_b: Vale.X64.Memory.buffer128 ->
out_b: Vale.X64.Memory.buffer128 ->
scratch_b: Vale.X64.Memory.buffer128 ->
... | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.AES.AES_common_s.algorithm",
"Vale.X64.Decls.quad32",
"Vale.X64.Memory.buffer128",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"Vale.X64.QuickCodes.fuel",
"Prims.unit",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"... | [] | false | false | false | false | false | let va_lemma_AES_GCM_decrypt_6mult
va_b0
va_s0
alg
h_LE
iv_b
in_b
out_b
scratch_b
key_words
round_keys
keys_b
hkeys_b
=
| let va_mods:va_mods_t =
[
va_Mod_flags; va_Mod_mem_heaplet 3; va_Mod_mem_heaplet 2; va_Mod_mem_heaplet 6; va_Mod_xmm 15;
va_Mod_xmm 14; va_Mod_xmm 13; va_Mod_xmm 12; va_Mod_xmm 11; va_Mod_xmm 10; va_Mod_xmm 9;
va_Mod_xmm 8; va_Mod_xmm 7; va_Mod_xmm 6; va_Mod_xmm 5; va_Mod_xmm 4; va_Mod_xmm 3; va_Mod_xmm 2... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_VPclmulqdq | val va_lemma_VPclmulqdq : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src1:va_operand_xmm -> src2:va_operand_xmm -> src1Hi:bool -> src2Hi:bool
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_VPclmulqdq dst src1 src2 src1Hi src2Hi) va_s0 /\
va_is_dst_xmm dst va_s0 /\ va_is... | val va_lemma_VPclmulqdq : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src1:va_operand_xmm -> src2:va_operand_xmm -> src1Hi:bool -> src2Hi:bool
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_VPclmulqdq dst src1 src2 src1Hi src2Hi) va_s0 /\
va_is_dst_xmm dst va_s0 /\ va_is... | let va_lemma_VPclmulqdq va_b0 va_s0 dst src1 src2 src1Hi src2Hi =
va_reveal_opaque (`%va_code_VPclmulqdq) (va_code_VPclmulqdq dst src1 src2 src1Hi src2Hi);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_VPclmulqdq ((if src1Hi then 1 else 0) + (if src2Hi then
16 else 0))) (OReg dst)... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 70,
"start_col": 0,
"start_line": 63
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src1: Vale.X64.Decls.va_operand_xmm ->
src2: Vale.X64.Decls.va_operand_xmm ->
src1Hi: Prims.bool ->
src2Hi: Prims.bool
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Prims.bool",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"V... | [] | false | false | false | false | false | let va_lemma_VPclmulqdq va_b0 va_s0 dst src1 src2 src1Hi src2Hi =
| va_reveal_opaque (`%va_code_VPclmulqdq) (va_code_VPclmulqdq dst src1 src2 src1Hi src2Hi);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_VPclmulqdq ((if src1Hi then 1 else 0) +
(if src2Hi then 16 else 0)))
(OReg dst)
(OReg src1)
(OReg src2)))
va_... | false |
Vale.X64.InsAes.fst | Vale.X64.InsAes.va_lemma_Pclmulqdq | val va_lemma_Pclmulqdq : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm -> dstHi:bool -> srcHi:bool
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Pclmulqdq dst src dstHi srcHi) va_s0 /\ va_is_dst_xmm
dst va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s... | val va_lemma_Pclmulqdq : va_b0:va_code -> va_s0:va_state -> dst:va_operand_xmm ->
src:va_operand_xmm -> dstHi:bool -> srcHi:bool
-> Ghost (va_state & va_fuel)
(requires (va_require_total va_b0 (va_code_Pclmulqdq dst src dstHi srcHi) va_s0 /\ va_is_dst_xmm
dst va_s0 /\ va_is_src_xmm src va_s0 /\ va_get_ok va_s... | let va_lemma_Pclmulqdq va_b0 va_s0 dst src dstHi srcHi =
va_reveal_opaque (`%va_code_Pclmulqdq) (va_code_Pclmulqdq dst src dstHi srcHi);
let (va_old_s:va_state) = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_Pclmulqdq ((if dstHi then 1 else 0) + (if srcHi then 16
else 0))) (OReg dst) (OReg src))) va_s0;
... | {
"file_name": "obj/Vale.X64.InsAes.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 36,
"start_col": 0,
"start_line": 29
} | module Vale.X64.InsAes
open Vale.Def.Types_s
open Vale.X64.Machine_s
open Vale.X64
open Vale.X64.State
open Vale.X64.StateLemmas
open Vale.X64.InsLemmas
open Vale.X64.Taint_Semantics
open Vale.X64.Decls
open Vale.X64.CPU_Features_s
module I = Vale.X64.Instructions_s
module S = Vale.X64.Machine_Semantics_s
module P = Va... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.Taint_Semantics.fst.checked",
"Vale.X64.StateLemmas.fsti.checked",
"Vale.X64.State.fsti.checked",
"Vale.X64.Print_s.fst.checked",
"Vale.X64.Machine_Semantics_s.fst.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.Instructions_s.fsti... | [
{
"abbrev": true,
"full_module": "Vale.X64.Print_s",
"short_module": "P"
},
{
"abbrev": true,
"full_module": "Vale.X64.Machine_Semantics_s",
"short_module": "S"
},
{
"abbrev": true,
"full_module": "Vale.X64.Instructions_s",
"short_module": "I"
},
{
"abbrev": false... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 4,
"initial_ifuel": 0,
"max_fuel": 4,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
dst: Vale.X64.Decls.va_operand_xmm ->
src: Vale.X64.Decls.va_operand_xmm ->
dstHi: Prims.bool ->
srcHi: Prims.bool
-> Prims.Ghost (Vale.X64.Decls.va_state * Vale.X64.Decls.va_fuel) | Prims.Ghost | [] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Decls.va_operand_xmm",
"Prims.bool",
"Vale.X64.State.vale_state",
"Vale.X64.Lemmas.fuel",
"FStar.Pervasives.Native.Mktuple2",
"Vale.X64.Decls.va_fuel",
"FStar.Pervasives.Native.tuple2",
"Prims.nat",
"Vale.X64.Decls.va_eval_ins",
"V... | [] | false | false | false | false | false | let va_lemma_Pclmulqdq va_b0 va_s0 dst src dstHi srcHi =
| va_reveal_opaque (`%va_code_Pclmulqdq) (va_code_Pclmulqdq dst src dstHi srcHi);
let va_old_s:va_state = va_s0 in
va_ins_lemma (mk_ins (make_instr (I.ins_Pclmulqdq ((if dstHi then 1 else 0) +
(if srcHi then 16 else 0)))
(OReg dst)
(OReg src)))
va_s0;
let va_sM, va_fM =
va_eval_ins... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_ens_Fmul | val va_ens_Fmul
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b inB_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop | val va_ens_Fmul
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b inB_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop | let va_ens_Fmul (va_b0:va_code) (va_s0:va_state) (tmp_b:buffer64) (inA_b:buffer64) (dst_b:buffer64)
(inB_b:buffer64) (va_sM:va_state) (va_fM:va_fuel) : prop =
(va_req_Fmul va_b0 va_s0 tmp_b inA_b dst_b inB_b /\ va_ensure_total va_b0 va_s0 va_sM va_fM /\
va_get_ok va_sM /\ (let (tmp_in:nat64) = va_get_reg64 rRdi... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 33,
"end_line": 63,
"start_col": 0,
"start_line": 37
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
inB_b: Vale.X64.Memory.buffer64 ->
va_sM: Vale.X64.Decls.va_state ->
va_fM: Vale.X64.Decls.va_fuel
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Vale.X64.Decls.va_fuel",
"Prims.l_and",
"Vale.Curve25519.X64.FastWide.va_req_Fmul",
"Vale.X64.Decls.va_ensure_total",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Vale... | [] | false | false | false | true | true | let va_ens_Fmul
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b inB_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop =
| (va_req_Fmul va_b0 va_s0 tmp_b inA_b dst_b inB_b /\ va_ensure_total va_b0 va_s0 va_sM va_fM /\
va_get_ok va_sM /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR15 va_s0 in
let inB_in:nat64 = va_get_reg64 rRcx va_s0 in
l... | false |
Steel.ST.GenElim.fst | Steel.ST.GenElim.compute_gen_elim_tele_correct_exists_unit | val compute_gen_elim_tele_correct_exists_unit (ty: _) (body: (ty -> gen_unit_elim_i))
: Tot (ge_to_tele_t (GEExistsUnit #ty body)) | val compute_gen_elim_tele_correct_exists_unit (ty: _) (body: (ty -> gen_unit_elim_i))
: Tot (ge_to_tele_t (GEExistsUnit #ty body)) | let compute_gen_elim_tele_correct_exists_unit
(ty: _)
(body: ty -> gen_unit_elim_i)
: Tot (ge_to_tele_t (GEExistsUnit #ty body))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ (fun x -> compute_gen_unit_elim_p (body x)));
let x = elim_exists' () in
compute_gen_unit_elim_f (body x) _;
intro_pu... | {
"file_name": "lib/steel/Steel.ST.GenElim.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 43,
"end_line": 319,
"start_col": 0,
"start_line": 309
} | module Steel.ST.GenElim
let gen_elim_f
(p: vprop)
(a: Type0) // FIXME: generalize this universe
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) unit (fun _ -> ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false | ty: Type0 -> body: (_: ty -> Steel.ST.GenElim.Base.gen_unit_elim_i)
-> Steel.ST.GenElim.ge_to_tele_t (Steel.ST.GenElim.Base.GEExistsUnit body) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim.Base.gen_unit_elim_i",
"Steel.Memory.inames",
"Steel.ST.GenElim.rewrite_with_trefl",
"Steel.ST.Util.exists_",
"Steel.Effect.Common.star",
"Steel.ST.GenElim.Base.compute_gen_unit_elim_q",
"Steel.ST.Util.pure",
"Steel.ST.GenElim.Base.compute_gen_unit_elim_post",
"Steel.Effect.Common.... | [] | false | false | false | false | false | let compute_gen_elim_tele_correct_exists_unit (ty: _) (body: (ty -> gen_unit_elim_i))
: Tot (ge_to_tele_t (GEExistsUnit #ty body)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (exists_ (fun x -> compute_gen_unit_elim_p (body x)));
let x = elim_exists' () in
compute_gen_unit_elim_f (body x) _;
intro_pure (compute_gen_unit_elim_post (body x));
intro_exists x
(fun x -> (compute_gen_unit_elim_q (body x)) `star` (pure (compute_gen_u... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_wp_Fmul | val va_wp_Fmul
(tmp_b inA_b dst_b inB_b: buffer64)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_Fmul
(tmp_b inA_b dst_b inB_b: buffer64)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_Fmul (tmp_b:buffer64) (inA_b:buffer64) (dst_b:buffer64) (inB_b:buffer64) (va_s0:va_state)
(va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (let (tmp_in:nat64) = va_get_reg64 rRdi va_s0 in let (inA_in:nat64) =
va_get_reg64 rRsi va_s0 in let (dst_in:nat64) = va_get_reg64 rR15 va_s0 in le... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 64,
"end_line": 147,
"start_col": 0,
"start_line": 107
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
inB_b: Vale.X64.Memory.buffer64 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer64",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.adx_enabled",
"Vale.X64.CPU_Features_s.bmi2_enabled",
"Vale.X64.Memory.is_initial_heap",
"Vale.X64.Decls.va_get_mem_layout",
"Vale.X64.Decls.va_ge... | [] | false | false | false | true | true | let va_wp_Fmul
(tmp_b inA_b dst_b inB_b: buffer64)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR15 va_s0 in
let inB_in:nat64 = va_get_reg64 rRcx va_s0 in
adx_enabled /\ bmi2_enabled /\
Vale.X64.Memory.is_initial_heap (va_get_mem_layout va_s0) (va_... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_req_Fmul | val va_req_Fmul (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b inB_b: buffer64) : prop | val va_req_Fmul (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b inB_b: buffer64) : prop | let va_req_Fmul (va_b0:va_code) (va_s0:va_state) (tmp_b:buffer64) (inA_b:buffer64) (dst_b:buffer64)
(inB_b:buffer64) : prop =
(va_require_total va_b0 (va_code_Fmul ()) va_s0 /\ va_get_ok va_s0 /\ (let (tmp_in:nat64) =
va_get_reg64 rRdi va_s0 in let (inA_in:nat64) = va_get_reg64 rRsi va_s0 in let (dst_in:nat64) ... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 46,
"end_line": 36,
"start_col": 0,
"start_line": 22
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
inB_b: Vale.X64.Memory.buffer64
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Prims.l_and",
"Vale.X64.Decls.va_require_total",
"Vale.Curve25519.X64.FastWide.va_code_Fmul",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.adx_enabled",
"Vale.X64.CPU_Features_s.bmi2_enabled",
... | [] | false | false | false | true | true | let va_req_Fmul (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b inB_b: buffer64) : prop =
| (va_require_total va_b0 (va_code_Fmul ()) va_s0 /\ va_get_ok va_s0 /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR15 va_s0 in
let inB_in:nat64 = va_get_reg64 rRcx va_s0 in
adx_enabled /\ bmi2_enabled /\
Vale.X64.Mem... | false |
Steel.ST.GenElim.fst | Steel.ST.GenElim.compute_gen_elim_tele_correct_star_l | val compute_gen_elim_tele_correct_star_l (l: gen_elim_i) (ihl: ge_to_tele_t l) (ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru)) | val compute_gen_elim_tele_correct_star_l (l: gen_elim_i) (ihl: ge_to_tele_t l) (ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru)) | let compute_gen_elim_tele_correct_star_l
(l: gen_elim_i)
(ihl: ge_to_tele_t l)
(ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru))
= fun _ ->
rewrite_with_trefl (compute_gen_elim_p _) (compute_gen_elim_p l `star` compute_gen_unit_elim_p ru);
ihl _;
compute_gen_unit_elim_f ru _;
intro_pure (compute_g... | {
"file_name": "lib/steel/Steel.ST.GenElim.fst",
"git_rev": "f984200f79bdc452374ae994a5ca837496476c41",
"git_url": "https://github.com/FStarLang/steel.git",
"project_name": "steel"
} | {
"end_col": 42,
"end_line": 270,
"start_col": 0,
"start_line": 259
} | module Steel.ST.GenElim
let gen_elim_f
(p: vprop)
(a: Type0) // FIXME: generalize this universe
(q: (a -> vprop))
(post: (a -> prop))
: Tot Type
= ((opened: inames) -> STGhost a opened p q True post)
let gen_unit_elim_t (i: gen_unit_elim_i) : Tot Type =
gen_elim_f (compute_gen_unit_elim_p i) unit (fun _ -> ... | {
"checked_file": "/",
"dependencies": [
"prims.fst.checked",
"FStar.Pervasives.Native.fst.checked",
"FStar.Pervasives.fsti.checked",
"FStar.Ghost.fsti.checked",
"FStar.Classical.fsti.checked"
],
"interface_file": true,
"source_file": "Steel.ST.GenElim.fst"
} | [
{
"abbrev": true,
"full_module": "FStar.Tactics",
"short_module": "T"
},
{
"abbrev": false,
"full_module": "Steel.ST.GenElim.Base",
"short_module": null
},
{
"abbrev": false,
"full_module": "Steel.ST",
"short_module": null
},
{
"abbrev": false,
"full_module": ... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 1,
"max_fuel": 8,
"max_ifuel": 2,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
l: Steel.ST.GenElim.Base.gen_elim_i ->
ihl: Steel.ST.GenElim.ge_to_tele_t l ->
ru: Steel.ST.GenElim.Base.gen_unit_elim_i
-> Steel.ST.GenElim.ge_to_tele_t (Steel.ST.GenElim.Base.GEStarL l ru) | Prims.Tot | [
"total"
] | [] | [
"Steel.ST.GenElim.Base.gen_elim_i",
"Steel.ST.GenElim.ge_to_tele_t",
"Steel.ST.GenElim.Base.gen_unit_elim_i",
"Steel.Memory.inames",
"Steel.ST.GenElim.rewrite_with_trefl",
"Steel.ST.GenElim.tele_p",
"Steel.ST.GenElim.Base.tele_star_vprop",
"Steel.ST.GenElim.Base.compute_gen_elim_tele",
"Steel.ST.Gen... | [] | false | false | false | false | false | let compute_gen_elim_tele_correct_star_l (l: gen_elim_i) (ihl: ge_to_tele_t l) (ru: gen_unit_elim_i)
: Tot (ge_to_tele_t (GEStarL l ru)) =
| fun _ ->
rewrite_with_trefl (compute_gen_elim_p _)
((compute_gen_elim_p l) `star` (compute_gen_unit_elim_p ru));
ihl _;
compute_gen_unit_elim_f ru _;
intro_pure (compute_gen_unit_elim_post ru);
tele_star_vprop_correct _ _ _ _;
rewrite_with_trefl (tele_p _) (tele_p _) | false |
Vale.AES.X64.AESGCM.fst | Vale.AES.X64.AESGCM.va_wp_Loop6x_loop_body0 | val va_wp_Loop6x_loop_body0
(va_old: va_state)
(alg: algorithm)
(va_in_count: nat)
(va_in_ctr_BE_orig va_in_h_LE: quad32)
(va_in_hkeys_b va_in_in0_b va_in_in_b va_in_iv_b: buffer128)
(va_in_key_words: (seq nat32))
(va_in_keys_b va_in_out_b: buffer128)
(va_in_plain_quads v... | val va_wp_Loop6x_loop_body0
(va_old: va_state)
(alg: algorithm)
(va_in_count: nat)
(va_in_ctr_BE_orig va_in_h_LE: quad32)
(va_in_hkeys_b va_in_in0_b va_in_in_b va_in_iv_b: buffer128)
(va_in_key_words: (seq nat32))
(va_in_keys_b va_in_out_b: buffer128)
(va_in_plain_quads v... | let va_wp_Loop6x_loop_body0 (va_old:va_state) (alg:algorithm) (va_in_count:nat)
(va_in_ctr_BE_orig:quad32) (va_in_h_LE:quad32) (va_in_hkeys_b:buffer128) (va_in_in0_b:buffer128)
(va_in_in_b:buffer128) (va_in_iv_b:buffer128) (va_in_key_words:(seq nat32))
(va_in_keys_b:buffer128) (va_in_out_b:buffer128) (va_in_plain... | {
"file_name": "obj/Vale.AES.X64.AESGCM.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 53,
"end_line": 3747,
"start_col": 0,
"start_line": 3550
} | module Vale.AES.X64.AESGCM
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_old: Vale.X64.Decls.va_state ->
alg: Vale.AES.AES_common_s.algorithm ->
va_in_count: Prims.nat ->
va_in_ctr_BE_orig: Vale.X64.Decls.quad32 ->
va_in_h_LE: Vale.X64.Decls.quad32 ->
va_in_hkeys_b: Vale.X64.Memory.buffer128 ->
va_in_in0_b: Vale.X64.Memory.buffer128 ->
va_in_in_b: Vale.X6... | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_state",
"Vale.AES.AES_common_s.algorithm",
"Prims.nat",
"Vale.X64.Decls.quad32",
"Vale.X64.Memory.buffer128",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"FStar.Pervasives.Native.tuple3",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.sse... | [] | false | false | false | true | true | let va_wp_Loop6x_loop_body0
(va_old: va_state)
(alg: algorithm)
(va_in_count: nat)
(va_in_ctr_BE_orig va_in_h_LE: quad32)
(va_in_hkeys_b va_in_in0_b va_in_in_b va_in_iv_b: buffer128)
(va_in_key_words: (seq nat32))
(va_in_keys_b va_in_out_b: buffer128)
(va_in_plain_quads v... | (va_get_ok va_s0 /\ (sse_enabled /\ movbe_enabled) /\
va_get_reg64 rRdx va_s0 == va_get_reg64 rRdx va_old - 6 `op_Multiply` va_in_iter /\
va_get_reg64 rR14 va_s0 == va_get_reg64 rR14 va_old + 96 `op_Multiply` va_in_iter /\
va_get_reg64 rRdi va_s0 == va_get_reg64 rRdi va_old + 96 `op_Multiply` va_in_iter /\
va_g... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_wp_Fmul2 | val va_wp_Fmul2
(tmp_b inA_b dst_b inB_b: buffer64)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_Fmul2
(tmp_b inA_b dst_b inB_b: buffer64)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_Fmul2 (tmp_b:buffer64) (inA_b:buffer64) (dst_b:buffer64) (inB_b:buffer64)
(va_s0:va_state) (va_k:(va_state -> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (let (tmp_in:nat64) = va_get_reg64 rRdi va_s0 in let (inA_in:nat64) =
va_get_reg64 rRsi va_s0 in let (dst_in:nat64) = va_get_reg64 rR15 va_s0 in l... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 16,
"end_line": 547,
"start_col": 0,
"start_line": 493
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
inB_b: Vale.X64.Memory.buffer64 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer64",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.adx_enabled",
"Vale.X64.CPU_Features_s.bmi2_enabled",
"Vale.X64.Memory.is_initial_heap",
"Vale.X64.Decls.va_get_mem_layout",
"Vale.X64.Decls.va_ge... | [] | false | false | false | true | true | let va_wp_Fmul2
(tmp_b inA_b dst_b inB_b: buffer64)
(va_s0: va_state)
(va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR15 va_s0 in
let inB_in:nat64 = va_get_reg64 rRcx va_s0 in
adx_enabled /\ bmi2_enabled /\
Vale.X64.Memory.is_initial_heap (va_get_mem_layout va_s0) (va_... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_ens_Fmul2 | val va_ens_Fmul2
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b inB_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop | val va_ens_Fmul2
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b inB_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop | let va_ens_Fmul2 (va_b0:va_code) (va_s0:va_state) (tmp_b:buffer64) (inA_b:buffer64)
(dst_b:buffer64) (inB_b:buffer64) (va_sM:va_state) (va_fM:va_fuel) : prop =
(va_req_Fmul2 va_b0 va_s0 tmp_b inA_b dst_b inB_b /\ va_ensure_total va_b0 va_s0 va_sM va_fM /\
va_get_ok va_sM /\ (let (tmp_in:nat64) = va_get_reg64 rR... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 68,
"end_line": 436,
"start_col": 0,
"start_line": 397
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
inB_b: Vale.X64.Memory.buffer64 ->
va_sM: Vale.X64.Decls.va_state ->
va_fM: Vale.X64.Decls.va_fuel
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Vale.X64.Decls.va_fuel",
"Prims.l_and",
"Vale.Curve25519.X64.FastWide.va_req_Fmul2",
"Vale.X64.Decls.va_ensure_total",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Val... | [] | false | false | false | true | true | let va_ens_Fmul2
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b inB_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop =
| (va_req_Fmul2 va_b0 va_s0 tmp_b inA_b dst_b inB_b /\ va_ensure_total va_b0 va_s0 va_sM va_fM /\
va_get_ok va_sM /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR15 va_s0 in
let inB_in:nat64 = va_get_reg64 rRcx va_s0 in
... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_req_Fsqr | val va_req_Fsqr (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b: buffer64) : prop | val va_req_Fsqr (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b: buffer64) : prop | let va_req_Fsqr (va_b0:va_code) (va_s0:va_state) (tmp_b:buffer64) (inA_b:buffer64) (dst_b:buffer64)
: prop =
(va_require_total va_b0 (va_code_Fsqr ()) va_s0 /\ va_get_ok va_s0 /\ (let (tmp_in:nat64) =
va_get_reg64 rRdi va_s0 in let (inA_in:nat64) = va_get_reg64 rRsi va_s0 in let (dst_in:nat64) =
va_get_reg6... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 12,
"end_line": 832,
"start_col": 0,
"start_line": 821
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Prims.l_and",
"Vale.X64.Decls.va_require_total",
"Vale.Curve25519.X64.FastWide.va_code_Fsqr",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.adx_enabled",
"Vale.X64.CPU_Features_s.bmi2_enabled",
... | [] | false | false | false | true | true | let va_req_Fsqr (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b: buffer64) : prop =
| (va_require_total va_b0 (va_code_Fsqr ()) va_s0 /\ va_get_ok va_s0 /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR12 va_s0 in
adx_enabled /\ bmi2_enabled /\
Vale.X64.Memory.is_initial_heap (va_get_mem_layout va_s0) (va_... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_req_Fmul2 | val va_req_Fmul2 (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b inB_b: buffer64) : prop | val va_req_Fmul2 (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b inB_b: buffer64) : prop | let va_req_Fmul2 (va_b0:va_code) (va_s0:va_state) (tmp_b:buffer64) (inA_b:buffer64)
(dst_b:buffer64) (inB_b:buffer64) : prop =
(va_require_total va_b0 (va_code_Fmul2 ()) va_s0 /\ va_get_ok va_s0 /\ (let (tmp_in:nat64) =
va_get_reg64 rRdi va_s0 in let (inA_in:nat64) = va_get_reg64 rRsi va_s0 in let (dst_in:nat64... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 47,
"end_line": 396,
"start_col": 0,
"start_line": 382
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
inB_b: Vale.X64.Memory.buffer64
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Prims.l_and",
"Vale.X64.Decls.va_require_total",
"Vale.Curve25519.X64.FastWide.va_code_Fmul2",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.adx_enabled",
"Vale.X64.CPU_Features_s.bmi2_enabled",
... | [] | false | false | false | true | true | let va_req_Fmul2 (va_b0: va_code) (va_s0: va_state) (tmp_b inA_b dst_b inB_b: buffer64) : prop =
| (va_require_total va_b0 (va_code_Fmul2 ()) va_s0 /\ va_get_ok va_s0 /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR15 va_s0 in
let inB_in:nat64 = va_get_reg64 rRcx va_s0 in
adx_enabled /\ bmi2_enabled /\
Vale.X64.Me... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_wp_Fsqr | val va_wp_Fsqr (tmp_b inA_b dst_b: buffer64) (va_s0: va_state) (va_k: (va_state -> unit -> Type0))
: Type0 | val va_wp_Fsqr (tmp_b inA_b dst_b: buffer64) (va_s0: va_state) (va_k: (va_state -> unit -> Type0))
: Type0 | let va_wp_Fsqr (tmp_b:buffer64) (inA_b:buffer64) (dst_b:buffer64) (va_s0:va_state) (va_k:(va_state
-> unit -> Type0)) : Type0 =
(va_get_ok va_s0 /\ (let (tmp_in:nat64) = va_get_reg64 rRdi va_s0 in let (inA_in:nat64) =
va_get_reg64 rRsi va_s0 in let (dst_in:nat64) = va_get_reg64 rR12 va_s0 in adx_enabled /\
... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 52,
"end_line": 925,
"start_col": 0,
"start_line": 892
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
va_s0: Vale.X64.Decls.va_state ->
va_k: (_: Vale.X64.Decls.va_state -> _: Prims.unit -> Type0)
-> Type0 | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Memory.buffer64",
"Vale.X64.Decls.va_state",
"Prims.unit",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.adx_enabled",
"Vale.X64.CPU_Features_s.bmi2_enabled",
"Vale.X64.Memory.is_initial_heap",
"Vale.X64.Decls.va_get_mem_layout",
"Vale.X64.Decls.va_ge... | [] | false | false | false | true | true | let va_wp_Fsqr (tmp_b inA_b dst_b: buffer64) (va_s0: va_state) (va_k: (va_state -> unit -> Type0))
: Type0 =
| (va_get_ok va_s0 /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR12 va_s0 in
adx_enabled /\ bmi2_enabled /\
Vale.X64.Memory.is_initial_heap (va_get_mem_layout va_s0) (va_get_mem va_s0) /\
(Vale.X64.Decls.buffers_disj... | false |
Vale.Curve25519.X64.FastWide.fsti | Vale.Curve25519.X64.FastWide.va_ens_Fsqr | val va_ens_Fsqr
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop | val va_ens_Fsqr
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop | let va_ens_Fsqr (va_b0:va_code) (va_s0:va_state) (tmp_b:buffer64) (inA_b:buffer64) (dst_b:buffer64)
(va_sM:va_state) (va_fM:va_fuel) : prop =
(va_req_Fsqr va_b0 va_s0 tmp_b inA_b dst_b /\ va_ensure_total va_b0 va_s0 va_sM va_fM /\
va_get_ok va_sM /\ (let (tmp_in:nat64) = va_get_reg64 rRdi va_s0 in let (inA_in:n... | {
"file_name": "obj/Vale.Curve25519.X64.FastWide.fsti",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 69,
"end_line": 855,
"start_col": 0,
"start_line": 833
} | module Vale.Curve25519.X64.FastWide
open Vale.Def.Types_s
open Vale.Arch.Types
open Vale.Arch.HeapImpl
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.Stack_i
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsStack
open Vale.X64.QuickCode
open Vale.X64.Quick... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.Stack_i.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsStack.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.X64.CPU_Features_s",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.Curve25519.Fast_defs",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.X64.QuickCodes",
"short_module": null
},
{
"abbrev":... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_b0: Vale.X64.Decls.va_code ->
va_s0: Vale.X64.Decls.va_state ->
tmp_b: Vale.X64.Memory.buffer64 ->
inA_b: Vale.X64.Memory.buffer64 ->
dst_b: Vale.X64.Memory.buffer64 ->
va_sM: Vale.X64.Decls.va_state ->
va_fM: Vale.X64.Decls.va_fuel
-> Prims.prop | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_code",
"Vale.X64.Decls.va_state",
"Vale.X64.Memory.buffer64",
"Vale.X64.Decls.va_fuel",
"Prims.l_and",
"Vale.Curve25519.X64.FastWide.va_req_Fsqr",
"Vale.X64.Decls.va_ensure_total",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Prims.eq2",
"Prims.int",
"Prims.op_Modulus",
"Vale... | [] | false | false | false | true | true | let va_ens_Fsqr
(va_b0: va_code)
(va_s0: va_state)
(tmp_b inA_b dst_b: buffer64)
(va_sM: va_state)
(va_fM: va_fuel)
: prop =
| (va_req_Fsqr va_b0 va_s0 tmp_b inA_b dst_b /\ va_ensure_total va_b0 va_s0 va_sM va_fM /\
va_get_ok va_sM /\
(let tmp_in:nat64 = va_get_reg64 rRdi va_s0 in
let inA_in:nat64 = va_get_reg64 rRsi va_s0 in
let dst_in:nat64 = va_get_reg64 rR12 va_s0 in
let a0 = Vale.X64.Decls.buffer64_read inA_b 0 (va_get_mem... | false |
Vale.AES.X64.AESGCM.fst | Vale.AES.X64.AESGCM.va_wp_Loop6x_loop_while0 | val va_wp_Loop6x_loop_while0
(va_old: va_state)
(alg: algorithm)
(va_in_count: nat)
(va_in_ctr_BE_orig va_in_h_LE: quad32)
(va_in_hkeys_b va_in_in0_b va_in_in_b va_in_iv_b: buffer128)
(va_in_key_words: (seq nat32))
(va_in_keys_b va_in_out_b: buffer128)
(va_in_plain_quads ... | val va_wp_Loop6x_loop_while0
(va_old: va_state)
(alg: algorithm)
(va_in_count: nat)
(va_in_ctr_BE_orig va_in_h_LE: quad32)
(va_in_hkeys_b va_in_in0_b va_in_in_b va_in_iv_b: buffer128)
(va_in_key_words: (seq nat32))
(va_in_keys_b va_in_out_b: buffer128)
(va_in_plain_quads ... | let va_wp_Loop6x_loop_while0 (va_old:va_state) (alg:algorithm) (va_in_count:nat)
(va_in_ctr_BE_orig:quad32) (va_in_h_LE:quad32) (va_in_hkeys_b:buffer128) (va_in_in0_b:buffer128)
(va_in_in_b:buffer128) (va_in_iv_b:buffer128) (va_in_key_words:(seq nat32))
(va_in_keys_b:buffer128) (va_in_out_b:buffer128) (va_in_plai... | {
"file_name": "obj/Vale.AES.X64.AESGCM.fst",
"git_rev": "eb1badfa34c70b0bbe0fe24fe0f49fb1295c7872",
"git_url": "https://github.com/project-everest/hacl-star.git",
"project_name": "hacl-star"
} | {
"end_col": 19,
"end_line": 4540,
"start_col": 0,
"start_line": 4343
} | module Vale.AES.X64.AESGCM
open FStar.Mul
open Vale.Def.Prop_s
open Vale.Def.Opaque_s
open Vale.Def.Words_s
open Vale.Def.Types_s
open FStar.Seq
open Vale.AES.AES_s
open Vale.X64.Machine_s
open Vale.X64.Memory
open Vale.X64.State
open Vale.X64.Decls
open Vale.X64.InsBasic
open Vale.X64.InsMem
open Vale.X64.InsVector
op... | {
"checked_file": "/",
"dependencies": [
"Vale.X64.State.fsti.checked",
"Vale.X64.QuickCodes.fsti.checked",
"Vale.X64.QuickCode.fst.checked",
"Vale.X64.Memory.fsti.checked",
"Vale.X64.Machine_s.fst.checked",
"Vale.X64.InsVector.fsti.checked",
"Vale.X64.InsMem.fsti.checked",
"Vale.X64... | [
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt2",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.X64.AESopt",
"short_module": null
},
{
"abbrev": false,
"full_module": "Vale.AES.GHash",
"short_module": null
},
{
"abbrev": false,
"f... | {
"detail_errors": false,
"detail_hint_replay": false,
"initial_fuel": 2,
"initial_ifuel": 0,
"max_fuel": 1,
"max_ifuel": 1,
"no_plugins": false,
"no_smt": false,
"no_tactics": false,
"quake_hi": 1,
"quake_keep": false,
"quake_lo": 1,
"retry": false,
"reuse_hint_for": null,
"smtencoding_el... | false |
va_old: Vale.X64.Decls.va_state ->
alg: Vale.AES.AES_common_s.algorithm ->
va_in_count: Prims.nat ->
va_in_ctr_BE_orig: Vale.X64.Decls.quad32 ->
va_in_h_LE: Vale.X64.Decls.quad32 ->
va_in_hkeys_b: Vale.X64.Memory.buffer128 ->
va_in_in0_b: Vale.X64.Memory.buffer128 ->
va_in_in_b: Vale.X6... | Prims.Tot | [
"total"
] | [] | [
"Vale.X64.Decls.va_state",
"Vale.AES.AES_common_s.algorithm",
"Prims.nat",
"Vale.X64.Decls.quad32",
"Vale.X64.Memory.buffer128",
"FStar.Seq.Base.seq",
"Vale.X64.Memory.nat32",
"FStar.Pervasives.Native.tuple3",
"Prims.l_and",
"Prims.b2t",
"Vale.X64.Decls.va_get_ok",
"Vale.X64.CPU_Features_s.sse... | [] | false | false | false | true | true | let va_wp_Loop6x_loop_while0
(va_old: va_state)
(alg: algorithm)
(va_in_count: nat)
(va_in_ctr_BE_orig va_in_h_LE: quad32)
(va_in_hkeys_b va_in_in0_b va_in_in_b va_in_iv_b: buffer128)
(va_in_key_words: (seq nat32))
(va_in_keys_b va_in_out_b: buffer128)
(va_in_plain_quads ... | (va_get_ok va_s0 /\ (sse_enabled /\ movbe_enabled) /\
va_get_reg64 rRdx va_s0 == va_get_reg64 rRdx va_old - 6 `op_Multiply` va_in_iter /\
va_get_reg64 rR14 va_s0 == va_get_reg64 rR14 va_old + 96 `op_Multiply` va_in_iter /\
va_get_reg64 rRdi va_s0 == va_get_reg64 rRdi va_old + 96 `op_Multiply` va_in_iter /\
va_g... | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.