39 citations · 192 across the 20 of their papers we have counts for
Showing 2012 · cs.PLShow all
2 papers · 2 filters
cs.PL2012★ 28 cited
Optimizing Abstract Abstract Machines
J. Ian Johnson, Nicholas Labich, Matthew Might +1
The technique of abstracting abstract machines (AAM) provides a systematic approach for deriving computable approximations of evaluators that are easily proved sound. This article…
cs.PL2012
Introspective Pushdown Analysis of Higher-Order Programs
Christopher Earl, Ilya Sergey, Matthew Might +1
In the static analysis of functional programs, pushdown flow analysis and abstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each me…