default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Might
Person information
- affiliation: University of Utah
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Aleksandra Foksinska, Camerron M. Crowder
, Andrew B. Crouse, Jeff Henrikson, William E. Byrd, Gregory Rosenblatt, Michael J. Patton, Kaiwen He, Thi K. Tran-Nguyen, Marissa Zheng, Stephen A. Ramsey, Nada Amin, John D. Osborne, Matthew Might:
The precision medicine process for treating rare disease using the artificial intelligence tool mediKanren. Frontiers Artif. Intell. 5 (2022)- 2020
- [j14]Bohdan B. Khomtchouk, Diem-Trang T. Tran, Kasra A. Vand, Matthew Might, Or Gozani, Themistocles L. Assimes:
Cardioinformatics: the nexus of bioinformatics and precision cardiology. Briefings Bioinform. 21(6): 2031-2051 (2020) - [j13]Núria Queralt-Rosinach, Gregory S. Stupp, Tong Shu Li, Michael Mayers, Maureen E. Hoatlin, Matthew Might, Benjamin M. Good, Andrew I. Su:
Structured reviews for data and knowledge-driven research. Database J. Biol. Databases Curation 2020 (2020)
2010 – 2019
- 2019
- [c42]Matthew Might:
The algorithm for precision medicine (invited talk). SPLASH (Companion Volume) 2019: 2 - [c41]Kimball Germane, Matthew Might:
Relatively Complete Pushdown Analysis of Escape Continuations. VMCAI 2019: 205-225 - [c40]Kimball Germane, Jay McCarthy, Michael D. Adams, Matthew Might:
Demand Control-Flow Analysis. VMCAI 2019: 226-246 - 2018
- [j12]Diem-Trang T. Tran, Tian Zhang, Ryan Stutsman, Matthew Might, Umesh R. Desai, Balagurunathan Kuberan:
anexVis: visual analytics framework for analysis of RNA expression. Bioinform. 34(14): 2510-2512 (2018) - [j11]Thomas Gilray, Michael D. Adams, Matthew Might:
Abstract allocation as a unified approach to polyvariance in control-flow analyses. J. Funct. Program. 28: e18 (2018) - [c39]Lisa Zhang, Gregory Rosenblatt, Ethan Fetaya, Renjie Liao, William E. Byrd, Matthew Might, Raquel Urtasun, Richard S. Zemel:
Neural Guided Constraint Logic Programming for Program Synthesis. NeurIPS 2018: 1744-1753 - [i21]Lisa Zhang, Gregory Rosenblatt, Ethan Fetaya, Renjie Liao, William E. Byrd, Matthew Might, Raquel Urtasun, Richard S. Zemel:
Neural Guided Constraint Logic Programming for Program Synthesis. CoRR abs/1809.02840 (2018) - 2017
- [j10]Christopher Earl, Matthew Might, Abhishek Bagusetty, James C. Sutherland:
Nebo: An efficient, parallel, and portable domain-specific language for numerically solving partial differential equations. J. Syst. Softw. 125: 389-400 (2017) - [j9]William E. Byrd, A. Ballantyne, Gregory Rosenblatt, Matthew Might:
A unified approach to solving seven programming problems (functional pearl). Proc. ACM Program. Lang. 1(ICFP): 8:1-8:26 (2017) - [j8]Michael D. Adams, Matthew Might:
Restricting grammars with tree automata. Proc. ACM Program. Lang. 1(OOPSLA): 82:1-82:25 (2017) - [c38]Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might:
A Simple Complete Search for Logic Programming. ICLP (Technical Communications) 2017: 14:1-14:8 - [c37]Kimball Germane, Matthew Might:
A posteriori environment analysis with Pushdown Delta CFA. POPL 2017: 19-31 - 2016
- [c36]Jason Hemann, Daniel P. Friedman, William E. Byrd, Matthew Might:
A small embedding of logic programming with a simple complete search. DLS 2016: 96-107 - [c35]Thomas Gilray, Michael D. Adams, Matthew Might:
Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis. ICFP 2016: 407-420 - [c34]Michael D. Adams, Celeste Hollenbeck, Matthew Might:
On the complexity and performance of parsing with derivatives. PLDI 2016: 224-236 - [c33]Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, David Van Horn:
Pushdown control-flow analysis for free. POPL 2016: 691-704 - [c32]Peter Aldous, Matthew Might:
A Posteriori Taint-Tracking for Demonstrating Non-interference in Expressive Low-Level Languages. IEEE Symposium on Security and Privacy Workshops 2016: 179-184 - [c31]James King, Thomas Gilray, Robert M. Kirby, Matthew Might:
Dynamic Sparse-Matrix Allocation on GPUs. ISC 2016: 61-80 - [i20]Michael D. Adams, Celeste Hollenbeck, Matthew Might:
On the Complexity and Performance of Parsing with Derivatives. CoRR abs/1604.04695 (2016) - [i19]Dakota Fisher, Matthew A. Hammer, William E. Byrd, Matthew Might:
miniAdapton: A Minimal Implementation of Incremental Computation in Scheme. CoRR abs/1609.05337 (2016) - 2015
- [c30]Steven Lyde, William E. Byrd, Matthew Might:
Control-flow analysis of dynamic languages via pointer analysis. DLS 2015: 54-62 - [c29]David Darais, Matthew Might, David Van Horn:
Galois transformers and modular abstract interpreters: reusable metatheory for program analysis. OOPSLA 2015: 552-571 - [c28]Peter Aldous, Matthew Might:
Static Analysis of Non-interference in Expressive Low-Level Languages. SAS 2015: 1-17 - [i18]Thomas Gilray, Steven Lyde, Michael D. Adams, Matthew Might, David Van Horn:
Pushdown Control-Flow Analysis for Free. CoRR abs/1507.03137 (2015) - 2014
- [j7]Dionna Amalie Glaze, Ilya Sergey, Christopher Earl, Matthew Might, David Van Horn:
Pushdown flow analysis with abstract garbage collection. J. Funct. Program. 24(2-3): 218-283 (2014) - [j6]Kimball Germane, Matthew Might:
Deletion: The curse of the red-black tree. J. Funct. Program. 24(4): 423-433 (2014) - [c27]Shuying Liang, Weibin Sun, Matthew Might:
Fast Flow Analysis with Godel Hashes. SCAM 2014: 225-234 - [c26]Shuying Liang, Weibin Sun, Matthew Might, Andrew W. Keep, David Van Horn:
Pruning, Pushdown Exception-Flow Analysis. SCAM 2014: 265-274 - [i17]Dionna Amalie Glaze, Ilya Sergey, Christopher Earl, Matthew Might, David Van Horn:
Pushdown flow analysis with abstract garbage collection. CoRR abs/1406.5106 (2014) - [i16]Shuying Liang, Weibin Sun, Matthew Might, Andrew W. Keep, David Van Horn:
Pruning, Pushdown Exception-Flow Analysis. CoRR abs/1409.3108 (2014) - [i15]David Darais, Matthew Might, David Van Horn:
Galois Transformers and Modular Abstract Interpreters. CoRR abs/1411.3962 (2014) - 2013
- [c25]Shuying Liang, Andrew W. Keep, Matthew Might, Steven Lyde, Thomas Gilray, Petey Aldous, David Van Horn:
Sound and precise malware analysis for android via pushdown reachability and entry-point saturation. SPSM@CCS 2013: 21-32 - [c24]Dionna Amalie Glaze, Nicholas Labich, Matthew Might, David Van Horn:
Optimizing abstract abstract machines. ICFP 2013: 443-454 - [c23]Steven Lyde, Matthew Might:
Extracting Hybrid Automata from Control Code. NASA Formal Methods 2013: 447-452 - [c22]Ilya Sergey, Dominique Devriese, Matthew Might, Jan Midtgaard, David Darais, Dave Clarke, Frank Piessens:
Monadic abstract interpreters. PLDI 2013: 399-410 - [c21]Steven Lyde, Matthew Might:
Control-Flow Analysis with SAT Solvers. Trends in Functional Programming 2013: 125-133 - [c20]Thomas Gilray, Matthew Might:
A Survey of Polyvariance in Abstract Interpretations. Trends in Functional Programming 2013: 134-148 - [c19]Shuying Liang, Matthew Might, David Van Horn:
AnaDroid: Malware Analysis of Android with User-supplied Predicates. TAPAS@SAS 2013: 3-14 - [e2]Matthew Might, David Van Horn, Andreas Abel, Tim Sheard:
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 [contents] - [i14]Shuying Liang, Matthew Might, Thomas Gilray, David Van Horn:
Pushdown Exception-Flow Analysis of Object-Oriented Programs. CoRR abs/1302.2692 (2013) - [i13]Shuying Liang, Matthew Might, David Van Horn:
AnaDroid: Malware Analysis of Android with User-supplied Predicates. CoRR abs/1311.4198 (2013) - [i12]Shuying Liang, Andrew W. Keep, Matthew Might, Steven Lyde, Thomas Gilray, Petey Aldous, David Van Horn:
Sound and Precise Malware Analysis for Android via Pushdown Reachability and Entry-Point Saturation. CoRR abs/1311.4201 (2013) - [i11]Matthew Might, Yannis Smaragdakis, David Van Horn:
Resolving and Exploiting the $k$-CFA Paradox. CoRR abs/1311.4231 (2013) - 2012
- [j5]David Van Horn, Matthew Might:
Systematic abstraction of abstract machines. J. Funct. Program. 22(4-5): 705-746 (2012) - [c18]Christopher Earl, Ilya Sergey, Matthew Might, David Van Horn:
Introspective pushdown analysis of higher-order programs. ICFP 2012: 177-188 - [c17]Shuying Liang, Matthew Might:
Hash-flow taint analysis of higher-order programs. PLAS 2012: 8 - [c16]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 - [c15]Jan Midtgaard, Matthew Might:
Preface. NSAD@SAS 2012: 1 - [e1]Jan Midtgaard, Matthew Might:
Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains, NSAD@SAS 2012, Deauville, France, September 10, 2012. Electronic Notes in Theoretical Computer Science 287, Elsevier 2012 [contents] - [i10]Christopher Earl, Ilya Sergey, Matthew Might, David Van Horn:
Introspective Pushdown Analysis of Higher-Order Programs. CoRR abs/1207.1813 (2012) - [i9]Dionna Amalie Glaze, Matthew Might, David Van Horn:
Optimizing Abstract Abstract Machines. CoRR abs/1211.3722 (2012) - 2011
- [j4]David Van Horn, Matthew Might:
Abstracting abstract machines: a systematic approach to higher-order program analysis. Commun. ACM 54(9): 101-109 (2011) - [c14]Matthew Might, David Darais, Daniel Spiewak:
Parsing with derivatives: a functional pearl. ICFP 2011: 189-195 - [c13]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 - [c12]Tarun Prabhu, Shreyas Ramalingam, Matthew Might, Mary W. Hall:
EigenCFA: accelerating flow analysis with GPUs. POPL 2011: 511-522 - [c11]Matthew Might, David Van Horn:
A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs. SAS 2011: 180-197 - [i8]Matthew Might, David Van Horn:
A family of abstract interpretations for static analysis of concurrent higher-order programs. CoRR abs/1103.5167 (2011) - [i7]David Van Horn, Matthew Might:
Abstracting Abstract Machines: A Systematic Approach to Higher-Order Program Analysis. CoRR abs/1105.1743 (2011) - [i6]David Van Horn, Matthew Might:
Systematic Abstraction of Abstract Machines. CoRR abs/1107.3539 (2011) - [i5]David Van Horn, Matthew Might:
An Analytic Framework for JavaScript. CoRR abs/1109.4467 (2011) - 2010
- [j3]Matt Might:
The academic job search: How to prepare key documents. XRDS 17(2): 7 (2010) - [c10]David Van Horn, Matthew Might:
Abstracting abstract machines. ICFP 2010: 51-62 - [c9]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 - [c8]Matthew Might:
Abstract Interpreters for Free. SAS 2010: 407-421 - [c7]Matthew Might:
Shape Analysis in the Absence of Pointers and Structure. VMCAI 2010: 263-278 - [i4]Christopher Earl, Matthew Might, David Van Horn:
Pushdown Control-Flow Analysis of Higher-Order Programs. CoRR abs/1007.4268 (2010) - [i3]David Van Horn, Matthew Might:
Abstracting Abstract Machines. CoRR abs/1007.4446 (2010) - [i2]Christopher Earl, Matthew Might, David Van Horn:
Stack-Summarizing Control-Flow Analysis of Higher-Order Programs. CoRR abs/1009.1560 (2010) - [i1]Matthew Might, David Darais:
Yacc is dead. CoRR abs/1010.5023 (2010)
2000 – 2009
- 2009
- [c6]Matthew Might, Panagiotis Manolios:
A PosterioriSoundness for Non-deterministic Abstract Interpretations. VMCAI 2009: 260-274 - 2008
- [j2]Matthew Might, Olin Shivers:
Exploiting reachability and cardinality in higher-order flow analysis. J. Funct. Program. 18(5-6): 821-864 (2008) - 2007
- [b1]Matthew Might:
Environment Analysis of Higher-Order Languages. Georgia Institute of Technology, Atlanta, GA, USA, 2007 - [j1]Matthew Might, Olin Shivers:
Analyzing the environment structure of higher-order languages using frame strings. Theor. Comput. Sci. 375(1-3): 137-168 (2007) - [c5]Matthew Might:
Logic-flow analysis of higher-order programs. POPL 2007: 185-198 - [c4]Matthew Might, Benjamin Chambers, Olin Shivers:
Model Checking Via GammaCFA. VMCAI 2007: 59-73 - 2006
- [c3]Matthew Might, Olin Shivers:
Improving flow analyses via GammaCFA: abstract garbage collection and counting. ICFP 2006: 13-25 - [c2]Olin Shivers, Matthew Might:
Continuations and transducer composition. PLDI 2006: 295-307 - [c1]Matthew Might, Olin Shivers:
Environment analysis via Delta CFA. POPL 2006: 127-140
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
