1. 05 Jan, 2017 1 commit
  2. 03 Jan, 2017 1 commit
  3. 22 Dec, 2016 1 commit
  4. 20 Dec, 2016 1 commit
  5. 12 Dec, 2016 1 commit
  6. 09 Dec, 2016 6 commits
  7. 08 Dec, 2016 2 commits
  8. 06 Dec, 2016 3 commits
  9. 22 Nov, 2016 1 commit
  10. 08 Nov, 2016 1 commit
  11. 03 Nov, 2016 1 commit
    • Robbert Krebbers's avatar
      Use symbol ∗ for separating conjunction. · cc31476d
      Robbert Krebbers authored
      The old choice for ★ was a arbitrary: the precedence of the ASCII asterisk *
      was fixed at a wrong level in Coq, so we had to pick another symbol. The ★ was
      a random choice from a unicode chart.
      
      The new symbol ∗ (as proposed by David Swasey) corresponds better to
      conventional practise and matches the symbol we use on paper.
      cc31476d
  12. 01 Nov, 2016 3 commits
  13. 28 Oct, 2016 1 commit
  14. 25 Oct, 2016 1 commit
  15. 16 Oct, 2016 1 commit
  16. 12 Oct, 2016 1 commit
  17. 05 Oct, 2016 1 commit
  18. 30 Aug, 2016 1 commit
  19. 28 Aug, 2016 1 commit
  20. 23 Aug, 2016 1 commit
  21. 22 Aug, 2016 1 commit
    • Robbert Krebbers's avatar
      Generalize equality of heap_lang so it works on any value. · 8111cab0
      Robbert Krebbers authored
      This is more consistent with CAS, which also can be used on any value.
      Note that being able to (atomically) test for equality of any value and
      being able to CAS on any value is not realistic. See the discussion at
      https://gitlab.mpi-sws.org/FP/iris-coq/issues/26, and in particular JH
      Jourdan's observation:
      
        I think indeed for heap_lang this is just too complicated.
      
        Anyway, the role of heap_lang is not to model any actual
        programming language, but rather to show that we can do proofs
        about certain programs. The fact that you can write unrealistic
        programs is not a problem, IMHO. The only thing which is important
        is that the program that we write are realistic (i.e., faithfully
        represents the algorithm we want to p
      
      This commit is based on a commit by Zhen Zhang who generalized equality
      to work on any literal (and not just integers).
      8111cab0
  22. 08 Aug, 2016 1 commit
  23. 05 Aug, 2016 2 commits
    • Robbert Krebbers's avatar
      Rename the wp_focus tactic into wp_bind. · 149d1ec6
      Robbert Krebbers authored
      This better reflects the name of the bind rule.
      
      I renamed an internal tactic that was previously called wp_bind into
      wp_bind_core.
      149d1ec6
    • Robbert Krebbers's avatar
      Iris 3.0: invariants and weakest preconditions encoded in the logic. · 1f589858
      Robbert Krebbers authored
      This commit features:
      
      - A simpler model. The recursive domain equation no longer involves a triple
        containing invariants, physical state and ghost state, but just ghost state.
        Invariants and physical state are encoded using (higher-order) ghost state.
      
      - (Primitive) view shifts are formalized in the logic and all properties about
        it are proven in the logic instead of the model. Instead, the core logic
        features only a notion of raw view shifts which internalizing performing frame
        preserving updates.
      
      - A better behaved notion of mask changing view shifts. In particular, we no
        longer have side-conditions on transitivity of view shifts, and we have a
        rule for introduction of mask changing view shifts |={E1,E2}=> P with
        E2 ⊆ E1 which allows to postpone performing a view shift.
      
      - The weakest precondition connective is formalized in the logic using Banach's
        fixpoint. All properties about the connective are proven in the logic instead
        of directly in the model.
      
      - Adequacy is proven in the logic and uses a primitive form of adequacy for
        uPred that only involves raw views shifts and laters.
      
      Some remarks:
      
      - I have removed binary view shifts. I did not see a way to describe all rules
        of the new mask changing view shifts using those.
      - There is no longer the need for the notion of "frame shifting assertions" and
        these are thus removed. The rules for Hoare triples are thus also stated in
        terms of primitive view shifts.
      
      TODO:
      
      - Maybe rename primitive view shift into something more sensible
      - Figure out a way to deal with closed proofs (see the commented out stuff in
        tests/heap_lang and tests/barrier_client).
      1f589858
  24. 27 Jul, 2016 2 commits
  25. 20 Jul, 2016 1 commit
  26. 19 Jul, 2016 1 commit
  27. 15 Jul, 2016 1 commit
  28. 13 Jul, 2016 1 commit