 25 Oct, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
And also rename the corresponding proof mode tactics.

 12 Oct, 2016 1 commit


Ralf Jung authored
rename program_logic.{ownership > wsat}. It really is about world satisfaction and invariants more than about ownership.

 05 Oct, 2016 1 commit


Robbert Krebbers authored

 09 Sep, 2016 1 commit


Robbert Krebbers authored
Before this commit, given "HP" : P and "H" : P ★ Q with Q persistent, one could write: iSpecialize ("H" with "#HP") to eliminate the wand in "H" while keeping the resource "HP". The lemma: own_valid : own γ x ⊢ ✓ x was the prototypical example where this pattern (using the #) was used. However, the pattern was too limited. For example, given "H" : P₁ ★ P₂ ★ Q", one could not write iSpecialize ("H" with "#HP₁") because P₂ ★ Q is not persistent, even when Q is. So, instead, this commit introduces the following tactic: iSpecialize pm_trm as # which allows one to eliminate implications and wands while being able to use all hypotheses to prove the premises, as well as being able to use all hypotheses to prove the resulting goal. In the case of iDestruct, we now check whether all branches of the introduction pattern start with an `#` (moving the hypothesis to the persistent context) or `%` (moving the hypothesis to the pure Coq context). If this is the case, we allow one to use all hypotheses for proving the premises, as well as for proving the resulting goal.

 28 Aug, 2016 1 commit


Robbert Krebbers authored
This also removes the double use of the name 'wp_fork' in both program_logic/weakestpre and heap_lang/lifting.

 23 Aug, 2016 1 commit


Robbert Krebbers authored

 22 Aug, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This implements issue #3.

 08 Aug, 2016 4 commits


Robbert Krebbers authored
This generalization is surprisingly easy in Iris 3.0, so I could not resist not doing it :).

Ralf Jung authored
I do not know why we have to split the rewrite here, but it seems we do.

Robbert Krebbers authored
This is probably due to a bug in the rewrite of ssreflect 1.6 which has been fixed in ssreflect master.

Ralf Jung authored

 06 Aug, 2016 1 commit


Robbert Krebbers authored
I cannot reproduce the error of the CI builder on my machine with the same version of Coq (8.5pl2).

 05 Aug, 2016 3 commits


Robbert Krebbers authored
And make it Typeclasses Opaque to ensure that we indeed do not do so using the proof mode.

Robbert Krebbers authored
Use it to prove that tests/barrier_client and tests/heap_lang are adequate.

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 (higherorder) 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 sideconditions 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).

 19 Jun, 2016 1 commit


Robbert Krebbers authored

 31 May, 2016 1 commit


Robbert Krebbers authored
be the same as
↔ . This is a fairly intrusive change, but at least makes notations more consistent, and often shorter because fewer parentheses are needed. Note that viewshifts already had the same precedence as →.

 28 May, 2016 1 commit


Robbert Krebbers authored
Based on an idea and WIP commits of JH. 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

 27 May, 2016 2 commits


Robbert Krebbers authored
We git this from monotonicity now.

Robbert Krebbers authored

 19 Apr, 2016 1 commit


Robbert Krebbers authored
That way, we do not have useless type annotations of the form "v : language.val heap_lang" cluttering about any goal. Note, that we could decide to eta expand everywhere (as we do for ∀ and ∃), and use the notation "WP e {{ Q }}" for "wp e ⊤ (λ _, Q)".

 23 Mar, 2016 1 commit


Robbert Krebbers authored

 10 Mar, 2016 3 commits


Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 08 Mar, 2016 2 commits
 07 Mar, 2016 2 commits


Ralf Jung authored
Add both nonexpansive 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 userdefined functor to any place we want. In particular, we can now have "\later (iProp > iProp)" in the ghost CMRA.

Ralf Jung authored

 02 Mar, 2016 2 commits


Robbert Krebbers authored
For consistency's sake.

Robbert Krebbers authored
This cleans up some adhoc stuff and prepares for a generalization of saved propositions.

 25 Feb, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
The performance gain seems neglectable, unfortunatelly...

 19 Feb, 2016 2 commits


Robbert Krebbers authored
* Put level of the triple at 20, so we can write things like ▷ {{ P }} e @ E {{ Φ }} without parentheses. * Use high levels for P, e and Φ. * Allow @ E to be omitted in case E = ⊤.

Robbert Krebbers authored

 18 Feb, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This avoids ambiguity with P and Q that we were using before for both uPreds/iProps and indexed uPreds/iProps.
