Skip to main content

An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection

Hang Yu, David Monniaux

PDF DOI 10.1007/978-3-030-32304-2_11 dblp BibTeX

Abstract

Polyhedral projection is a main operation of the polyhedron abstract domain. It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.

Related papers

Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers CGO 2020
Program generation for small-scale linear algebra applications CGO 2018
Polyhedral Analysis Using Parametric Objectives SAS 2012
Optimizing GPU Deep Learning Operators with Polyhedral Scheduling Constraint Injection CGO 2022
Exact and Approximated Data-Reuse Optimizations for Tiling with Parametric Sizes CC 2015
Improving compiler scalability: optimizing large programs at small price PLDI 2015
PolyUFC: Polyhedral Compilation Meets Roofline Analysis for Uncore Frequency Capping CGO 2026
Optimizing memory usage in the polyhedral model TOPLAS 2000