Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications of SPCL

A. Pitchanathan, C. Ulmann, M. Weber, T. Hoefler, T. Grosser:

 FPL: fast Presburger arithmetic through transprecision

(OOPSLA '21: Proceedings of the ACM international conference on Object oriented programming systems languages and applications. Vol , Nr. , ACM, Nov. 2021)
OOPSLA distinguished paper award (6/71)

Publisher Reference


Presburger arithmetic provides the mathematical core for the polyhedral compilation techniques that drive analytical cache models, loop optimization for ML and HPC, formal verification, and even hardware design. Polyhedral compilation is widely regarded as being slow due to the potentially high computational cost of the underlying Presburger libraries. Researchers typically use these libraries as powerful black-box tools, but the perceived internal complexity of these libraries, caused by the use of C as the implementation language and a focus on end-user-facing documentation, holds back broader performance-optimization efforts. With FPL, we introduce a new library for Presburger arithmetic built from the ground up in modern C++. We carefully document its internal algorithmic foundations, use lightweight C++ data structures to minimize memory management costs, and deploy transprecision computing across the entire library to effectively exploit machine integers and vector instructions. On a newly-developed comprehensive benchmark suite for Presburger arithmetic, we show a 5.4x speedup in total runtime over the state-of-the-art library isl in its default configuration and 3.6x over a variant of isl optimized with element-wise transprecision computing. We expect that the availability of a well-documented and fast Presburger library will accelerate the adoption of polyhedral compilation techniques in production compilers.


download article:
access preprint on arxiv:

Recorded talk (best effort)



  author={Arjun Pitchanathan and Christian Ulmann and Michel Weber and Torsten Hoefler and Tobias Grosser},
  title={{FPL: fast Presburger arithmetic through transprecision}},
  journal={OOPSLA '21: Proceedings of the ACM international conference on Object oriented programming systems languages and applications},