Polyhedral compilation and counting

Polyhedral compilation is widely used in high-level synthesis tools and in production compilers such as gcc, LLVM and IBM/XL and is still being actively developed by several research groups across the globe, resulting in highly attended IMPACT workshops and a recent polyhedral school. It is based on the polyhedral model, a powerful abstraction for analyzing and transforming (parts of) programs that are "sufficiently regular". The key feature of this model is that it is instance based, allowing for a representation and treatment of individual dynamic executions of a statement inside a loop nest and/or individual array elements. This presentation is the second part in a two-part tutorial about how to apply the basic concepts of polyhedral compilation in different settings. This second part deals with applications of set cardinality, focusing on problem modeling.status: publishe