1. 15 Nov, 2017 9 commits
2. 28 Oct, 2017 1 commit
3. 25 Oct, 2017 1 commit
4. 27 Jun, 2017 1 commit
5. 06 Feb, 2017 1 commit
6. 09 Jan, 2017 1 commit
7. 05 Jan, 2017 1 commit
8. 03 Jan, 2017 1 commit
9. 09 Dec, 2016 1 commit
10. 24 Nov, 2016 1 commit
11. 22 Nov, 2016 1 commit
12. 17 Nov, 2016 1 commit
13. 03 Nov, 2016 1 commit
• 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.
14. 28 Oct, 2016 1 commit
15. 25 Oct, 2016 3 commits
16. 20 Sep, 2016 1 commit
17. 11 Aug, 2016 1 commit
18. 09 Aug, 2016 1 commit
19. 08 Aug, 2016 1 commit
20. 05 Aug, 2016 1 commit
• 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

- 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).
21. 31 May, 2016 2 commits
22. 29 May, 2016 2 commits
23. 15 Mar, 2016 1 commit
24. 11 Mar, 2016 1 commit
25. 10 Mar, 2016 2 commits
26. 07 Mar, 2016 2 commits