I do research in static analysis of software systems. My objectives are to
- design programming languages,
- engineer compilers, and
- create software analysis tools
- performance,
- parallelism,
- security, and
- correctness.
I run the U Combinator software systems research group.
Research themes
Over time, a few themes have emerged in my research:
- flow analysis of higher-order languages;
- small-step abstract interpretation;
- methods that improve speed, precision and power in static analysis;
- taming the worst-case complexity of static analysis; and
- the art/science of designing/engineering a static analyzer.
Publications
- CiteULike: [my pubs] [my library]
Proceedings papers
-
(New)
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.
-
(New)
David Van Horn and Matthew Might.
``Abstracting Abstract Machines.''
Accepted to International Conference on Functional Programming 2010 (ICFP 2010).
Baltimore, Maryland.
September, 2010.
Paper: [pdf] -
(New)
Matthew Might.
``Abstract interpreters for free.''
Accepted to Static Analysis Symposium 2010 (SAS 2010).
Perpignan, France.
September, 2010.
Paper: [pdf]
-
(New)
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]
-
(New)
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.
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]