On the Efficiency of Convex Polyehdra (NSAD'17)

[Page last updated on "August 15, 2017, 11:59:48".]

Enea Zaffanella

Abstract

The domain of convex polyhedra plays a special role in the collection
of numerical domains considered for program analysis and verification.
As far as precision is concerned, it would be the most natural choice
in many contexts but, due to its worst case exponential complexity, it
is sometimes considered an unaffordable option. This has led to a
systematic quest for simpler domains that are capable of reasonable
precision using less computational resources. There are anyway cases
where the use of the domain of convex polyhedra turns out to be
feasible, also due to recent progress in their implementation.
After reviewing a few known approaches to decrease the amount of
resources needed when computing on this domain, we will introduce
a couple of novel techniques that can be used to further improve
its efficiency, without incurring precision losses.