 05 Jan, 2017 1 commit


Ralf Jung authored

 03 Jan, 2017 1 commit


Ralf Jung authored
This patch was created using find name *.v  xargs L 1 awk i inplace '{from = 0} /^From/{ from = 1; ever_from = 1} { if (from == 0 && seen == 0 && ever_from == 1) { print "Set Default Proof Using \"Type*\"."; seen = 1 } }1 ' and some minor manual editing

 28 Dec, 2016 1 commit


Robbert Krebbers authored
This fixes issue #55.

 14 Dec, 2016 1 commit


Ralf Jung authored

 09 Dec, 2016 1 commit


Ralf Jung authored

 29 Nov, 2016 1 commit


Robbert Krebbers authored
When having H : ▷ (P ∗ Q) and H2 : ▷ P, iSpecialize ("H" with "H2") distributes the later over the wand.

 27 Nov, 2016 1 commit


Robbert Krebbers authored

 25 Nov, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 22 Nov, 2016 2 commits
 03 Nov, 2016 1 commit


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.

 28 Oct, 2016 1 commit


Robbert Krebbers authored

 25 Oct, 2016 7 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
There are now two proof mode tactics for dealing with modalities:  `iModIntro` : introduction of a modality  `iMod pm_trm as (x1 ... xn) "ipat"` : eliminate a modality The behavior of these tactics can be controlled by instances of the `IntroModal` and `ElimModal` type class. We have declared instances for later, except 0, basic updates and fancy updates. The tactic `iMod` is flexible enough that it can also eliminate an updates around a weakest pre, and so forth. The corresponding introduction patterns of these tactics are `!>` and `>`. These tactics replace the tactics `iUpdIntro`, `iUpd` and `iTimeless`. Source of backwards incompatability: the introduction pattern `!>` is used for introduction of arbitrary modalities. It used to introduce laters by stripping of a later of each hypotheses.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

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

 05 Oct, 2016 1 commit


Robbert Krebbers authored

 27 Sep, 2016 1 commit


Robbert Krebbers authored
This way we can use uPred_valid for validity of uPreds, which more sense.

 19 Sep, 2016 2 commits


Robbert Krebbers authored
This closes issue 32.

Robbert Krebbers authored

 15 Sep, 2016 3 commits


JacquesHenri Jourdan authored

JacquesHenri Jourdan authored

JacquesHenri Jourdan authored

 25 Aug, 2016 1 commit


Robbert Krebbers authored
Following the time anology of later, the stepindex 0 corresponds does not correspond to 'now', but rather to the end of time (i.e. 'last').

 24 Aug, 2016 2 commits


Robbert Krebbers authored
This is allowed as long as one of the conjuncts is thrown away (i.e. is a wildcard _ in the introduction pattern). It corresponds to the principle of "external choice" in linear logic.

Robbert Krebbers authored

 08 Aug, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 05 Aug, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

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).

 04 Aug, 2016 2 commits


Robbert Krebbers authored
Prove some properties about it, and define timeless in terms of it, and factor this notion out of raw view shifts.

Robbert Krebbers authored
It not behaves more consistently with iExact and thus also works in the case H : P ★ □^n Q  Q.

 02 Aug, 2016 1 commit


Robbert Krebbers authored

 28 Jul, 2016 1 commit


Robbert Krebbers authored
This avoids recompilation of coq_tactics each time an instance is added.
