1. 05 Jan, 2017 1 commit
  2. 03 Jan, 2017 1 commit
  3. 09 Dec, 2016 1 commit
  4. 22 Nov, 2016 1 commit
  5. 28 Oct, 2016 1 commit
  6. 25 Oct, 2016 3 commits
  7. 29 Aug, 2016 1 commit
  8. 10 Aug, 2016 1 commit
  9. 09 Aug, 2016 2 commits
  10. 08 Aug, 2016 1 commit
  11. 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.
      
      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
  12. 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
      cfb00b3e
  13. 27 May, 2016 1 commit
  14. 17 Mar, 2016 2 commits
  15. 10 Mar, 2016 1 commit
  16. 08 Mar, 2016 1 commit
  17. 07 Mar, 2016 2 commits
  18. 06 Mar, 2016 1 commit
  19. 03 Mar, 2016 1 commit
  20. 02 Mar, 2016 1 commit
  21. 01 Mar, 2016 1 commit
  22. 24 Feb, 2016 1 commit
  23. 23 Feb, 2016 1 commit
  24. 18 Feb, 2016 1 commit
  25. 17 Feb, 2016 1 commit
  26. 13 Feb, 2016 1 commit
  27. 11 Feb, 2016 1 commit
  28. 10 Feb, 2016 1 commit
    • Robbert Krebbers's avatar
      COFE distance is no longer trivial at index 0. · 07d525a0
      Robbert Krebbers authored
      This way we avoid many one-off indexes and no longer need special cases for
      index 0 in many definitions. For example, the definition of the distance
      relation on option and excl has become much easier. Also, uPreds no longer need
      to hold at index 0.
      
      In order to make this change possible, we had to change the notions of
      "contractive functions" and "chains" slightly.
      
      Thanks to Aleš Bizjak and Amin Timany for suggesting this change and to help
      with the proofs.
      07d525a0
  29. 08 Feb, 2016 1 commit
  30. 05 Feb, 2016 3 commits
  31. 04 Feb, 2016 2 commits
  32. 01 Feb, 2016 1 commit