39 citations · 192 across the 20 of their papers we have counts for
19 papers · 1 filter
miniAdapton: A Minimal Implementation of Incremental Computation in Scheme
Dakota Fisher, Matthew A. Hammer, William Byrd +1
We describe a complete Scheme implementation of miniAdapton, which implements the core functionality of the Adapton system for incremental computation (also known as self-adjusting…
On the Complexity and Performance of Parsing with Derivatives
Michael D. Adams, Celeste Hollenbeck, Matthew Might
Current algorithms for context-free parsing inflict a trade-off between ease of understanding, ease of implementation, theoretical complexity, and practical performance. No algorit…
Pushdown Control-Flow Analysis for Free
Thomas Gilray, Steven Lyde, Michael D. Adams +2
Traditional control-flow analysis (CFA) for higher-order languages, whether implemented by constraint-solving or abstract interpretation, introduces spurious connections between ca…
Galois Transformers and Modular Abstract Interpreters
David Darais, Matthew Might, David Van Horn
The design and implementation of static analyzers has become increasingly systematic. Yet for a given language or analysis feature, it often requires tedious and error prone work t…
Pruning, Pushdown Exception-Flow Analysis
Shuying Liang, Weibin Sun, Matthew Might +2
Statically reasoning in the presence of exceptions and about the effects of exceptions is challenging: exception-flows are mutually determined by traditional control-flow and point…
Resolving and Exploiting the -CFA Paradox
Matthew Might, Yannis Smaragdakis, David Van Horn
Low-level program analysis is a fundamental problem, taking the shape of "flow analysis" in functional languages and "points-to" analysis in imperative and object-oriented language…