-
Notifications
You must be signed in to change notification settings - Fork 0
First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
License
IITH-Compilers/ISL-UTVPI
About
First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published