39 citations · 192 across the 20 of their papers we have counts for
4 papers · 2 filters
Pushdown Abstractions of JavaScript
David Van Horn, Matthew Might
We design a family of program analyses for JavaScript that make no approximation in matching calls with returns, exceptions with handlers, and breaks with labels. We do so by start…
Systematic Abstraction of Abstract Machines
David Van Horn, Matthew Might
We describe a derivational approach to abstract interpretation that yields novel and transparently sound static analyses when applied to well-established abstract machines for high…
Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis
David Van Horn, Matthew Might
Predictive models are fundamental to engineering reliable software systems. However, designing conservative, computable approximations for the behavior of programs (static analyses…
A family of abstract interpretations for static analysis of concurrent higher-order programs
Matthew Might, David Van Horn
We develop a framework for computing two foundational analyses for concurrent higher-order programs: (control-)flow analysis (CFA) and may-happen-in-parallel analysis (MHP). We pay…