1. 20 Feb, 2016 1 commit
2. 17 Feb, 2016 2 commits
• Rename simplify_equality like tactics. · 20690605
Robbert Krebbers authored
```simplify_equality        => simplify_eq
simplify_equality'       => simplify_eq/=
simplify_map_equality    => simplify_map_eq
simplify_map_equality'   => simplify_map_eq/=
simplify_option_equality => simplify_option_eq
simplify_list_equality   => simplify_list_eq
f_equal'                 => f_equal/=

The /= suffixes (meaning: do simpl) are inspired by ssreflect.```
• Use scheme - then + then * for bullets. · 9774ce9c
Robbert Krebbers authored
3. 13 Feb, 2016 1 commit
4. 11 Feb, 2016 3 commits
• Shorter names for common math notions. · 44b18f4d
Robbert Krebbers authored
`Also do some minor clean up.`
• Revert "prelude: add notation for > and >= for all kinds of numbers" · 7ebc1859
Robbert Krebbers authored
```This reverts commit 24fa20e5f8a2042caa19f1f6505102c5434cce54.

Although these symmetric variants sometimes look "better", they
are really annoying and should IMHO never be used:

1.) For lemmas there is now a choice between >= and <=. Since there is
no longer a canonical choice, it is very easy to introduce a lot of
inconsistencies in statements of lemmas.

2.) For automation the situation becomes annoying, you have to built in
stuff for both >= and <=. That is very error-prone.

3.) For N and Z the notions x <= y and y >= x are not even convertible!
That means that done/by does not solve x <= y if you have y >= x and if
avoids you applying certain lemmas.```
5. 12 Jan, 2016 1 commit
6. 11 Dec, 2015 1 commit
7. 08 Dec, 2015 1 commit
8. 16 Nov, 2015 1 commit
9. 01 Feb, 2017 2 commits
• 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.```
• Misc prelude omissions. · 462ea92a
Robbert Krebbers authored
10. 08 Feb, 2015 1 commit
11. 31 Jan, 2015 1 commit
• Support alignment. · 8b7ea9be
Robbert Krebbers authored
```Type environments now describe alignment, this allows to:
* Prove properties about alignment, for example that bit offsets
* Support align_of expressions in the frontend.```
12. 15 Nov, 2014 1 commit
• 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.```
13. 25 Aug, 2014 1 commit
14. 25 Jun, 2014 1 commit
• Fix bugs in pointer operations · baaee9e0
Robbert Krebbers authored
```* Equality comparison of NULL and non NULL pointers should be defined
* Pointer comparisons, casts, and truth should only be defined for pointers
that are alive
* Treat dead pointers as indeterminate values in refinements. The proofs that
all operations preserve refinement indicate that dead pointers can be indeed
by replaced by anything without affecting the program's behavior.```
15. 16 Jun, 2014 1 commit
• 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.```
16. 02 May, 2014 2 commits
17. 21 Aug, 2013 1 commit
18. 12 Aug, 2013 1 commit
• 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.```
19. 17 Jun, 2013 1 commit
20. 07 May, 2013 1 commit
• 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.```
21. 14 Mar, 2013 1 commit
22. 19 Feb, 2013 1 commit
• 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.```
23. 01 Feb, 2013 1 commit
24. 09 Jan, 2013 1 commit
• Update to match the article. · 3f3ca628
Robbert Krebbers authored
```The development now corresponds exactly to the FoSSaCS 2013 paper.
Also, the prelude is updated to the one of the master branch.```
25. 05 Jan, 2013 3 commits
• Add missing notations on Z. · 6c89f5de
Robbert Krebbers authored
• 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, ...```
26. 12 Nov, 2012 1 commit
• 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.
* 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
27. 19 Oct, 2012 1 commit
• 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.```
28. 29 Aug, 2012 1 commit
29. 21 Aug, 2012 1 commit
• 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```
30. 11 Jun, 2012 1 commit