Zachary Kincaid
Associate Professor
Research Interests
Make your next move.
Prepare your application
Review drafts before you send them.
Explore related searches
About
Dr. Zachary Kincaid is an Assistant Professor at Princeton University in the United States. His research primarily focuses on program analysis, including areas such as monotone procedure summarization, polynomial ideals, and consequence-finding in arithmetic theories. He has contributed to the field through recent articles that explore vector addition systems and inductive potentials in computational contexts.
Articles (8)
Year:
2026
Year:
2026
Year:
2026
Year:
2026
Year:
2025
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to generate all polynomial invariants for a restricted class of programs, but cannot be applied to programs outside of this class---for instance, programs with nested loops, conditional branching, unstructured control flow, etc. There currently lacks approaches to apply these prior methods to the case of general programs. This paper bridges that gap. Instead of restricting the kinds of programs we can handle, our method abstracts every loop into a model that can be solved with prior techniques, bringing to bear prior work on solvable polynomial maps to general programs. While no method can generate all polynomial invariants for arbitrary programs, our method establishes its merit through a monotonicty result. We have implemented our techniques, and tested them on a suite of benchmarks from the literature. Our experiments indicate our techniques show promise on challenging verification tasks requiring non-linear reasoning.
Year:
2024
Year:
2024
This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived of as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication symbol, which retains many of the desirable algorithmic properties of linear arithmetic. In particular, we show that the conjunctive fragment of the theory can be effectively manipulated (analogously to the usual operations on convex polyhedra, the conjunctive fragment of linear arithmetic). As a result, we can solve the following consequence-finding problem: given a ground formula F , find the strongest conjunctive formula that is entailed by F . As an application of consequence-finding, we give a loop invariant generation algorithm that is monotone with respect to the theory and (in a sense) complete. Experiments show that the invariants generated from the consequences are effective for proving safety properties of programs that require non-linear reasoning.
Year:
2023
Collaborators (4)
Shaowei Zhu
Princeton University
Ratul Mahajan
Associate Professor
University of Washington
Azadeh Farzan
Professor
University of Toronto
David Walker
Professor
Princeton University
Make your next move.
Prepare your application
Review drafts before you send them.