Get the latest tech news
Polyhedral Compilation
.info provides information about the polyhedral compilation community including both the latest developments as well as an overview of existing work. Heavily relying on community contributions, it provides information about software tools that use polyhedral compilation techniques, the latest publications in this area as well as community events.
The interest of using polyhedral representations is that they can be manipulated or optimized with algorithms whose complexity depends on their structure and not on the number of elements they represent. The underlying theory dates back to seminal contributions such as The Organization of Computations for Uniform Recurrence Equations by Karp, Miller, and Winograd (1968) KARP1967 and Array Expansion(1988) FEAUTRIER1988ARRAY and Dataflow Analysis of Array and Scalar References(1991) FEAUTRIER1991 by P. Feautrier, and was built on important contributions in the 80s on loop transformations (work of Lamport LAMPORT1974, Banerjee, Wolfe, Allen and Kennedy, Irigoin and Triolet IRIGOIN1988, etc.) The 1978 seminal paper on abstract interpretation Automatic Discovery of Linear Restraints Among Variables of a Program by Cousot and Halbwachs COUSOT1978 can also be considered as one axis of foundations for polyhedral analysis, even if it gave rise to an initially-disjoint community.
Or read this on Hacker News