IITH-Compilers/ISL-UTVPI
First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
CMIT
First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra
CMIT