John Cyphert

According to our database, John Cyphert authored at least 10 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis.

John Cyphert, Zachary Kincaid

Proc. ACM Program. Lang., January, 2024

2023

Optimal Symbolic Bound Synthesis.

John Cyphert, Yotam Feldman, Zachary Kincaid, Thomas W. Reps

CoRR, 2023

2021

Algebraic Program Analysis.

Zachary Kincaid, Thomas W. Reps, John Cyphert

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Synthesis with Asymptotic Resource Bounds.

Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020

Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems.

Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Templates and recurrences: better together.

Jason Breck, John Cyphert, Zachary Kincaid, Thomas W. Reps

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019

Closed forms for numerical loops.

Zachary Kincaid, Jason Breck, John Cyphert, Thomas W. Reps

Proc. ACM Program. Lang., 2019

Refinement of path expressions for static analysis.

John Cyphert, Jason Breck, Zachary Kincaid, Thomas W. Reps

Proc. ACM Program. Lang., 2019

Proving Unrealizability for Syntax-Guided Synthesis.

Qinheping Hu, Jason Breck, John Cyphert, Loris D'Antoni, Thomas W. Reps

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Non-linear reasoning for invariant synthesis.

Zachary Kincaid, John Cyphert, Jason Breck, Thomas W. Reps

Proc. ACM Program. Lang., 2018