1. 03 Mar, 2019 1 commit
    • Robbert Krebbers's avatar
      Overhaul of the `Infinite`/`Fresh` infrastructure. · 3184ef61
      Robbert Krebbers authored
      - The class `Infinite A` is now defined as having a function
        `fresh : list A → A`, that given a list `xs`, gives an element `x ∉ xs`.
      - For most types this `fresh` function has a sensible computable behavior,
        for example:
        + For numbers, it yields one added to the maximal element in `xs`.
        + For strings, it yields the first string representation of a number that is
          not in `xs`.
      - For any type `C` of finite sets with elements of infinite type `A`, we lift
        the fresh function to `C → A`.
      
      As a consequence:
      
      - It is now possible to pick fresh elements from _any_ finite set and from
        _any_ list with elements of an infinite type. Before it was only possible
        for specific finite sets, e.g. `gset`, `pset`, ...
      - It makes the code more uniform. There was a lot of overlap between having a
        `Fresh` and an `Infinite` instance. This got unified.
      3184ef61
  2. 29 Jan, 2019 1 commit
  3. 24 May, 2018 1 commit
    • Ralf Jung's avatar
      Remove the `default` notation for options · e585be6d
      Ralf Jung authored
      The notation was parsing-only and all it did was reorder the arguments for
      from_option.  This creates just a needless divergence between what is written
      and what is printed.  Also, removing it frees the name for maybe introducing a
      function or notation `default` with a type like `T -> option T -> T`.
      e585be6d
  4. 08 Sep, 2017 1 commit
  5. 15 Mar, 2017 1 commit
  6. 31 Jan, 2017 3 commits
  7. 20 Sep, 2016 1 commit
  8. 27 Jul, 2016 2 commits
  9. 17 Feb, 2016 2 commits
  10. 13 Feb, 2016 1 commit
  11. 16 Nov, 2015 1 commit
  12. 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
  13. 21 May, 2015 1 commit
  14. 08 Feb, 2015 1 commit
  15. 29 Jan, 2015 1 commit
    • Robbert Krebbers's avatar
      mem_force no longer flattens the entire subobject for "unsigned char" · 5644d68f
      Robbert Krebbers authored
      addresses.
      
      The operation "mem_force Γ m a" used to apply the identify function to
      pricisely the object "a", even in case "a" is an "unsigned char" address
      refering to an individual byte. This caused the ctree substructure of the
      entire subobject to disappear and had the undesired effect that:
      
        mem_force Γ a m ⊑{Γ,true@Γm} m
      
      failed to hold (i.e. unused reads cannot be removed).
      5644d68f
  16. 30 Sep, 2014 1 commit
  17. 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
  18. 05 Jun, 2014 1 commit
    • 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
  19. 02 May, 2014 2 commits
  20. 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.
      bc659ba4
  21. 17 Jun, 2013 1 commit
  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.
      361308c7
  23. 22 Feb, 2013 1 commit
  24. 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.
      415a4f1c
  25. 09 Jan, 2013 1 commit
  26. 05 Jan, 2013 1 commit
    • Robbert Krebbers's avatar
      Various small changes. · 507a150a
      Robbert Krebbers authored
      * Define the standard strict order on pre orders.
      * Prove that this strict order is well founded for finite sets and finite maps.
        We also provide some utilities to compute with well founded recursion.
      * Improve the "simplify_option_equality" tactic to handle more cases.
      * Axiomatize finiteness of finite maps by translation to lists, instead of by
        them having a finite domain.
      * Prove many additional properties of finite maps.
      * Add many functions and theorems on lists, including: permutations, resize,
        filter, ...
      507a150a
  27. 12 Nov, 2012 1 commit
    • Robbert Krebbers's avatar
      Many relatively small changes. · 50dfc148
      Robbert Krebbers authored
      Most interestingly:
      * Use [lia] instead of [omega] everywhere
      * More many generic lemmas on the memory to the theory on finite maps.
      * Many additional list lemmas.
      * A new interface for a monad for collections, which is now also used by the
        collection tactics.
      * Provide an additional finite collection implementation using unordered lists
        without duplicates removed. This implementation forms a monad (just the list
        monad in disguise).
      50dfc148
  28. 19 Oct, 2012 1 commit
    • Robbert Krebbers's avatar
      Add non-deterministic expressions with side-effects. · e82cda6c
      Robbert Krebbers authored
      The following things have been changed in this revision:
      
      * We now give a small step semantics for expressions. The denotational semantics
        only works for side-effect free expressions.
      * Dynamically allocated memory through alloc and free is now supported.
      * The following expressions are added: assignment, function call, unary
        operators, conditional, alloc, and free.
      * Some customary induction schemes for expressions are proven.
      * The axiomatic semantics (and its interpretation) have been changed in order
        to deal with non-deterministic expressions.
      * We have added inversion schemes based on small inversions for the operational
        semantics. Inversions using these schemes are much faster.
      * We improved the statement preservation proof of the operational semantics.
      * We now use a variant of SsReflect's [by] and [done], instead of Coq's [now]
        and [easy]. The [done] tactic is much faster as it does not perform
        inversions.
      * Add theory, definitions and notations on vectors.
      * Separate theory on contexts.
      * Change [Arguments] declarations to ensure better unfolding.
      e82cda6c
  29. 04 Sep, 2012 1 commit
  30. 29 Aug, 2012 1 commit
  31. 21 Aug, 2012 1 commit
    • Robbert Krebbers's avatar
      Major revision of the whole development. · 18669b92
      Robbert Krebbers authored
      The main changes are:
      
      * Function calls in the operational semantics
      * Mutually recursive function calls in the axiomatic semantics
      * A general definition of the interpretation of the axiomatic semantics  so as
        to improve reusability (useful for function calls, and also for expressions
        in future versions)
      * Type classes for stack independent, memory independent, and memory extensible
        assertions, and a lot of instances to automatically derive these properties.
      * Many additional lemmas on the memory and more robust tactics to simplify
        goals involving is_free and mem_disjoint
      * Proof of preservation of statements in the smallstep semantics
      
      * Some new tactics: feed, feed destruct, feed inversion, etc...
      * More robust tactic scripts using bullets and structured scripts
      * Truncate most lines at 80 characters
      18669b92
  32. 11 Jun, 2012 1 commit