stdpp:f7f79d263c21de556e319e05b3979d00ed8358fa commitshttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commits/f7f79d263c21de556e319e05b3979d00ed8358fa2016-02-20T16:44:58+01:00https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/f7f79d263c21de556e319e05b3979d00ed8358faadd tactic aliases: trans -> transitivity; etrans -> etransitivity2016-02-20T16:44:58+01:00Ralf Jungjung@mpi-sws.orghttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/20690605ffbf5709b5760560167e3adf9fa0602bRename simplify_equality like tactics.2016-02-17T16:21:26+01:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/9774ce9cad21d62660b07ef54ab9abf8909f7fddUse scheme - then + then * for bullets.2016-02-17T01:03:30+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/7dd32d7d13355459a3f3095508bb8b80981241bcUse new Import/Export syntax everywhere.2016-02-13T12:39:54+01:00Robbert Krebbersmail@robbertkrebbers.nl
Also, make our redefinition of done more robust under different
orders of Importing modules.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/44b18f4df008fefa1d9618d6725a63689942552dShorter names for common math notions.2016-02-11T22:48:51+01:00Robbert Krebbersmail@robbertkrebbers.nl
Also do some minor clean up.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/7ebc185986cad7b4d0be3be855ead48236b7d5d5Revert "prelude: add notation for > and >= for all kinds of numbers"2016-02-11T20:10:27+01:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/f419201953dfb768f51d2b8eab81440a85cdab16prelude: add notation for > and >= for all kinds of numbers2016-02-11T14:07:10+01:00Ralf Jungjung@mpi-sws.orghttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/a64b8e398e72096142c2d7fc962bd2140e2aadf3Set Obligation Tactic := idtac globally.2016-01-12T14:35:23+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/937b986c3b0eb0bb01e1e4bc65ec5571c52243a2More on finite/cofinite sets of positives.2015-12-11T15:31:50+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/3f6720e7e60b550773f95554ddf0d45b58846e2fClean-up in prelude.numbers.2015-12-08T19:55:07+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/dcff8ded2b64738c838a552487ae9e4d4630015bUse qualified module names and coqc -Q instead of -R.2015-11-16T11:38:22+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/02f213ce883755c487150fcd89cededc8ea7e8c8Port to Coq 8.5 beta 2.2017-02-01T19:55:16+01:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/462ea92aebba670fc4ad47b535390d5932fe384aMisc prelude omissions.2017-02-01T19:55:08+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/5a73c4edfb423c4cbead774d288d97cabf71e049Update copyright headers.2015-02-08T19:38:19+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/8b7ea9be416d4b7bb3389037ee3007e4b938a6faSupport alignment.2015-02-01T00:23:34+01:00Robbert Krebbersmail@robbertkrebbers.nl
Type environments now describe alignment, this allows to:
* Prove properties about alignment, for example that bit offsets
of addresses are always aligned.
* Support align_of expressions in the frontend.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/da7a14bb509e8c561eff60fe71d17772233327fbMore accurate formalization of integer ranks.2014-11-15T14:51:12+01:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/dbbda8cb715b5fb4f626a26b1aa76ba616aae3beProve that lockset ⊆ dom memory.2014-08-26T00:21:37+02:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/baaee9e00c3da631db84eb340059a56b92188751Fix bugs in pointer operations2014-06-25T16:29:24+02:00Robbert Krebbersmail@robbertkrebbers.nl
* 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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/3503a91f8c85b2a01a73ec5fea43cc67ee6c4006Changes in preparation of the C type system and C front-end language2014-06-16T14:49:04+02:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/83f05bf19970b5e75f9e23a80d7229f185b74adeUpdate copyright headers.2014-05-02T22:40:17+02:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/716f554d652e6865a5dd013a636e8472da630ad3Start integrating memory model with sequence point semantics.2014-05-02T22:35:34+02:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/1426e8438f3f449722f20ce02b668e137e2fcd64More properties about the rationals Qc.2013-08-21T14:45:48+02:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/bc659ba4d1b18dcd5a69c7460016691fefcd2948Finite maps and sets using ordered association lists.2013-08-12T10:33:53+02:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/1c177c3981118f55c0452ba679c50a1f2c3a2d05Misc updates to the prelude.2013-06-17T23:48:33+02:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/361308c7b173f353afd99499e8bfcf168fdab1caLots of refactoring. and new results on permutations and list containment.2013-05-07T17:01:37+02:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/c490d8581c3cefa0dbae505ed465feaf1fbd077bAn axiomatization and implementation of machine integers.2013-03-14T20:13:29+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/415a4f1ca2bf510240bb6a2ec0366a04b17be36fSupport sequence point, add permissions, and update prelude.2013-02-19T13:32:10+01:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/487cdeadf8fb6850bd209dd4f1f6530e61bae710Some minor cleanup, and more lemmas on prefix/postfixes of lists.2013-02-01T13:28:42+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/3f3ca628ac094cfe070281905ffab59d6bf1d5ceUpdate to match the article.2013-01-09T20:46:54+01:00Robbert Krebbersmail@robbertkrebbers.nl
The development now corresponds exactly to the FoSSaCS 2013 paper.
Also, the prelude is updated to the one of the master branch.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/6c89f5de983e30964ff80029d801403ccd484a46Add missing notations on Z.2013-01-05T02:01:55+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/d8445c86d254d0364c0a1981193ecbe635ab1ca0Add a type class to collect types that are inhabited.2013-01-05T01:45:01+01:00Robbert Krebbersmail@robbertkrebbers.nlhttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/507a150aa88377eb834191600f4214cd3379be61Various small changes.2013-01-05T01:28:59+01:00Robbert Krebbersmail@robbertkrebbers.nl
* 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, ...https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/50dfc1488f5f92bfde5dd20cd0d119ce61f5fb63Many relatively small changes.2012-11-12T13:44:48+01:00Robbert Krebbersmail@robbertkrebbers.nl
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).https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/e82cda6cd47ca4a55fa6c203aa1a93e9540c8c3fAdd non-deterministic expressions with side-effects.2012-10-19T14:46:47+02:00Robbert Krebbersmail@robbertkrebbers.nl
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.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/e79e91f757d9f2ffa7724e843adb9249fc827ae8Add documentation, add license, simplify build process, some reorganization,2012-08-29T21:29:37+02:00Robbert Krebbersmail@robbertkrebbers.nlimprove some definitions, simplify some proofs.https://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/18669b9259e8eacbf6dcaed25db562008ef3f13cMajor revision of the whole development.2012-08-21T10:50:53+02:00Robbert Krebbersmail@robbertkrebbers.nl
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 charactershttps://gitlab.mpi-sws.org/simonspies/stdpp/-/commit/5446fba3ac18b0e479269b76675acd6a6e6b3042Initial commit2012-06-11T19:33:56+02:00Robbert Krebbersmail@robbertkrebbers.nl