 05 Aug, 2016 1 commit


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 17 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

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
1.) iDestruct is able turns
↔ into two implications (because uPred_iff is (type classes) transparent). 2.) iApply only backtracks on turning P↔ Q into P → Q or Q → P when there are no future premises. This is not the case for 'P↔ □ (P → False)'. 
Robbert Krebbers authored
It not behaves more consistently with iExact and thus also works in the case H : P ★ □^n Q  Q.

Ralf Jung authored
show that even \later^n False is inconsistent (for any fixed n); properly use pvs in counter_examples

Ralf Jung authored

Ralf Jung authored

Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored
Also cleanup the file a bit.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

 02 Aug, 2016 9 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Zhen Zhang authored
ticket lock @jung merge? See merge request !1

Zhen Zhang authored

 01 Aug, 2016 7 commits


Robbert Krebbers authored

Robbert Krebbers authored
The new updates allow allocation fresh elements satisfying an arbitrary proposition (for example, being even) instead of just not being in a given finite set. TODO: maybe also do this for finite maps (gmaps).

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
This makes clear that we do not range over Coq terms.

Robbert Krebbers authored

Robbert Krebbers authored
This change makes it possible to use hlists in the proof mode, which itself uses hlists in the implementation of the specialize tactic.

 28 Jul, 2016 6 commits


Ralf Jung authored

Ralf Jung authored

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

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
The new implementation ensures that type class arguments are only infered in the very end. This avoids the need for the inG hack in a0348d7c.
