 22 Nov, 2016 2 commits
 15 Nov, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored

 10 Nov, 2016 1 commit


Robbert Krebbers authored
This way we avoid the env_cbv tactic unfolding string related stuff that appears in the goal and hypotheses of the proof mode.

 01 Nov, 2016 1 commit


Ralf Jung authored

 28 Oct, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Ralf Jung authored

 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 2 commits
 06 Oct, 2016 1 commit


Robbert Krebbers authored

 05 Oct, 2016 1 commit


Robbert Krebbers authored

 27 Sep, 2016 1 commit


Robbert Krebbers authored
Used in iRevert, iClear, iFrame, and for generalizing the IH in iInduction and iLöb.

 29 Aug, 2016 1 commit


Ralf Jung authored

 28 Aug, 2016 1 commit


Joseph Tassarotti authored

 26 Aug, 2016 1 commit


Zhen Zhang authored

 25 Aug, 2016 1 commit


Robbert Krebbers authored

 24 Aug, 2016 1 commit


Zhen Zhang authored

 22 Aug, 2016 1 commit


Ralf Jung authored

 18 Aug, 2016 1 commit


JacquesHenri Jourdan authored

 08 Aug, 2016 2 commits


Robbert Krebbers authored
This makes stuff more uniform and also removes the need for the [inGFs] type class. Instead, there is now a type class [subG Σ1 Σ2] which expresses that a list of functors [Σ1] is contained in [Σ2].

Robbert Krebbers authored

 06 Aug, 2016 1 commit


Robbert Krebbers authored

 05 Aug, 2016 2 commits


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

 04 Aug, 2016 1 commit


Ralf Jung authored

 02 Aug, 2016 2 commits


Robbert Krebbers authored

Zhen Zhang authored

 28 Jul, 2016 1 commit


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

 25 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 22 Jul, 2016 4 commits


Robbert Krebbers authored

Robbert Krebbers authored
Also, add algebra/gset to _CoqProject.

Robbert Krebbers authored

Robbert Krebbers authored
Similar files (gmap, listset, ...) were already in singular form and matched the name of the set/map data type.

 19 Jul, 2016 1 commit


Robbert Krebbers authored
