First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
-
Updated
May 27, 2020 - C
First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
Add a description, image, and links to the octagon-domain topic page so that developers can more easily learn about it.
To associate your repository with the octagon-domain topic, visit your repo's landing page and select "manage topics."