[PPL-devel] Cardinality of integers of a abstract domain in ppl

[Zhoulai]

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.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.cs.unipr.it/pipermail/ppl-devel/attachments/20130527/5d6f492c/attachment.htm>