Christopher A. Stone: Fixed points, lattices, and data flow analysis

Datum objave: 4. 11. 2013
Seminar za temelje matematike in teoretično računalništvo
Torek, 5. 11. 2013, od 12h do 14h, Plemljev seminar, Jadranska 19

Fixed points, lattices, and data flow analysis

Christopher A. Stone
Harvey Mudd College
USA

Abstract: Many questions about programs, such as those appearing in optimizing compilers, can be phrased as systems of equations. Solutions are found in practice by transforming the equations to a function on a lattice or semilattice and computing the least fixed point by iteration. Only finitely many steps are required, because the underlying structures have finite height.