Skip to content
Snippets Groups Projects
Select Git revision
  • ci/debug
  • ci/for_proph
  • ci/janno/strict-tc-resolution
  • ci/ralf/Z_of_nat
  • ci/ralf/bi-language
  • ci/robbert/contractive_ne
  • ci/robbert/coq_bug_7773
  • ci/robbert/faster_iDestruct
  • ci/robbert/faster_iDestruct2
  • ci/robbert/faster_iFresh_joe
  • ci/robbert/frame_fractional
  • ci/robbert/iFrame
  • ci/robbert/into_fupd
  • ci/robbert/into_val_pures
  • ci/robbert/kill_locked_value_lambdas
  • ci/robbert/mapsto_persist
  • ci/robbert/merge_sbi
  • ci/robbert/naive_solver
  • ci/robbert/set_unfold
  • ci/robbert/tc_opaque
  • iris-3.4.0
  • iris-3.3.0
  • iris-3.2.0
  • iris-3.1.0
  • iris-3.0.0
  • iris-2.0
  • iris-2.0-rc2
  • iris-2.0-rc1
  • iris-1.1
  • iris-1.0
  • hope-2015-coq-1
  • appendix-1.0.0
  • appendix-1
33 results
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.016Feb151413121110985432131Jan302927262523222120191817161413129865422Dec21161514118423Nov22201918171612119630Oct2928272316151431Aug16Jul24Jun2215115432131May30Use some wp tactics in heap example.Missing heap_lang ;; notation for values.Use > for wp_tactics that do not strip later.wp_tactics: use wp_value afterwards instead of before.Merge branch 'master' of gitlab.mpi-sws.org:FP/iris-coqPreliminary version of tactics for automatically applying wp rules.Make reshape_expr more robust.Missing heap_lang let: notation for values.turn STSs into a record*finally* arrive at the weakening for STS state asswrtions that we needMerge branch 'master' of gitlab.mpi-sws.org:FP/iris-coqprove that we actually completely characterized inclusion of the STS RA; derive a simpler formGeneralize wp_fork to have an arbitrary post-condition.Put discrete_validI together with the other validIs and shorten its proof.Merge branch 'master' of gitlab.mpi-sws.org:FP/iris-coqStronger saved_prop_agree with equality instead of iff.Add reflexivity for equality to the uPred hint DB.Anti symmetry for sets.complete STS constructioncharacterize inclusion of sts_fragshow that monadic set operations respect the partial orderestablish monotnicity of ownershipsts: define state in terms of states; prove states_fsaprove sts.openingprove sts.opened; state sts.closingprove some properties of discrete CMRAssts: embrace modulesprove sts_alloc; play around with modules and namespaces for stsauth.v: reduce noise by putting definitions in a sectionbasics of Sts constructionsts: change order of S and T to consistently be "S T" (also for consistency with on-paper def.)heap: slightly simplifyMost language notation keywords include a colon: now if does too.Strenghten heap_alloc using big_op.Preliminary version of big_op over uPred for fin_map.Left and right mononicity properties for uPred_and and uPred_or.Remove outdated TODO.Rename from_heap -> of_heap.Remove the primitive for full ownership of a heap.More properties about auth_own.