Portability | portable |
---|---|
Stability | experimental |
Maintainer | erkokl@gmail.com |
Formalizes and proves the following theorem, about arithmetic, uninterpreted functions, and arrays. (For reference, see http://research.microsoft.com/en-us/um/redmond/projects/z3/fmcad06-slides.pdf slide number 24):
x + 2 = y implies f (read (write (a, x, 3), y - 2)) = f (y - x + 1)
We interpret the types as follows (other interpretations certainly possible):
- x
-
SWord32
(32-bit unsigned address) - y
-
SWord32
(32-bit unsigned address) - a
- An array, indexed by 32-bit addresses, returning 32-bit unsigned integers
- f
- An uninterpreted function of type
SWord32
->SWord64
The function read
and write
are usual array operations.
Documentation
type A = SFunArray Word32 Word32Source
The array type, takes symbolic 32-bit unsigned indexes and stores 32-bit unsigned symbolic values