In this talk I will discuss abstracting abstract machines (AAM), a systematic methodology for extracting analyses, using the theory of abstract interpretation, from abstract-machine-based language semantics. I will focus especially on how to tune the polyvariance of such analyses and trade off precision and complexity. I will discuss advantages and challenges of this approach in the context of declarative languages for program analysis.

I am an Asst. Professor at the University of Alabama, Birmingham and work on program analysis, verification, language design, declarative analyses, high performance logic solving, and related topics. Visit my website for more: gilray.org