1. 27 Sep, 2017 1 commit
    • Robbert Krebbers's avatar
      Fix issue #99. · 7ed067a9
      Robbert Krebbers authored
      This causes a bit of backwards incompatibility: it may now succeed with
      later stripping below unlocked/TC transparent definitions. This problem
      actually occured for `wsat`.
  2. 17 Sep, 2017 1 commit
  3. 24 Mar, 2017 1 commit
  4. 14 Mar, 2017 1 commit
    • Robbert Krebbers's avatar
      Extend specialization patterns. · 87a8a19c
      Robbert Krebbers authored
      - Support for a `//` modifier to close the goal using `done`.
      - Support for framing in the `[#]` specialization pattern for
        persistent premises, i.e. `[# $H1 $H2]`
      - Add new "auto framing patterns" `[$]`, `[# $]` and `>[$]` that
        will try to solve the premise by framing. Hypothesis that are
        not framed are carried over to the next goal.
  5. 06 Feb, 2017 1 commit
  6. 05 Jan, 2017 2 commits
  7. 04 Jan, 2017 1 commit
  8. 03 Jan, 2017 1 commit
  9. 09 Dec, 2016 1 commit
  10. 05 Dec, 2016 1 commit
    • Robbert Krebbers's avatar
      New definition of contractive. · 176a588c
      Robbert Krebbers authored
      Using this new definition we can express being contractive using a
      Proper. This has the following advantages:
      - It makes it easier to state that a function with multiple arguments
        is contractive (in all or some arguments).
      - A solve_contractive tactic can be implemented by extending the
        solve_proper tactic.
  11. 24 Nov, 2016 1 commit
  12. 22 Nov, 2016 1 commit
  13. 17 Nov, 2016 1 commit
  14. 15 Nov, 2016 1 commit
  15. 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.
  16. 28 Oct, 2016 2 commits
  17. 25 Oct, 2016 4 commits
  18. 12 Oct, 2016 1 commit
  19. 06 Oct, 2016 1 commit
  20. 05 Oct, 2016 1 commit
  21. 20 Sep, 2016 2 commits
  22. 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.
  23. 06 Sep, 2016 1 commit
  24. 11 Aug, 2016 1 commit
  25. 05 Aug, 2016 1 commit
    • 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. 31 May, 2016 1 commit
  27. 28 May, 2016 1 commit
    • Robbert Krebbers's avatar
      CMRAs with partial cores. · cfb00b3e
      Robbert Krebbers authored
      Based on an idea and WIP commits of J-H. Jourdan: the core of a CMRA
      A is now a partial function A → option A.
      TODO: define sum CMRA
      TODO: remove one shot CMRA and define it in terms of sum
  28. 27 May, 2016 2 commits
  29. 22 May, 2016 1 commit
  30. 29 Mar, 2016 1 commit
  31. 15 Mar, 2016 1 commit
  32. 11 Mar, 2016 2 commits