| Fast Graph Simplification for Interleaved-Dyck Reachability | 0 | 0.34 | 2022 |
| Efficient Algorithms for Dynamic Bidirected Dyck-Reachability | 0 | 0.34 | 2022 |
| On the complexity of bidirected interleaved Dyck-reachability | 0 | 0.34 | 2021 |
| Fast graph simplification for interleaved Dyck-reachability | 0 | 0.34 | 2020 |
| Program debloating via stochastic optimization | 2 | 0.37 | 2020 |
| Subdomain-Based Generality-Aware Debloating | 0 | 0.34 | 2020 |
| Debug information validation for optimized code | 1 | 0.36 | 2020 |
| Practical GUI testing of Android applications via model abstraction and refinement | 9 | 0.45 | 2019 |
| Perses: syntax-guided program reduction. | 7 | 0.46 | 2018 |
| Calling-to-reference context translation via constraint-guided CFL-reachability. | 1 | 0.36 | 2018 |
| Context-sensitive data-dependence analysis via linear conjunctive language reachability. | 8 | 0.43 | 2017 |
| Skeletal Program Enumeration for Rigorous Compiler Testing. | 12 | 0.60 | 2017 |
| Toward understanding compiler bugs in GCC and LLVM. | 12 | 0.49 | 2016 |
| Persistent pointer information | 2 | 0.36 | 2014 |
| Efficient subcubic alias analysis for C | 7 | 0.42 | 2014 |
| Fast algorithms for Dyck-CFL-reachability with applications to alias analysis | 15 | 0.52 | 2013 |
| Cross-library API recommendation using web search engines | 15 | 0.74 | 2011 |
| Flow-augmented call graph: a new foundation for taming API complexity | 5 | 0.55 | 2011 |
| Random unit-test generation with MUT-aware sequence recommendation | 11 | 0.59 | 2010 |
