36 citations · 47 across the 7 of their papers we have counts for
7 papers
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…
Semantic Solutions to Program Analysis Problems
Sam Tobin-Hochstadt, David Van Horn
Problems in program analysis can be solved by developing novel program semantics and deriving abstractions conventionally. For over thirty years, higher-order program analysis has…
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…
Evaluating Call-By-Need on the Control Stack
Stephen Chang, David Van Horn, Matthias Felleisen
Ariola and Felleisen's call-by-need λ-calculus replaces a variable occurrence with its value at the last possible moment. To support this gradual notion of substitution, function a…
Pushdown Control-Flow Analysis of Higher-Order Programs
Christopher Earl, Matthew Might, David Van Horn
Context-free approaches to static analysis gain precision over classical approaches by perfectly matching returns to call sites---a property that eliminates spurious interprocedura…