-
Since Z3 is an automatic theorem prover which handles bit manipulations well, it could be helpful here.
ghost updated
10 years ago
-
We implement a much more efficient version of square decomposition for small values.
CC: @nathanncohen @jdemeyer @nexttime
Component: **number theory**
Author: **Vincent Delecroix**
Branch/Comm…
-
Currently, the theorem prover does not properly support length's being non-negative. So, for example, the following fails:
define nat as int where $ >= 0
nat f([int] xs):
return |xs|
-
Currently, the theorem prover does not support the sublist operation. The following test case causes a NullPointerException:
define posintlist as [int] where no { x in $ | x < 0 }
int sum(posin…
-
Basically, I need to put back support for integer inequalities. This is the canonical example:
int f(int x, [int] xs) requires x <= |xs|:
if x < |xs|:
return f(x+1,xs)
else:
…
-
Borrowing from one of the [examples](http://hackage.haskell.org/packages/archive/sbv/2.9/doc/html/src/Data-SBV-Examples-Uninterpreted-Deduce.html#SB), axioms require the user to enter "raw" SMT-lib st…
TomMD updated
11 years ago
-
Currently, string operations (i.e. StringAccess, StringLength, etc) are not supported.
-
Currently, the following example fails because the theorem prover considers a negative length for the collection is possible:
nat f([int] xs):
return |xs|
-
I opened a file that contains lots of proofs, some of which don't admit (and instead cause the theorem prover to just spin and spin). The proof pad UI hangs because
- a form gets sent to Acl.admit tha…
-
Need some mechanism for including modules and combining them together to help modularise the "big theorem prover".