1. 09 Dec, 2016 2 commits
    • Ralf Jung's avatar
      move everything to subfolder theories/ · 6b8069fa
      Ralf Jung authored
      6b8069fa
    • Robbert Krebbers's avatar
      Invariants over states in WP and get rid of heap_ctx. · fd89aa52
      Robbert Krebbers authored
      The WP construction now takes an invariant on states as a parameter
      (part of the irisG class) and no longer builds in the authoritative
      ownership of the entire state. When instantiating WP with a concrete
      language on can choose its state invariant. For example, for heap_lang
      we directly use `auth (gmap loc (frac * dec_agree val))`, and avoid
      the indirection through invariants entirely.
      
      As a result, we no longer have to carry `heap_ctx` around.
      fd89aa52
  2. 06 Dec, 2016 1 commit
  3. 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.
      176a588c
  4. 30 Nov, 2016 1 commit
  5. 24 Nov, 2016 1 commit
  6. 22 Nov, 2016 1 commit
  7. 17 Nov, 2016 2 commits
  8. 15 Nov, 2016 1 commit
  9. 09 Nov, 2016 1 commit
  10. 06 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.
      cc31476d
  12. 01 Nov, 2016 2 commits
  13. 28 Oct, 2016 2 commits
  14. 27 Oct, 2016 4 commits
  15. 25 Oct, 2016 6 commits
  16. 13 Oct, 2016 1 commit
  17. 12 Oct, 2016 1 commit
  18. 05 Oct, 2016 1 commit
  19. 28 Sep, 2016 1 commit
  20. 27 Sep, 2016 1 commit
  21. 05 Sep, 2016 1 commit
  22. 28 Aug, 2016 1 commit
  23. 25 Aug, 2016 1 commit
  24. 08 Aug, 2016 1 commit
  25. 05 Aug, 2016 3 commits
    • Robbert Krebbers's avatar
    • 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
  26. 21 Jul, 2016 1 commit
    • Robbert Krebbers's avatar
      Some tweaks. · 037d8d62
      Robbert Krebbers authored
      In particular, remove ectx_language.atomic, because it seems unused
      expect for a smart constructor for language.atomic.
      037d8d62