 12 Oct, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 06 Oct, 2016 1 commit


Robbert Krebbers authored

 05 Oct, 2016 1 commit


Robbert Krebbers authored

 01 Sep, 2016 1 commit


Robbert Krebbers authored

 11 Aug, 2016 1 commit


Robbert Krebbers authored
They are redundant because frac is discrete.

 05 Aug, 2016 3 commits


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

Robbert Krebbers authored
Also make those for introduction and elimination more symmetric: !% pure introduction % pure elimination !# always introduction # always elimination !> later introduction > pat timeless later elimination !==> view shift introduction ==> pat view shift elimination

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


Robbert Krebbers authored

 21 Jul, 2016 1 commit


Robbert Krebbers authored
In particular, remove ectx_language.atomic, because it seems unused expect for a smart constructor for language.atomic.

 20 Jul, 2016 1 commit


JacquesHenri Jourdan authored
* Values are considered as atomic expressions (this does not hurt, and this makes the proofs of atomicity simpler).

 19 Jul, 2016 1 commit


Robbert Krebbers authored

 13 Jul, 2016 1 commit


Robbert Krebbers authored
The intropattern {H} also meant clear (both in ssreflect, and the logic part of the introduction pattern).

 30 Jun, 2016 2 commits


Ralf Jung authored
I know we don't use it. Stating theorems also serves to document things, and IMHO this one is informative. It also costs us nothing.

Robbert Krebbers authored
Concretely, when execution of any of the wp_ tactics does not yield another wp, it will make sure that a view shift is kept. This behavior was already partially there, but now it is hopefully more consistent.

 23 Jun, 2016 1 commit


Robbert Krebbers authored
This is more consistent with the proofmode, where we also call it pure.

 17 Jun, 2016 1 commit


Robbert Krebbers authored
Fixes issue #20.

 16 Jun, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 15 Jun, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 01 Jun, 2016 2 commits


JacquesHenri Jourdan authored

Robbert Krebbers authored

 31 May, 2016 2 commits


JacquesHenri Jourdan authored

Robbert Krebbers authored
It used to be: (P ={E}=> Q) := (True ⊢ (P → ={E}=> Q)) Now it is: (P ={E}=> Q) := (P ⊢ ={E}=> Q)

 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 1 commit


Robbert Krebbers authored

 24 May, 2016 1 commit


Robbert Krebbers authored
Rationale: to make the code closer to what is on paper, I want the notations to look like quantifiers, i.e. have a binder builtin. I thus introduced the following notations: [★ map] k ↦ x ∈ m, P [★ set] x ∈ X, P The good thing  contrary to the notations that we had before that required an explicit lambda  is that type annotations of k and x are now not printed making goals much easier to read.

 07 May, 2016 1 commit


Robbert Krebbers authored

 06 May, 2016 1 commit


Robbert Krebbers authored

 21 Apr, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 20 Apr, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 19 Apr, 2016 1 commit


Robbert Krebbers authored
This gets rid of the (ambiguous) notation %l, because we can declare LitLoc as a coercion. It also shortens the code.

 12 Apr, 2016 1 commit


Robbert Krebbers authored
It is not a library; it does not contain code, but instead is a core part of heap_lang.

 29 Mar, 2016 1 commit


Robbert Krebbers authored
Also remove some superfluous map_ prefixes.

 20 Mar, 2016 1 commit


Ralf Jung authored
