| Abstracting abstract machines D Van Horn, M Might The 15th ACM SIGPLAN International Conference on Functional Programming, 51-62, 2010 | 205* | 2010 |
| Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis M Might, Y Smaragdakis, D Van Horn Proceedings of the 31st ACM SIGPLAN Conference on Programming Language …, 2010 | 115 | 2010 |
| Sound and precise malware analysis for Android via pushdown reachability and entry-point saturation S Liang, AW Keep, M Might, S Lyde, T Gilray, P Aldous, D Van Horn Proceedings of the Third ACM workshop on Security and privacy in smartphones …, 2013 | 73 | 2013 |
| Soft contract verification PC Nguyen, S Tobin-Hochstadt, D Van Horn ACM SIGPLAN Notices 49 (9), 139-152, 2014 | 67 | 2014 |
| Introspective pushdown analysis of higher-order programs C Earl, I Sergey, M Might, D Van Horn Proceedings of the 17th ACM SIGPLAN international conference on Functional …, 2012 | 67 | 2012 |
| Abstracting definitional interpreters (functional pearl) D Darais, N Labich, PC Nguyen, D Van Horn Proceedings of the ACM on Programming Languages 1 (ICFP), 1-25, 2017 | 65 | 2017 |
| Higher-Order Symbolic Execution via Contracts S Tobin-Hochstadt, D Van Horn | 65 | 2012 |
| Pushdown control-flow analysis for free T Gilray, S Lyde, MD Adams, M Might, D Van Horn Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016 | 63 | 2016 |
| Incremental computation with names MA Hammer, J Dunfield, K Headley, N Labich, JS Foster, M Hicks, ... Proceedings of the 2015 ACM SIGPLAN International Conference on Object …, 2015 | 63 | 2015 |
| Types and trace effects of higher order programs C Skalka, S Smith, D Van Horn Journal of Functional Programming 18 (2), 179-249, 2008 | 63 | 2008 |
| Deciding kCFA is complete for EXPTIME D Van Horn, HG Mairson ACM Sigplan Notices 43 (9), 275-282, 2008 | 60 | 2008 |
| Pushdown control-flow analysis of higher-order programs C Earl, M Might, D Van Horn arXiv preprint arXiv:1007.4268, 2010 | 49 | 2010 |
| Relatively complete counterexamples for higher-order programs PC Nguyễn, D Van Horn ACM SIGPLAN Notices 50 (6), 446-456, 2015 | 45 | 2015 |
| Optimizing abstract abstract machines D Glaze, N Labich, M Might, D Van Horn ACM SIGPLAN Notices 48 (9), 443-454, 2013 | 38 | 2013 |
| Abstracting Abstract Control (Extended) JI Johnson, D Van Horn arXiv preprint arXiv:1305.3163, 2013 | 38 | 2013 |
| Galois transformers and modular abstract interpreters: reusable metatheory for program analysis D Darais, M Might, D Van Horn ACM SIGPLAN Notices 50 (10), 552-571, 2015 | 36 | 2015 |
| Theorem proving for all: equational reasoning in liquid Haskell (functional pearl) N Vazou, J Breitner, R Kunkel, D Van Horn, G Hutton Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, 132-144, 2018 | 29 | 2018 |
| Soft contract verification for higher-order stateful programs PC Nguyễn, T Gilray, S Tobin-Hochstadt, D Van Horn Proceedings of the ACM on Programming Languages 2 (POPL), 1-30, 2017 | 29 | 2017 |
| Running probabilistic programs backwards N Toronto, J McCarthy, D Van Horn Programming Languages and Systems: 24th European Symposium on Programming …, 2015 | 28 | 2015 |
| Relating complexity and precision in control flow analysis D Van Horn, HG Mairson ACM SIGPLAN Notices 42 (9), 85-96, 2007 | 28 | 2007 |
Matthew MightHugh Kaul Precision Medicine Institute, University of Alabama at Birmingham在 uab.edu 的电子邮件经过验证
