My primary research area is static analysis of higher-order programs.
My broader interests include language design, compiler implementation, security, program optimization, parallelism and program verification.
I run the U Combinator software systems research group.
Publications
- CiteULike: [my pubs] [my library]
Proceedings papers
-
(New)
Michael D. Adams, Andrew W. Keep, Jan Midtgaard,
Matthew Might, Arun Chauhan and R. Kent Dybvig.
"Flow-Sensitive Type Recovery in Linear-Log Time."
Accepted to Conference on Object-Oriented Programming, Systems, Languages and Applications
(OOPSLA 2011).
Portland, Oregon.
October, 2011.
Paper: [pdf] -
(New)
Matthew Might, David Darais and Daniel Spiewak.
"Functional Pearl: Parsing with Derivatives."
International Conference on Functional Programming 2011 (ICFP 2011).
Tokyo, Japan.
September, 2011.
pages 189--195.
Paper: [pdf]
Slides: [pdf] -
(New)
Matthew Might and David Van Horn.
"A family of abstract interpretations for static analysis
of concurrent higher-order programs."
Static Analysis Symposium 2011 (SAS 2011).
Venice, Italy.
September, 2011.
Paper: [pdf] [arXiv]
Slides: [pdf] -
(New)
Tarun Prabhu, Shreyas Ramalingam, Matthew Might and Mary Hall.
"EigenCFA: Accelerating flow analysis with GPUs."
38th Annual ACM Symposium on the Principles of Programming Languages.
(POPL 2011).
Austin, Texas, USA.
January, 2011.
pages 511--522.
Paper: [pdf]
-
Christopher Earl, Matthew Might and David Van Horn.
"Pushdown control-flow analysis of higher-order programs: Precise, polyvariant and polynomial-time."
2010 Workshop on Scheme and Functional Programming.
(Scheme 2010).
Montreal, Quebec, Canada.
August, 2010.
Paper: [pdf] [bib]
-
David Van Horn and Matthew Might.
"Abstracting Abstract Machines."
International Conference on Functional Programming 2010 (ICFP 2010).
Baltimore, Maryland.
September, 2010.
pages 51--62.
Paper: [pdf] -
Matthew Might.
"Abstract interpreters for free."
Static Analysis Symposium 2010 (SAS 2010).
Perpignan, France.
September, 2010.
pages 407--421.
Paper: [pdf]
Slides: [pdf]
-
Matthew Might, Yannis Smaragdakis and David Van Horn.
"Resolving and exploiting the k-CFA paradox: Illuminating functional vs. object-oriented program analysis."
Programming Language Design and Implementation 2010 (PLDI 2010).
Toronto, Canada.
June, 2010.
pages 305--315.
Paper: [pdf] [bib]
Slides: [pdf]
-
Matthew Might.
"Shape analysis in the absence of pointers and structure."
11th International Conference on Verification, Model Checking and Abstract Interpretation
(VMCAI 2010).
Madrid, Spain.
January, 2010.
pages 263--278.
Paper: [pdf] [bib]
Slides: [pdf] [www/html] [www/flash] [keynote]
-
Matthew Might and Tarun Prabhu.
"Interprocedural dependence analysis of higher-order programs via stack reachability."
2009 Workshop on Scheme and Functional Programming.
(Scheme 2009).
Boston, Massachussetts, MA.
August, 2009.
Paper: [pdf] [bib]
Slides: [pdf] [www/html] [keynote]
-
Matthew Might and Panagiotis Manolios.
"A posteriori soundness for non-deterministic abstract interpretations."
10th International Conference on Verification, Model Checking and Abstract Interpretation
(VMCAI 2009).
Savannah, Georgia, USA.
January, 2009.
pages 260--274.
Paper: [pdf] [bib]
Slides: [pdf] [www/html] [keynote]
-
Matthew Might.
"Logic-flow analysis of higher-order programs."
34th Annual ACM Symposium on the Principles of Programming Languages
(POPL 2007).
Long paper category.
Nice, France.
January, 2007.
pages 185--198.
Paper: [pdf] [bib]
Slides: [pdf]
-
Matthew Might, Benjamin Chambers and Olin Shivers.
"Model Checking via ΓCFA."
8th International Conference on Verification, Model Checking and Abstract Interpretation
(VMCAI 2007).
Nice, France.
January, 2007.
pages 59--73.
Paper: [pdf] [bib]
-
Matthew Might and Olin Shivers.
"Improving flow analyses via ΓCFA: Abstract garbage collection and counting."
11th ACM International Conference on Functional Programming
(ICFP 2006).
Portland, Oregon.
September, 2006.
pages 13--25.
Paper: [pdf] [bib]
Slides: [pdf]
-
Olin Shivers and Matthew Might.
"Continuations and transducer composition."
27th Conference on Programming Language Design and Implementation
(PLDI 2006).
Ottawa, Canada.
pages 295--307.
June, 2006.
Paper: [pdf] [bib]
Slides: [pdf]
-
Matthew Might and Olin Shivers.
"Environment analysis via ΔCFA."
33rd Annual ACM Symposium on the Principles of Programming Languages
(POPL 2006).
Charleston, South Carolina.
January, 2006.
pages 127--140.
Paper: [pdf] [bib]
Slides: [pdf]
Journal papers
-
(New)
David Van Horn and Matthew Might.
"Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis."
Communications of the ACM. (Research Highlights)
September, 2011.
Paper: [pdf] [arXiv]
Technical perspective: [pdf] -
Matthew Might and Olin Shivers.
"Exploiting reachability and cardinality in higher-order flow analysis."
Journal of Functional Programming.
Volume 18,
Issues 5-6.
2008.
pages 821-864.
Paper: [pdf] [bib]