22 citations · 22 across the 5 of their papers we have counts for
6 papers
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…
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…
Synthesis with Asymptotic Resource Bounds
Qinheping Hu, John Cyphert, Loris D'Antoni +1
We present a method for synthesizing recursive functions that satisfy both a functional specification and an asymptotic resource bound. Prior methods for synthesis with a resource…
Exact and Approximate Methods for Proving Unrealizability of Syntax-Guided Synthesis Problems
Qinheping Hu, John Cyphert, Loris D'Antoni +1
We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no solution). We formulate the problem of prov…
Templates and Recurrences: Better Together
Jason Breck, John Cyphert, Zachary Kincaid +1
This paper is the confluence of two streams of ideas in the literature on generating numerical invariants, namely: (1) template-based methods, and (2) recurrence-based methods. A t…
Proving Unrealizability for Syntax-Guided Synthesis
Qinheping Hu, Jason Breck, John Cyphert +2
Proving Unrealizability for Syntax-Guided Synthesis We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e.…