Skip to content

First-cut implementation of two newly discovered Efficient Algorithms to compute the tightest octagonal over-approximation of arbitary Polyhedra

License

Notifications You must be signed in to change notification settings

IITH-Compilers/ISL-UTVPI

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

ISL-UTVPI

Title: "Some Efficient Algorithms for the tightest UTVPI Polyhedral Over-approximation problem"

Authors: Abhishek A. Patwardhan, Ramakrishna Upadrasta

Accepted at 9th International Workshop on Polyhedral Compilation Techniques (IMPACT 2019 )

January 23, 2019 | Valencia, Spain In conjunction with HiPEAC 2019

=========== Retaining Integer Set Library's README below ==============

If you use isl for your research, you are invited do cite the following paper and/or the paper(s) describing the specific operations you use.

@incollection{Verdoolaege2010isl, author = {Verdoolaege, Sven}, title = {isl: An Integer Set Library for the Polyhedral Model}, booktitle = {Mathematical Software - ICMS 2010}, series = {Lecture Notes in Computer Science}, editor = {Fukuda, Komei and Hoeven, Joris and Joswig, Michael and Takayama, Nobuki}, publisher = {Springer}, isbn = {978-3-642-15581-9}, pages = {299-302}, volume = {6327}, year = {2010} }

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

No packages published