1. 23 Jun, 2014 1 commit
  2. 17 Jun, 2014 1 commit
  3. 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.
  4. 06 Jun, 2014 2 commits
    • Robbert Krebbers's avatar
      Small stream library. · af633db2
      Robbert Krebbers authored
    • 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.
  5. 05 Jun, 2014 3 commits
    • Robbert Krebbers's avatar
      Hashsets based on radix-2 search trees. · 3ce93174
      Robbert Krebbers authored
    • 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.
    • Robbert Krebbers's avatar
      Improve [decompose_elem_of] tactic. · 46799584
      Robbert Krebbers authored
  6. 24 May, 2014 1 commit
  7. 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.
  8. 04 May, 2014 1 commit
  9. 02 May, 2014 3 commits
  10. 09 Sep, 2013 2 commits
  11. 27 Aug, 2013 1 commit
  12. 21 Aug, 2013 4 commits
  13. 15 Aug, 2013 1 commit
  14. 14 Aug, 2013 1 commit
  15. 12 Aug, 2013 1 commit
    • Robbert Krebbers's avatar
      Finite maps and sets using ordered association lists. · bc659ba4
      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.
  16. 24 Jun, 2013 2 commits
  17. 17 Jun, 2013 2 commits
  18. 21 May, 2013 1 commit
  19. 15 May, 2013 1 commit
  20. 12 May, 2013 1 commit
  21. 11 May, 2013 2 commits
  22. 07 May, 2013 1 commit
    • Robbert Krebbers's avatar
      Lots of refactoring. and new results on permutations and list containment. · 361308c7
      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 one-liners 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.
  23. 02 Apr, 2013 1 commit
  24. 25 Mar, 2013 1 commit
  25. 14 Mar, 2013 1 commit
  26. 24 Feb, 2013 1 commit
  27. 22 Feb, 2013 1 commit
  28. 19 Feb, 2013 1 commit
    • Robbert Krebbers's avatar
      Support sequence point, add permissions, and update prelude. · 415a4f1c
      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.