isl (integer set library) is a portable C library for manipulating sets and relations of integer points bounded by linear constraints.[2]
Developer(s) | Sven Verdoolaege, INRIA and others |
---|---|
Stable release | 0.26
/ April 2, 2023[1] |
Available in | C |
Type | Mathematical software |
License | MIT |
Website | libisl |
The following operations are supported:[3]
- intersection, union, set difference
- emptiness check
- convex hull
- (integer) affine hull
- integer projection
- computing the lexicographic minimum using parametric integer programming
- coalescing
- parametric vertex enumeration
It also includes an ILP solver based on generalized basis reduction, transitive closures on maps (which may encode infinite graphs), dependence analysis and bounds on piecewise step-polynomials.
All computations are performed in exact integer arithmetic using GMP or imath.
Many program analysis techniques are based on integer set manipulations. The integers typically represent iterations of a loop nest or elements of an array. isl uses parametric integer programming to obtain an explicit representation in terms of integer divisions.
It is used as backend polyhedral library in the GCC Graphite framework[4] and in the LLVM Polly framework[5] for loop optimizations.
See also
editReferences
edit- ^ "isl 0.25".
- ^ Verdoolaege, Sven (2010). "isl: An Integer Set Library for the Polyhedral Model" (PDF). Mathematical Software – ICMS 2010. Lecture Notes in Computer Science. Vol. 6327. pp. 299–302. doi:10.1007/978-3-642-15582-6_49. ISBN 978-3-642-15581-9. ISSN 0302-9743.
- ^ "isl Manual" (PDF). 2015-06-11. Retrieved 2015-09-02.
- ^ "GCC prerequisites". 2015-07-26. Retrieved 2015-09-02.
- ^ "LLVM Polly External Libraries". GitHub. 2020-02-10. Retrieved 2020-05-18.