1. 28 Sep, 2016 1 commit
  2. 20 Sep, 2016 2 commits
  3. 09 Aug, 2016 1 commit
  4. 08 Aug, 2016 1 commit
  5. 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
  6. 27 Jul, 2016 2 commits
    • Robbert Krebbers's avatar
      Declare inG arguments of own_* implicit but not maximally inserted. · de9438cb
      Robbert Krebbers authored
      This way type class inference is not invokved when used in tactics
      like iPvs while not having to write an @.
      
      (Idea suggested by Ralf.)
      de9438cb
    • Robbert Krebbers's avatar
      Make type class inference for inG less eager. · a0348d7c
      Robbert Krebbers authored
      This way, it won't pick arbitrary (and possibly wrong!) inG instances
      when multiple ones are available. We achieve this by declaring:
      
        Hint Mode inG - - +
      
      So that type class inference only succeeds when the type of the ghost
      variable does not include any evars.
      
      This required me to make some minor changes throughout the whole
      development making some types explicit.
      a0348d7c
  7. 23 Jun, 2016 1 commit
  8. 17 Jun, 2016 1 commit
  9. 16 Jun, 2016 1 commit
  10. 15 Jun, 2016 1 commit
  11. 31 May, 2016 2 commits
  12. 27 May, 2016 1 commit
  13. 22 May, 2016 1 commit
  14. 11 Apr, 2016 1 commit
  15. 29 Mar, 2016 1 commit
  16. 15 Mar, 2016 1 commit
  17. 11 Mar, 2016 2 commits
  18. 10 Mar, 2016 3 commits
  19. 08 Mar, 2016 2 commits
  20. 07 Mar, 2016 1 commit
    • Ralf Jung's avatar
      Add both non-expansive and contractive functors, and bundle them for the... · 2467bf21
      Ralf Jung authored
      Add both non-expansive and contractive functors, and bundle them for the general Iris instance as well as the global functor construction
      
      This allows us to move the \later in the user-defined functor to any place we want.
      In particular, we can now have "\later (iProp -> iProp)" in the ghost CMRA.
      2467bf21
  21. 06 Mar, 2016 1 commit
  22. 02 Mar, 2016 1 commit
  23. 25 Feb, 2016 2 commits
  24. 23 Feb, 2016 1 commit
  25. 22 Feb, 2016 4 commits
    • Robbert Krebbers's avatar
      Move global functor construction to its own file and define notations. · 457a11d9
      Robbert Krebbers authored
      And now the part that I forgot to commit.
      457a11d9
    • Robbert Krebbers's avatar
      Restraint instance search for global functors. · e0d0f8dd
      Robbert Krebbers authored
      Also, give all these global functors the suffix GF to avoid shadowing
      such as we had with authF.
      
      And add some type annotations for clarity.
      e0d0f8dd
    • Ralf Jung's avatar
      add the infrastructure for Coq to automatically infer the "inG" instances · 95c486ef
      Ralf Jung authored
      I added a new typeclass "inGF" to witness that a particular *functor* is part of \Sigma. inG, in contrast, witnesses a particular *CMRA* to be in there, after applying the functor to "\later iProp".
      inGF can be inferred if that functor is consed to the head of \Sigma, and it is preserved by consing a new functor to \Sigma. This is not the case for inG since the recursive occurence of \Sigma also changes.
      For evry construction (auth, sts, saved_prop), there is an instance infering the respective authG, stsG, savedPropG from an inGF. There is also a global inG_inGF, but Coq is unable to use it.
      
      I tried to instead have *only* inGF, since having both typeclasses seemed weird. However, then the actual type that e.g. "own" is about is the result of applying a functor, and Coq entirely fails to infer anything.
      
      I had to add a few type annotations in heap.v, because Coq tried to use the "authG_inGF" instance before the A got fixed, and ended up looping and expanding endlessly on that proof of timelessness.
      This does not seem entirely unreasonable, I was honestly surprised Coq was able to infer the types previously.
      95c486ef
    • Ralf Jung's avatar
      provide a closed proof of the client · ead5cad9
      Ralf Jung authored
      ead5cad9
  26. 19 Feb, 2016 1 commit
  27. 18 Feb, 2016 1 commit
  28. 17 Feb, 2016 2 commits