22 citations · 22 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.PL2023
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis
John Cyphert, Zachary Kincaid
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial…
cs.PL2023
Optimal Symbolic Bound Synthesis
John Cyphert, Yotam Feldman, Zachary Kincaid +1
The problem of finding a constant bound on a term given a set of assumptions has wide applications in optimization as well as program analysis. However, in many contexts the object…