How do static analyzers prove overflow using Coq?
Do they have their own definitions of integers and not use the given sets?
Or does coq have an inbuilt type for n-bit integers and operations on them?
Asked
Active
Viewed 257 times
0
Prog
- 103
- 1
- 2
- 6
-
Which particular static analyzers are you thinking of? There is a library for n-bit integers in the [standard library](https://coq.inria.fr/library/index.html), but you don't have to use it. – larsr Dec 11 '16 at 15:05
-
I am not sure what do you mean, but indeed the usual way is to have a type of integers `'I_n` of size n. – ejgallego Dec 12 '16 at 17:43