1. 02 Nov, 2019 1 commit
  2. 14 Oct, 2019 1 commit
  3. 12 Oct, 2019 1 commit
  4. 13 Sep, 2019 1 commit
    • Jacques-Henri Jourdan's avatar
      Reorder Requires so that we do not depend of Export bugs. · 43a1a90f
      Jacques-Henri Jourdan authored
      The general idea is to first import/export modules which are further
      than the current one, and then import/export modules which are close
      dependencies.
      
      This commit tries to use the same order of imports for every file, and
      describes the convention in ProofGuide.md. There is one exception,
      where we do not follow said convention: in program_logic/weakestpre.v,
      using that order would break printing of texan triples (??).
      43a1a90f
  5. 07 Aug, 2019 1 commit
  6. 01 Jul, 2019 2 commits
  7. 29 Jun, 2019 1 commit
  8. 24 Jun, 2019 8 commits
  9. 18 Jun, 2019 2 commits
  10. 15 Jun, 2019 1 commit
  11. 14 Jun, 2019 1 commit
  12. 13 Jun, 2019 1 commit
  13. 10 Jun, 2019 2 commits
  14. 03 Jun, 2019 5 commits
  15. 02 Jun, 2019 1 commit
  16. 31 May, 2019 1 commit
  17. 22 Mar, 2019 1 commit
  18. 19 Mar, 2019 2 commits
  19. 14 Mar, 2019 1 commit
  20. 05 Mar, 2019 1 commit
  21. 29 Nov, 2018 1 commit
  22. 31 Oct, 2018 4 commits
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
      f7af5b3f
    • Robbert Krebbers's avatar
      Fine-grained post-conditions for forked-off threads. · ebf06f91
      Robbert Krebbers authored
      This commit extends the state interpretation with an additional parameter to
      talk about the number of forked-off threads, and a fixed postcondition for each
      forked-off thread:
      
          state_interp : Λstate → list Λobservation → nat → iProp Σ;
          fork_post : iProp Σ;
      
      This way, instead of having `True` as the post-condition of `Fork`, one can
      have any post-condition, which is then recorded in the state interpretation.
      The point of keeping track of the postconditions of forked-off threads, is that
      we get an (additional) stronger adequacy theorem:
      
          Theorem wp_strong_all_adequacy Σ Λ `{invPreG Σ} s e σ1 v vs σ2 φ :
             (∀ `{Hinv : invG Σ} κs,
               (|={⊤}=> ∃
                   (stateI : state Λ → list (observation Λ) → nat → iProp Σ)
                   (fork_post : iProp Σ),
                 let _ : irisG Λ Σ := IrisG _ _ _ Hinv stateI fork_post in
                 stateI σ1 κs 0 ∗ WP e @ s; ⊤ {{ v,
                   let m := length vs in
                   stateI σ2 [] m -∗ [∗] replicate m fork_post ={⊤,∅}=∗ ⌜ φ v ⌝ }})%I) →
            rtc erased_step ([e], σ1) (of_val <$> v :: vs, σ2) →
            φ v.
      
      The difference with the ordinary adequacy theorem is that this one only applies
      once all threads terminated. In this case, one gets back the post-conditions
      `[∗] replicate m fork_post` of all forked-off threads.
      
      In Iron we showed that we can use this mechanism to make sure that all
      resources are disposed of properly in the presence of fork-based concurrency.
      ebf06f91
    • Jacques-Henri Jourdan's avatar
      Get rid of useless IntoVal uses. · 3c5086b2
      Jacques-Henri Jourdan authored
      3c5086b2