1. 20 Sep, 2016 3 commits
  2. 19 Sep, 2016 5 commits
  3. 09 Sep, 2016 3 commits
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
    • 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.
      090aaea3
  4. 05 Sep, 2016 1 commit
  5. 30 Aug, 2016 1 commit
  6. 25 Aug, 2016 2 commits
  7. 24 Aug, 2016 1 commit
  8. 08 Aug, 2016 1 commit
  9. 05 Aug, 2016 6 commits
    • Robbert Krebbers's avatar
      Improve error messages of iSplitL and iSplitR. · 8ff1fd84
      Robbert Krebbers authored
      This fixes issue #25.
      8ff1fd84
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
    • Robbert Krebbers's avatar
      d7d23b5e
    • Robbert Krebbers's avatar
      More introduction patterns. · 4d8c4ac8
      Robbert Krebbers authored
      Also make those for introduction and elimination more symmetric:
      
        !%   pure introduction         %        pure elimination
        !#   always introduction       #        always elimination
        !>   later introduction        > pat    timeless later elimination
        !==> view shift introduction   ==> pat  view shift elimination
      4d8c4ac8
    • 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
  10. 04 Aug, 2016 2 commits
  11. 02 Aug, 2016 1 commit
  12. 28 Jul, 2016 2 commits
  13. 27 Jul, 2016 1 commit
  14. 26 Jul, 2016 1 commit
  15. 25 Jul, 2016 2 commits
  16. 13 Jul, 2016 1 commit
  17. 05 Jul, 2016 1 commit
  18. 30 Jun, 2016 3 commits
  19. 29 Jun, 2016 1 commit
  20. 27 Jun, 2016 2 commits