1. 12 Oct, 2016 2 commits
  2. 06 Oct, 2016 1 commit
  3. 05 Oct, 2016 1 commit
  4. 01 Sep, 2016 1 commit
  5. 11 Aug, 2016 1 commit
  6. 05 Aug, 2016 3 commits
    • Robbert Krebbers's avatar
      A nicer version of adequacy of Iris and specialize it to heap_lang. · 5ee10883
      Robbert Krebbers authored
      Use it to prove that tests/barrier_client and tests/heap_lang are adequate.
      5ee10883
    • 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
  7. 04 Aug, 2016 1 commit
  8. 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
  9. 20 Jul, 2016 1 commit
  10. 19 Jul, 2016 1 commit
  11. 13 Jul, 2016 1 commit
  12. 30 Jun, 2016 2 commits
    • Ralf Jung's avatar
      Bring back wp_bindi · d6e6d71e
      Ralf Jung authored
      I know we don't use it.  Stating theorems also serves to document things, and IMHO this one is informative.  It also costs us nothing.
      d6e6d71e
    • Robbert Krebbers's avatar
      Make all the wp stuff (lemmas and tactics) preserve view shifts. · 485ef65e
      Robbert Krebbers authored
      Concretely, when execution of any of the wp_ tactics does not yield
      another wp, it will make sure that a view shift is kept. This
      behavior was already partially there, but now it is hopefully more
      consistent.
      485ef65e
  13. 23 Jun, 2016 1 commit
  14. 17 Jun, 2016 1 commit
  15. 16 Jun, 2016 3 commits
  16. 15 Jun, 2016 2 commits
  17. 01 Jun, 2016 2 commits
  18. 31 May, 2016 2 commits
  19. 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
  20. 27 May, 2016 1 commit
  21. 24 May, 2016 1 commit
    • Robbert Krebbers's avatar
      Change notations of big_ops for upred. · 93792f5c
      Robbert Krebbers authored
      Rationale: to make the code closer to what is on paper, I want the notations
      to look like quantifiers, i.e. have a binder built-in. I thus introduced the
      following notations:
      
        [★ map] k ↦ x ∈ m, P
        [★ set] x ∈ X, P
      
      The good thing - contrary to the notations that we had before that required an
      explicit lambda - is that type annotations of k and x are now not printed
      making goals much easier to read.
      93792f5c
  22. 07 May, 2016 1 commit
  23. 06 May, 2016 1 commit
  24. 21 Apr, 2016 2 commits
  25. 20 Apr, 2016 2 commits
  26. 19 Apr, 2016 1 commit
  27. 12 Apr, 2016 1 commit
  28. 29 Mar, 2016 1 commit
  29. 20 Mar, 2016 1 commit