1. 30 Sep, 2014 1 commit
  2. 24 Sep, 2014 1 commit
  3. 16 Sep, 2014 1 commit
  4. 13 Sep, 2014 1 commit
  5. 12 Sep, 2014 2 commits
  6. 06 Sep, 2014 4 commits
  7. 03 Sep, 2014 5 commits
  8. 25 Aug, 2014 1 commit
  9. 22 Aug, 2014 2 commits
    • Robbert Krebbers's avatar
      Modify typing judgments to depend on a description of the types of objects in · 7f9c5994
      Robbert Krebbers authored
      memory instead of the whole memory itself.
      
      This has the following advantages:
      * Avoid parametrization in {addresses,pointers,pointer_bits,bits}.v
      * Make {base_values,values}.v independent of the memory, this makes better
        parallelized compilation possible.
      * Allow small memories (e.g. singletons as used in separation logic) with
        addresses to objects in another part to be typed.
      * Some proofs become easier, because the memory environments are preserved
        under many operations (insert, force, lock, unlock).
      
      It also as the following disadvantages:
      * At all kinds of places we now have explicit casts from memories to memory
        environments. This is kind of ugly. Note, we cannot declare memenv_of as a
        Coercion because it is non-uniform.
      * It is a bit inefficient with respect to the interpreter, because memory
        environments are finite functions instead of proper functions, so calling
        memenv_of often (which we do) is not too good.
      7f9c5994
    • Robbert Krebbers's avatar
      Make simplify_error_equality a bit faster. · 7040c040
      Robbert Krebbers authored
      It is still rather slow, though.
      7040c040
  10. 09 Aug, 2014 1 commit
  11. 07 Aug, 2014 1 commit
  12. 06 Aug, 2014 2 commits
  13. 04 Aug, 2014 1 commit
  14. 10 Jul, 2014 1 commit
  15. 04 Jul, 2014 1 commit
  16. 25 Jun, 2014 2 commits
  17. 23 Jun, 2014 2 commits
  18. 17 Jun, 2014 1 commit
  19. 16 Jun, 2014 1 commit
    • Robbert Krebbers's avatar
      Changes in preparation of the C type system and C front-end language · 3503a91f
      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 l-values instead of r-values.
        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.
      3503a91f
  20. 06 Jun, 2014 2 commits
    • Robbert Krebbers's avatar
      Small stream library. · af633db2
      Robbert Krebbers authored
      af633db2
    • Robbert Krebbers's avatar
      Miscellaneous changes to the memory · ab930b45
      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.
      ab930b45
  21. 05 Jun, 2014 3 commits
    • Robbert Krebbers's avatar
      Hashsets based on radix-2 search trees. · 3ce93174
      Robbert Krebbers authored
      3ce93174
    • Robbert Krebbers's avatar
      Preparation to port the master branch · d60affc0
      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.
      d60affc0
    • Robbert Krebbers's avatar
      Improve [decompose_elem_of] tactic. · 46799584
      Robbert Krebbers authored
      Conflicts:
      	collections.v
      46799584
  22. 24 May, 2014 1 commit
  23. 22 May, 2014 1 commit
    • Robbert Krebbers's avatar
      Various changes. · bb9d75d9
      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.
      bb9d75d9
  24. 04 May, 2014 1 commit
  25. 02 May, 2014 1 commit