BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Italy
1 × Japan
1 × Spain
3 × Canada
5 × France
9 × USA
Collaborated with:
D.V.Horn O.Shivers M.D.Adams D.Darais J.Midtgaard S.Liang W.Sun M.D.A.0001 P.Aldous P.Manolios Kimball Germane I.Sergey A.W.Keep D.Spiewak Y.Smaragdakis B.Chambers Celeste Hollenbeck J.I.Johnson N.Labich C.Earl T.Prabhu S.Ramalingam M.W.Hall Thomas Gilray Steven Lyde A.Chauhan R.K.Dybvig D.Devriese D.Clarke F.Piessens
Talks about:
analysi (13) abstract (10) flow (7) interpret (5) program (5) cfa (5) pushdown (4) higher (3) order (3) posteriori (2)

Person: Matthew Might

DBLP DBLP: Might:Matthew

Contributed to:

OOPSLA 20152015
SAS 20152015
SCAM 20142014
ICFP 20132013
PLDI 20132013
ICFP 20122012
SAS 20122012
ICFP 20112011
OOPSLA 20112011
POPL 20112011
SAS 20112011
ICFP 20102010
PLDI 20102010
SAS 20102010
VMCAI 20102010
VMCAI 20092009
POPL 20072007
VMCAI 20072007
ICFP 20062006
PLDI 20062006
POPL 20062006
OOPSLA 20172017
PLDI 20162016
POPL 20162016
POPL 20172017

Wrote 26 papers:

OOPSLA-2015-DaraisMH #composition #program analysis #reuse
Galois transformers and modular abstract interpreters: reusable metatheory for program analysis (DD, MM, DVH), pp. 552–571.
SAS-2015-AldousM #low level #static analysis
Static Analysis of Non-interference in Expressive Low-Level Languages (PA, MM), pp. 1–17.
SCAM-2014-LiangSM #analysis #performance
Fast Flow Analysis with Godel Hashes (SL, WS, MM), pp. 225–234.
SCAM-2014-LiangSMKH #analysis #automaton #exception
Pruning, Pushdown Exception-Flow Analysis (SL, WS, MM, AWK, DVH), pp. 265–274.
ICFP-2013-JohnsonLMH #automaton #optimisation
Optimizing abstract abstract machines (JIJ, NL, MM, DVH), pp. 443–454.
PLDI-2013-SergeyDMMDCP #monad
Monadic abstract interpreters (IS, DD, MM, JM, DD, DC, FP), pp. 399–410.
ICFP-2012-EarlSMH #analysis #automaton #higher-order #source code
Introspective pushdown analysis of higher-order programs (CE, IS, MM, DVH), pp. 177–188.
SAS-2012-Midtgaard0M #proving
A Structural Soundness Proof for Shivers’s Escape Technique — A Case for Galois Connections (JM, MDA, MM), pp. 352–369.
ICFP-2011-MightDS #functional #parsing
Parsing with derivatives: a functional pearl (MM, DD, DS), pp. 189–195.
OOPSLA-2011-AdamsKMMCD #polynomial
Flow-sensitive type recovery in linear-log time (MDA, AWK, JM, MM, AC, RKD), pp. 483–498.
POPL-2011-PrabhuRMH #analysis #named
EigenCFA: accelerating flow analysis with GPUs (TP, SR, MM, MWH), pp. 511–522.
SAS-2011-MightH #abstract interpretation #concurrent #higher-order #product line #source code #static analysis
A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs (MM, DVH), pp. 180–197.
ICFP-2010-HornM #automaton
Abstracting abstract machines (DVH, MM), pp. 51–62.
PLDI-2010-MightSH #functional #object-oriented #program analysis
Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis (MM, YS, DVH), pp. 305–315.
SAS-2010-Might #for free
Abstract Interpreters for Free (MM), pp. 407–421.
VMCAI-2010-Might #analysis #pointer
Shape Analysis in the Absence of Pointers and Structure (MM), pp. 263–278.
VMCAI-2009-MightM #abstract interpretation #nondeterminism
A PosterioriSoundness for Non-deterministic Abstract Interpretations (MM, PM), pp. 260–274.
POPL-2007-Might #analysis #higher-order #source code
Logic-flow analysis of higher-order programs (MM), pp. 185–198.
VMCAI-2007-MightCS #model checking
Model Checking Via GammaCFA (MM, BC, OS), pp. 59–73.
ICFP-2006-MightS #analysis #garbage collection
Improving flow analyses via ΓCFA: abstract garbage collection and counting (MM, OS), pp. 13–25.
PLDI-2006-ShiversM #composition #continuation #transducer
Continuations and transducer composition (OS, MM), pp. 295–307.
POPL-2006-MightS #analysis
Environment analysis via Delta CFA (MM, OS), pp. 127–140.
OOPSLA-2017-AdamsM #automaton #strict
Restricting grammars with tree automata (MDA, MM), p. 25.
PLDI-2016-0001HM #complexity #on the #parsing #performance
On the complexity and performance of parsing with derivatives (MDA0, CH, MM), pp. 224–236.
POPL-2016-GilrayL0MH #analysis #automaton #control flow #for free
Pushdown control-flow analysis for free (TG, SL, MDA0, MM, DVH), pp. 691–704.
POPL-2017-GermaneM #analysis #automaton
A posteriori environment analysis with Pushdown Delta CFA (KG, MM), pp. 19–31.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.