Integer Point Counting Techniques for Polyhedra

Add to your list(s) Download to your calendar using vCal

• Samuel Bayliss (Imperial College)
• Thursday 17 May 2012, 13:00-14:00
• Level 9 Mahanakorn Lab., EE Dept..

If you have a question about this talk, please contact Grigorios Mingas.

Polyhedra are commonly used as an abstraction in compilers to represent bounded sets of operations. As an example, many loop nests in software programs have loop bounds which are independent of the program’s input data which means the loop iterations can be expressed as the integer points which lie within a Polyhedra. In evaluating the impact of loop transformations, we often ask the questions ”How Many?” or ”How Much?” and in this talk, we’ll explain existing analytical techniques for counting the number of integer points enclosed by a polyhedra and suggest how those techniques might be used in static code analysis.

This talk is part of the CAS Talks series.

This talk is included in these lists:

• Andrea Picciau's list
• CAS Talks
• Circuits and Systems Group: Internal Seminars
• Level 9 Mahanakorn Lab., EE Dept.

Note that ex-directory lists are not shown.