Algorithms for finding tight UTVPI (octagonal) over-approximations of polyhedra using linear programming and Fourier-Motzkin elimination
-
Updated
Jul 17, 2019 - C++
#
octagon-domain
Here are 3 public repositories matching this topic...
First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
-
Updated
May 27, 2020 - C
Abstract Domain Library, a C++ library implementing the octagon domain in CPU and GPU. (may add more abstract domains in the future!)
-
Updated
Aug 27, 2018 - C++
Improve this page
Add a description, image, and links to the octagon-domain topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the octagon-domain topic, visit your repo's landing page and select "manage topics."