Computing That Serves

Flexible Static Analyzers for Frugal Compilers


Wednesday, May 16, 2018 - 11:00am


Kimball Germane


Eric Mercer

Colloquium presented by Kimball Germane
Wednesday, May 16th, 2018
Location: 1105 JKB

Traditional designs for static analyzers of higher-order programming languages are inflexible: they require the program region they consider to be fixed, assume worst-case behavior of control and value flow across the region boundary, and must collect flow information for the entire region. Consequently, clients must balance the precision they desire with the cost to obtain it, both an increasing function of the region size. This design offers a poor match for clients to which control flow information is not always critical, such as optimizing compilers. This talk discusses an alternative design of control flow analyzers which allows clients to query specific pieces of control flow information without fixing a program region. Under this design, the analyzer and its client dialogue during an analysis session, allowing clients to direct the efforts of the analyzer based on
fresh information.

Please note: This colloquium will be held in 1105 JKB on Wednesday, May 16th.


Kimball Germane is a PhD candidate at the University of Utah. He received his MS in Computer Science from BYU in 2012 and his BS in Mathematics from BYU in 2010. His research interests include the design and implementation of programming language features that more closely map to the solution space of problem domains.