Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Might, Matt - School of Computing, University of Utah
Research Statement Matthew Might
Static analysis of Higher-order programs
Static analysis of modern software systems
Parsing with Derivatives (Yacc is Dead)
Improving Flow Analyses via CFA Abstract Garbage Collection and Counting
EigenCFA: Accelerating Flow Analysis with GPUs Tarun Prabhu, Shreyas Ramalingam, Matthew Might, Mary Hall
Logic-Flow Analysis of Higher-Order Programs Matthew Might
Pushdown Control-Flow Analysis of Higher-Order Programs Christopher Earl Matthew Might
Abstract interpreters for free Matthew Might
Resolving and Exploiting the k-CFA Paradox Illuminating Functional vs. Object-Oriented Program Analysis
Resolving and Exploiting the k-CFA Paradox
Shape analysis of higher-order programs
Interprocedural Dependence Analysis of Higher-Order Programs via Stack Reachability
A posteriori soundness for non-deterministic abstract interpretations
Model Checking Via CFA Matthew Might, Benjamin Chambers, and Olin Shivers
Continuations and Transducer Composition Olin Shivers
JFP 18 (5 & 6): 821864, 2008. c 2008 Cambridge University Press doi:10.1017/S0956796808006941 First published online 12 August 2008 Printed in the United Kingdom
Control-flow analysis of higher-order programs
The Many-core Fad Many-core is a fad.
A Brief History of the Freedom of Expressions
Efficient control-flow analysis and beyond
Analyzing the Environment Structure of Higher-Order Languages using Frame Strings
Environment Analysis of Higher-Order Languages A Doctoral Dissertation
Research Statement Matthew Might
Environment Analysis via CFA Matthew Might Olin Shivers
Issue 3 August 2010 ProductsBy Andy Brice
Shape Analysis in the Absence of Pointers and Structure
Control-flow analysis of order k (k-CFA)
SepTeMBeR 2011 | Vol. 54 | no. 9 | CommUniCations of the aCm 101 Doi:10.1145/1995376.1995400
Parsing with Derivatives
Abstract interpretation of concurrent, higher-
Parsing with Derivatives
Parsing with Derivatives A Functional Pearl
Interpreters University of Utah
Small-step CFA University of Utah
Flow-Sensitive Type Recovery in Linear-Log Time Michael D. Adams
100 CommUniCations of the aCm | SepTeMBeR 2011 | Vol. 54 | no. 9 the gOal Of program analysis is to stati-
A family of abstract interpretations for static analysis of concurrent higher-order programs
Abstract interpretation of concurrent, higher-
University of Utah matt.might.net