activity
20112013
most citedA family of abstract interpretations for static analysis of concurrent higher-order programs

9 citations · 10 across the 6 of their papers we have counts for

collaborators
Showing cs.PLShow all

6 papers · 1 filter

cs.PL2013

Pushdown Exception-Flow Analysis of Object-Oriented Programs

Shuying Liang, Matthew Might, Thomas Gilray +1

Statically reasoning in the presence of and about exceptions is challenging: exceptions worsen the well-known mutual recursion between data-flow and control-flow analysis. The rece…

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…

cs.PL2011

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…

cs.PL20111 cited

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…

cs.PL2011

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…

cs.PL20119 cited

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…