1. 05 Aug, 2016 2 commits
    • 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
    • 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).
  2. 04 Aug, 2016 5 commits
  3. 02 Aug, 2016 1 commit
  4. 28 Jul, 2016 1 commit
  5. 27 Jul, 2016 5 commits
  6. 25 Jul, 2016 4 commits
  7. 22 Jul, 2016 1 commit
  8. 21 Jul, 2016 2 commits
  9. 20 Jul, 2016 3 commits
  10. 19 Jul, 2016 1 commit
    • Robbert Krebbers's avatar
      Solve atomic also using reification/vm_compute. · 2966b4da
      Robbert Krebbers authored
      I also reverted 7952bca4 since there is no need for atomic to be a
      boolean predicate anymore. Moreover, I introduced a hint database
      fsaV for solving side-conditions related to FSAs, in particular,
      side-conditions related to expressions being atomic.
  11. 13 Jul, 2016 1 commit
  12. 04 Jul, 2016 2 commits
  13. 03 Jul, 2016 2 commits
  14. 02 Jul, 2016 3 commits
  15. 01 Jul, 2016 1 commit
  16. 30 Jun, 2016 4 commits
  17. 23 Jun, 2016 1 commit
  18. 19 Jun, 2016 1 commit