1. 23 Aug, 2016 1 commit
  2. 22 Aug, 2016 1 commit
    • Robbert Krebbers's avatar
      Generalize equality of heap_lang so it works on any value. · 8111cab0
      Robbert Krebbers authored
      This is more consistent with CAS, which also can be used on any value.
      Note that being able to (atomically) test for equality of any value and
      being able to CAS on any value is not realistic. See the discussion at
      https://gitlab.mpi-sws.org/FP/iris-coq/issues/26, and in particular JH
      Jourdan's observation:
      
        I think indeed for heap_lang this is just too complicated.
      
        Anyway, the role of heap_lang is not to model any actual
        programming language, but rather to show that we can do proofs
        about certain programs. The fact that you can write unrealistic
        programs is not a problem, IMHO. The only thing which is important
        is that the program that we write are realistic (i.e., faithfully
        represents the algorithm we want to p
      
      This commit is based on a commit by Zhen Zhang who generalized equality
      to work on any literal (and not just integers).
      8111cab0
  3. 08 Aug, 2016 2 commits
  4. 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
    • 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
  5. 19 Jul, 2016 1 commit
  6. 15 Jul, 2016 1 commit
  7. 13 Jul, 2016 1 commit
  8. 23 Jun, 2016 1 commit
  9. 17 Jun, 2016 1 commit
  10. 24 May, 2016 1 commit
    • Robbert Krebbers's avatar
      Make specialization patterns for persistent premises more uniform. · 65bfa071
      Robbert Krebbers authored
      Changes:
      - We no longer have a different syntax for specializing a term H : P -★ Q whose
        range P or domain Q is persistent. There is just one syntax, and the system
        automatically determines whether either P or Q is persistent.
      - While specializing a term, always modalities are automatically stripped. This
        gets rid of the specialization pattern !.
      - Make the syntax of specialization patterns more consistent. The syntax for
        generating a goal is [goal_spec] where goal_spec is one of the following:
      
          H1 .. Hn : generate a goal using hypotheses H1 .. Hn
         -H1 .. Hn : generate a goal using all hypotheses but H1 .. Hn
                 # : generate a goal for the premise in which all hypotheses can be
                     used. This is only allowed when specializing H : P -★ Q where
                     either P or Q is persistent.
                 % : generate a goal for a pure premise.
      65bfa071
  11. 10 May, 2016 1 commit
  12. 02 May, 2016 1 commit
  13. 26 Apr, 2016 1 commit
  14. 19 Apr, 2016 1 commit
  15. 15 Apr, 2016 1 commit
  16. 13 Apr, 2016 1 commit
  17. 12 Apr, 2016 3 commits
  18. 11 Apr, 2016 1 commit
  19. 08 Apr, 2016 1 commit
    • Robbert Krebbers's avatar
      Remove wp_X> tactics and improve wp_finish. · eab6c6c4
      Robbert Krebbers authored
      Since strip_later is doing a good job stripping laters in the conclusion,
      these tactics are thus no longer needed. Also, wp_finish now properly
      converts the result in a primitive viewshift in case it is not a weakestpre.
      eab6c6c4
  20. 29 Mar, 2016 3 commits
  21. 20 Mar, 2016 1 commit
  22. 10 Mar, 2016 5 commits
  23. 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
  24. 05 Mar, 2016 1 commit
  25. 04 Mar, 2016 1 commit
  26. 03 Mar, 2016 1 commit
  27. 02 Mar, 2016 3 commits