Cardinality of integers of a abstract domain in ppl
Dear all,
I would like to know whether PPL library has built - in way to count the number of integers satisfying an abstract domain in PPL ? Say, a domain of Int64_box has a constraint {x<=2, -x<=0} which has cardinality 3, for {x>=0}, the cardinality would be 2ˆ32 if it is the greatest integer.
The motivation is to roughly compare the precisions of two groups of analyses.
Thanks.
Zell.
On 05/27/2013 11:30 PM, Zhoulai wrote:
Dear all,
I would like to know whether PPL library has built - in way to count the number of integers satisfying an abstract domain in PPL ?
No, this functionality is not currently supported by the library.
Enea.
Say, a domain of Int64_box has a constraint {x<=2, -x<=0} which has cardinality 3, for {x>=0}, the cardinality would be 2ˆ32 if it is the greatest integer.
The motivation is to roughly compare the precisions of two groups of analyses.
Thanks.
Zell.
On Mon, May 27, 2013 at 11:30:38PM +0200, Zhoulai wrote:
Dear all,
I would like to know whether PPL library has built - in way to count the number of integers satisfying an abstract domain in PPL ?
If you can't find it in PPL, you may want to have a look at barvinok or LattE, which allow you to count the number of integer points in a polytope.
skimo
participants (3)
-
Enea Zaffanella -
Sven Verdoolaege -
Zhoulai