1. 24 Feb, 2016 3 commits
  2. 22 Feb, 2016 2 commits
    • Robbert Krebbers's avatar
      Let set_solver not use eauto by default. · d719e001
      Robbert Krebbers authored
      In most cases there is a lot of duplicate proof search performed by
      both naive_solver and eauto. Especially since naive_solver calls its
      tactic (in the case of set_solver this used to be eauto) quite eagerly
      this made it very slow.
      
      Note that set_solver is this too slow and should be improved.
      d719e001
    • Robbert Krebbers's avatar
      Let set_solver not use eauto by default. · 060c2b8f
      Robbert Krebbers authored
      In most cases there is a lot of duplicate proof search performed by
      both naive_solver and eauto. Especially since naive_solver calls its
      tactic (in the case of set_solver this used to be eauto) quite eagerly
      this made it very slow.
      
      Note that set_solver is this too slow and should be improved.
      060c2b8f
  3. 17 Feb, 2016 3 commits
  4. 16 Feb, 2016 1 commit
  5. 15 Feb, 2016 2 commits
  6. 13 Feb, 2016 1 commit
  7. 16 Jan, 2016 2 commits
  8. 04 Jan, 2016 1 commit
  9. 11 Dec, 2015 1 commit
  10. 20 Nov, 2015 1 commit
    • Robbert Krebbers's avatar
      Step-indexed order on CMRAs · 58096261
      Robbert Krebbers authored
      * Remove the order from RAs, it is now defined in terms of the ⋅ operation.
      * Define ownership using the step-indexed order.
      * Remove the order also from DRAs and change STS accordingly. While doing
        that, I changed STS to no longer use decidable token sets, which removes the
        requirement of decidable equality on tokens.
      58096261
  11. 18 Nov, 2015 1 commit
  12. 17 Nov, 2015 1 commit
  13. 16 Nov, 2015 2 commits
  14. 03 Feb, 2017 1 commit
  15. 01 Feb, 2017 1 commit
    • Robbert Krebbers's avatar
      Port to Coq 8.5 beta 2. · 02f213ce
      Robbert Krebbers authored
      The port makes the following notable changes:
      
      * The carrier types of separation algebras and integer environments are no
        longer in Set. Now they have a type at a fixed type level above Set. This
        both works better in 8.5 and makes the formalization more general.
        I have tried putting them at polymorphic type levels, but that increased the
        compilation time by an order of magnitude.
      * I am using a custom f_equal tactic written in Ltac to circumvent bug #4069.
        That bug has been fixed, so this custom tactic can be removed when the next
        beta of 8.5 is out.
      02f213ce
  16. 04 Jun, 2015 1 commit
  17. 02 Jun, 2015 1 commit
  18. 22 Apr, 2015 1 commit
  19. 16 Apr, 2015 1 commit
  20. 02 Mar, 2015 1 commit
  21. 08 Feb, 2015 2 commits
    • Robbert Krebbers's avatar
      Update copyright headers. · 5a73c4ed
      Robbert Krebbers authored
      5a73c4ed
    • Robbert Krebbers's avatar
      Support function pointers and use a state monad in the frontend. · b2109c25
      Robbert Krebbers authored
      Important changes in the core semantics:
      * Types extended with function types. Since function types are a special kind
        of pointer types, types now have an additional mutual part called "ptr_type".
      * Pointers extended with function pointers. Theses are just names that refer
        to an actual function in the function environment.
      * Typing environments extended to assign argument and return types to function
        names. Before we used a separate environment for these, but since the
        argument and return types are already needed to type function pointers, this
        environment would appear in pretty much every typing judgment.
      
      As a side-effect, the frontend has been rewritten entirely. The important
      changes are:
      
      * Type checking of expressions is more involved: there is a special kind of
        expression type corresponding to a function designator.
      * To handle things like block scoped extern function, more state-fullness was
        needed. To prepare for future extensions, the entire frontend now uses a
        state monad.
      b2109c25
  22. 27 Jan, 2015 1 commit
    • Robbert Krebbers's avatar
      Let the malloc expression non-deterministically yield NULL. · fdcc90dd
      Robbert Krebbers authored
      * This behavior is "implementation defined" and can be turned on and off
        using the Boolean field "alloc_can_fail" of the class "Env".
      * The expression "EAlloc" is now an r-value of pointer type instead of an
        l-value.
      * The executable semantics for expressions is now non-deterministic. Hence,
        some proofs had to be revised.
      fdcc90dd
  23. 15 Nov, 2014 1 commit
    • Robbert Krebbers's avatar
      More accurate formalization of integer ranks. · da7a14bb
      Robbert Krebbers authored
      Integers with the same size, are no longer supposed to have the same rank. As a
      result, the C integer types (char, short, int, long, long long) are different
      (and thus cannot alias) even if they have the same size. We now have to use a
      more involved definition of integer promotions and usual arithmetic conversions.
      However, this new definition follows the C standard literally.
      da7a14bb
  24. 03 Sep, 2014 1 commit
  25. 25 Aug, 2014 1 commit
  26. 05 Jun, 2014 2 commits
    • 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
  27. 02 May, 2014 2 commits
  28. 17 Jun, 2013 1 commit
  29. 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.
      361308c7