 09 Dec, 2016 2 commits


Ralf Jung authored
Really, *all* of our files contain proof rules

Robbert Krebbers authored

 08 Dec, 2016 2 commits


Robbert Krebbers authored

Ralf Jung authored

 06 Dec, 2016 1 commit


Ralf Jung authored

 01 Nov, 2016 1 commit


Ralf Jung authored
Now we try to avoid adding them unnecessarily, so we don't have to remove them automatically any more.

 25 Oct, 2016 1 commit


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

 22 Aug, 2016 1 commit


Robbert Krebbers authored
This is more consistent with CAS, which also can be used on any value. Note that being able to (atomically) test for equality of any value and being able to CAS on any value is not realistic. See the discussion at https://gitlab.mpisws.org/FP/iriscoq/issues/26, and in particular JH Jourdan's observation: I think indeed for heap_lang this is just too complicated. Anyway, the role of heap_lang is not to model any actual programming language, but rather to show that we can do proofs about certain programs. The fact that you can write unrealistic programs is not a problem, IMHO. The only thing which is important is that the program that we write are realistic (i.e., faithfully represents the algorithm we want to p This commit is based on a commit by Zhen Zhang who generalized equality to work on any literal (and not just integers).

 08 Aug, 2016 1 commit


Robbert Krebbers authored

 05 Aug, 2016 2 commits


Robbert Krebbers authored
This better reflects the name of the bind rule. I renamed an internal tactic that was previously called wp_bind into wp_bind_core.

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

 27 Jul, 2016 1 commit


Ralf Jung authored

 19 Jul, 2016 4 commits


Robbert Krebbers authored
I also reverted 7952bca4 since there is no need for atomic to be a boolean predicate anymore. Moreover, I introduced a hint database fsaV for solving sideconditions related to FSAs, in particular, sideconditions related to expressions being atomic.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 15 Jul, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 30 Jun, 2016 1 commit


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.

 27 Jun, 2016 1 commit


Robbert Krebbers authored

 23 Jun, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
This is more natural, match should be used in user code, not case.

 10 May, 2016 4 commits


Robbert Krebbers authored
And make constants P for which we do not want of_val P to reduce Opaque.

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 11 Apr, 2016 1 commit


Robbert Krebbers authored

 08 Apr, 2016 1 commit


Robbert Krebbers authored
Since strip_later is doing a good job stripping laters in the conclusion, these tactics are thus no longer needed. Also, wp_finish now properly converts the result in a primitive viewshift in case it is not a weakestpre.

 10 Mar, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
Thanks to Amin Timany for the suggestion.

 06 Mar, 2016 1 commit


Robbert Krebbers authored
Tactics like wp_proj should always solve all to_val sideconditions. The tactic wp_done is used to handle these in a uniform way.

 05 Mar, 2016 2 commits
 04 Mar, 2016 1 commit


Robbert Krebbers authored

 02 Mar, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
We no longer abuse empty strings for anonymous binders. Instead, we now have a data type for binders: a binder is either named or anonymous.

 26 Feb, 2016 2 commits


Robbert Krebbers authored
It is based on type classes and can it be tuned by providing instances, for example, instances can be provided to mark that certain expressions are closed.

Robbert Krebbers authored

 25 Feb, 2016 2 commits


Ralf Jung authored

Robbert Krebbers authored
