Matthew Might

Matthew Might, David Van Horn, Andreas Abel, Tim Sheard (Eds.): Proceedings of the 7th Workshop on Programming languages meets program verification, PLPV 2013, Rome, Italy, January 22, 2013. ACM 2013, isbn 978-1-4503-1860-0

Shuying Liang, Matthew Might, Thomas Gilray, David Van Horn: Pushdown Exception-Flow Analysis of Object-Oriented Programs. CoRR abs/1302.2692 (2013)

Jan Midtgaard, Matthew Might: Preface. Electr. Notes Theor. Comput. Sci. 287: 1 (2012)

David Van Horn, Matthew Might: Systematic abstraction of abstract machines. J. Funct. Program. 22(4-5): 705-746 (2012)

Christopher Earl, Ilya Sergey, Matthew Might, David Van Horn: Introspective pushdown analysis of higher-order programs. ICFP 2012: 177-188

Jan Midtgaard, Michael D. Adams, Matthew Might: A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections. SAS 2012: 352-369

Christopher Earl, Ilya Sergey, Matthew Might, David Van Horn: Introspective Pushdown Analysis of Higher-Order Programs. CoRR abs/1207.1813 (2012)

J. Ian Johnson, Matthew Might, David Van Horn: Optimizing Abstract Abstract Machines. CoRR abs/1211.3722 (2012)

David Van Horn, Matthew Might: Abstracting abstract machines: a systematic approach to higher-order program analysis. Commun. ACM 54(9): 101-109 (2011)

Matthew Might, David Darais, Daniel Spiewak: Parsing with derivatives: a functional pearl. ICFP 2011: 189-195

Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, R. Kent Dybvig: Flow-sensitive type recovery in linear-log time. OOPSLA 2011: 483-498

Tarun Prabhu, Shreyas Ramalingam, Matthew Might, Mary W. Hall: EigenCFA: accelerating flow analysis with GPUs. POPL 2011: 511-522

Matthew Might, David Van Horn: A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs. SAS 2011: 180-197

Matthew Might, David Van Horn: A family of abstract interpretations for static analysis of concurrent higher-order programs. CoRR abs/1103.5167 (2011)

David Van Horn, Matthew Might: Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis. CoRR abs/1105.1743 (2011)

David Van Horn, Matthew Might: Systematic Abstraction of Abstract Machines. CoRR abs/1107.3539 (2011)

David Van Horn, Matthew Might: An Analytic Framework for JavaScript. CoRR abs/1109.4467 (2011)

David Van Horn, Matthew Might: Abstracting abstract machines. ICFP 2010: 51-62

Matthew Might, Yannis Smaragdakis, David Van Horn: Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis. PLDI 2010: 305-315

Matthew Might: Abstract Interpreters for Free. SAS 2010: 407-421

Matthew Might: Shape Analysis in the Absence of Pointers and Structure. VMCAI 2010: 263-278

Christopher Earl, Matthew Might, David Van Horn: Pushdown Control-Flow Analysis of Higher-Order Programs. CoRR abs/1007.4268 (2010)

David Van Horn, Matthew Might: Abstracting Abstract Machines. CoRR abs/1007.4446 (2010)

Christopher Earl, Matthew Might, David Van Horn: Stack-Summarizing Control-Flow Analysis of Higher-Order Programs. CoRR abs/1009.1560 (2010)

Matthew Might, David Darais: Yacc is dead. CoRR abs/1010.5023 (2010)

Matthew Might, Panagiotis Manolios: A PosterioriSoundness for Non-deterministic Abstract Interpretations. VMCAI 2009: 260-274

Matthew Might, Olin Shivers: Exploiting reachability and cardinality in higher-order flow analysis. J. Funct. Program. 18(5-6): 821-864 (2008)

Matthew Might, Olin Shivers: Analyzing the environment structure of higher-order languages using frame strings. Theor. Comput. Sci. 375(1-3): 137-168 (2007)

Matthew Might: Logic-flow analysis of higher-order programs. POPL 2007: 185-198

Matthew Might, Benjamin Chambers, Olin Shivers: Model Checking Via GammaCFA. VMCAI 2007: 59-73

Matthew Might, Olin Shivers: Improving flow analyses via GammaCFA: abstract garbage collection and counting. ICFP 2006: 13-25

Olin Shivers, Matthew Might: Continuations and transducer composition. PLDI 2006: 295-307

Matthew Might, Olin Shivers: Environment analysis via Delta CFA. POPL 2006: 127-140