- Aug 25, 2016
-
-
Robbert Krebbers authored
-
- Aug 24, 2016
-
-
Zhen Zhang authored
-
- Aug 22, 2016
-
-
Ralf Jung authored
-
- Aug 18, 2016
-
-
Jacques-Henri Jourdan authored
-
- Aug 08, 2016
-
-
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
-
- Aug 06, 2016
-
-
Robbert Krebbers authored
-
- Aug 05, 2016
-
-
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 (higher-order) 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 side-conditions 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).
-
- Aug 04, 2016
-
-
Ralf Jung authored
-
- Aug 02, 2016
-
-
Robbert Krebbers authored
-
Zhen Zhang authored
-
- Jul 28, 2016
-
-
Robbert Krebbers authored
This avoids recompilation of coq_tactics each time an instance is added.
-
- Jul 25, 2016
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Jul 22, 2016
-
-
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.
-
- Jul 19, 2016
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
Ralf Jung authored
-
Ralf Jung authored
-
- Jul 03, 2016
-
-
Robbert Krebbers authored
-
- Jun 29, 2016
-
-
Robbert Krebbers authored
-
- Jun 27, 2016
-
-
Robbert Krebbers authored
This reverts commit 4c056f5e.
-
Jacques-Henri Jourdan authored
-
- Jun 17, 2016
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- Jun 15, 2016
-
-
Robbert Krebbers authored
-
- Jun 01, 2016
-
-
Jacques-Henri Jourdan authored
-
- May 31, 2016
-
-
Robbert Krebbers authored
-
- May 30, 2016
-
-
Jacques-Henri Jourdan authored
-
- May 25, 2016
-
-
Ralf Jung authored
-
Robbert Krebbers authored
-
- May 09, 2016
-
-
Robbert Krebbers authored
-
- Apr 29, 2016
-
-
Robbert Krebbers authored
-
- Apr 19, 2016
-
-
Robbert Krebbers authored
It is just a test case and not really part of the barrier library.
-
- Apr 13, 2016
-
-
Robbert Krebbers authored
-
- Apr 12, 2016
-
-
Robbert Krebbers authored
It is not a library; it does not contain code, but instead is a core part of heap_lang.
-