 16 Jun, 2014 1 commit


Robbert Krebbers authored
Major changes: * Make void a base type, and include a proper void base value. This is necessary because expressions (free, functions without return value) can yield a void. We now also allow void casts conforming to the C standard. * Various missing lemmas about typing, weakening, decidability, ... * The operations "free" and "alloc" now operate on lvalues instead of rvalues. This removes some duplication. * Improve notations of expressions and statements. Change the presence of the operators conforming to the C standard. Small changes: * Use the classes "Typed" and "TypeCheck" for validity of indexes in memory. This gives more uniform notations. * New tactic "typed_inversion" performs inversion on an inductive predicate of type "Typed" and folds the premises. * Remove a horrible hack in the definitions of the classes "FMap", "MBind", "OMap", "Alter" that was used to let "simpl" behave better. Instead, we have defined a tactic "csimpl" that folds the results after performing an ordinary "simpl". * Fast operation to remove duplicates from lists using hashsets. * Make various type constructors (mainly finite map implementations) universe polymorphic by packing them into an inductive. This way, the whole C syntax can live in type, avoiding the need for (slow) universe checks.

 06 Jun, 2014 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
* Remove generic path_typed instance for lists. For the zippers in the operational semantics, it goes the other way around. * Remove constructor lemmas for values/memory_trees and use a generic tactic instead. This tactic uses the standard constructor tactic, but folds the type classes afterward.

 05 Jun, 2014 3 commits


Robbert Krebbers authored

Robbert Krebbers authored
Major changes: * A data structure to collect locked addresses in memory. * Operations to lock and unlock addresses. * Remove [ctree_Forall] and express it using [Forall] and [ctree_flatten]. This saves a lot of lines of code. * Add a [void] value. This value cannot be typed, but will be used as a dummy return value for functions with return type [void]. Minor changes: * Various deciders in preparation of the executable semantics. * Improve naming and notations. * Remove obsolete stuff.

Robbert Krebbers authored
Conflicts: collections.v

 24 May, 2014 1 commit


Robbert Krebbers authored

 22 May, 2014 1 commit


Robbert Krebbers authored
* Parametrize refinements with memories. This way, refinements imply typing, for example [w1 ⊑{Γ,f@m1↦m2} w2 : τ → (Γ,m1) ⊢ w1 : τ]. This relieves us from various hacks. * Use addresses instead of index/references pairs for lookup and alter operations on memories. * Prove various disjointness properties.

 04 May, 2014 1 commit


Robbert Krebbers authored

 02 May, 2014 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 09 Sep, 2013 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 27 Aug, 2013 1 commit


Robbert Krebbers authored

 21 Aug, 2013 4 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 15 Aug, 2013 1 commit


Robbert Krebbers authored

 14 Aug, 2013 1 commit


Robbert Krebbers authored

 12 Aug, 2013 1 commit


Robbert Krebbers authored
This commit includes the following changes: * More theorems about pre, partial and total orders. * Define the lexicographic order on various commonly used data types. * Mergesort and its correctness proof. * Implement finite maps and sets using ordered association lists.

 24 Jun, 2013 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 17 Jun, 2013 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 21 May, 2013 1 commit


Robbert Krebbers authored

 15 May, 2013 1 commit


Robbert Krebbers authored

 12 May, 2013 1 commit


Robbert Krebbers authored

 11 May, 2013 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 07 May, 2013 1 commit


Robbert Krebbers authored
The refactoring includes: * Use infix notations for the various list relations * More consistent naming * Put lemmas on one line whenever possible * Change proofs into oneliners when possible * Make better use of the "Implicit Types" command * Improve the order of the list module by placing all definitions at the start, then the proofs, and finally the tactics. Besides, there is some new machinery for proofs by reflection on lists. It is used for a decision procedure for permutations and list containment.

 02 Apr, 2013 1 commit


Robbert Krebbers authored

 25 Mar, 2013 1 commit


Robbert Krebbers authored

 14 Mar, 2013 1 commit


Robbert Krebbers authored

 24 Feb, 2013 1 commit


Robbert Krebbers authored

 22 Feb, 2013 1 commit


Robbert Krebbers authored

 19 Feb, 2013 1 commit


Robbert Krebbers authored
Both the operational and axiomatic semantics are extended with sequence points and a permission system based on fractional permissions. In order to achieve this, the memory model has been completely revised, and is now built on top of an abstract interface for permissions. Apart from these changed, the library on lists and sets has been heavily extended, and minor changed have been made to other parts of the prelude.

 01 Feb, 2013 1 commit


Robbert Krebbers authored

 09 Jan, 2013 1 commit


Robbert Krebbers authored
Conflicts: ars.v assertions.v axiomatic.v base.v doc/index.html expressions.v fin_maps.v memory.v smallstep.v state.v statements.v tactics.v
