| Non-linear reasoning for invariant synthesis Z Kincaid, J Cyphert, J Breck, T Reps Proceedings of the ACM on Programming Languages 2 (POPL), 1-33, 2017 | 96 | 2017 |
| Closed forms for numerical loops Z Kincaid, J Breck, J Cyphert, T Reps Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019 | 39 | 2019 |
| Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems Q Hu, J Cyphert, L D'Antoni, T Reps Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020 | 26 | 2020 |
| Proving unrealizability for syntax-guided synthesis Q Hu, J Breck, J Cyphert, L D’Antoni, T Reps Computer Aided Verification: 31st International Conference, CAV 2019, New …, 2019 | 25 | 2019 |
| Templates and recurrences: better together J Breck, J Cyphert, Z Kincaid, T Reps Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020 | 24 | 2020 |
| Refinement of path expressions for static analysis J Cyphert, J Breck, Z Kincaid, T Reps Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019 | 21 | 2019 |
| Algebraic Program Analysis Z Kincaid, T Reps, J Cyphert Computer Aided Verification: 33rd International Conference, CAV 2021 …, 2021 | 8 | 2021 |
| Synthesis with asymptotic resource bounds Q Hu, J Cyphert, L D’Antoni, T Reps Computer Aided Verification: 33rd International Conference, CAV 2021 …, 2021 | 6 | 2021 |
| Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis J Cyphert, Z Kincaid Proceedings of the ACM on Programming Languages 8 (POPL), 724-752, 2024 | 1 | 2024 |
| Optimal Symbolic Bound Synthesis J Cyphert, Y Feldman, Z Kincaid, T Reps arXiv preprint arXiv:2310.13144, 2023 | | 2023 |
| Compositional, Monotone, and Non-linear Program Analysis J Cyphert The University of Wisconsin-Madison, 2023 | | 2023 |
Thomas RepsJ. Barkley Rosser Professor & Rajiv and Ritu Batra Chair, Comp. Sci. Dept., Univ. of WisconsinDirección de correo verificada de cs.wisc.edu
