1. 05 Jan, 2017 1 commit
  2. 03 Jan, 2017 1 commit
  3. 28 Dec, 2016 1 commit
  4. 09 Dec, 2016 1 commit
  5. 27 Nov, 2016 1 commit
  6. 24 Nov, 2016 1 commit
  7. 22 Nov, 2016 2 commits
  8. 21 Nov, 2016 1 commit
  9. 20 Nov, 2016 1 commit
  10. 10 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.
  12. 01 Nov, 2016 1 commit
  13. 28 Oct, 2016 1 commit
  14. 25 Oct, 2016 5 commits
  15. 05 Oct, 2016 1 commit
  16. 28 Sep, 2016 2 commits
  17. 27 Sep, 2016 2 commits
  18. 20 Sep, 2016 1 commit
  19. 19 Sep, 2016 3 commits
    • Robbert Krebbers's avatar
      Attempt at an iInduction tactic. · 9eb50174
      Robbert Krebbers authored
      This comment mostly addresses issue #34.
      There are still some issues:
      - For iLöb we can write `iLöb (x1 .. xn) as "IH"` to revert x1 .. xn
        before performing Löb induction. An analogue notation for iInduction
        results in parsing conflicts.
      - The names of the induction hypotheses in the Coq intro pattern are
        ignored. Instead, when using `iInduction x as pat "IH"` the induction
        hypotheses are given fresh names starting with "IH". The problem here
        is that the names in the introduction pattern are idents, whereas the
        induction hypotheses are inserted into the proof mode context, and thus
        need to have strings as names.
    • Robbert Krebbers's avatar
      Support for framing pure hypotheses. · 75ad3b2e
      Robbert Krebbers authored
      This closes issue 32.
    • Robbert Krebbers's avatar
  20. 09 Sep, 2016 1 commit
    • Robbert Krebbers's avatar
      Support for specialization of P₁ -★ .. -★ Pₙ -★ Q where Q is persistent. · 090aaea3
      Robbert Krebbers authored
      Before this commit, given "HP" : P and "H" : P -★ Q with Q persistent, one
      could write:
        iSpecialize ("H" with "#HP")
      to eliminate the wand in "H" while keeping the resource "HP". The lemma:
        own_valid : own γ x ⊢ ✓ x
      was the prototypical example where this pattern (using the #) was used.
      However, the pattern was too limited. For example, given "H" : P₁ -★ P₂ -★ Q",
      one could not write iSpecialize ("H" with "#HP₁") because P₂ -★ Q is not
      persistent, even when Q is.
      So, instead, this commit introduces the following tactic:
        iSpecialize pm_trm as #
      which allows one to eliminate implications and wands while being able to use
      all hypotheses to prove the premises, as well as being able to use all
      hypotheses to prove the resulting goal.
      In the case of iDestruct, we now check whether all branches of the introduction
      pattern start with an `#` (moving the hypothesis to the persistent context) or
      `%` (moving the hypothesis to the pure Coq context). If this is the case, we
      allow one to use all hypotheses for proving the premises, as well as for proving
      the resulting goal.
  21. 05 Sep, 2016 1 commit
  22. 30 Aug, 2016 1 commit
  23. 25 Aug, 2016 1 commit
  24. 24 Aug, 2016 2 commits
  25. 05 Aug, 2016 2 commits
    • Robbert Krebbers's avatar
    • 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.
      - 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).
  26. 28 Jul, 2016 2 commits
  27. 27 Jul, 2016 1 commit
  28. 25 Jul, 2016 1 commit