2 papers
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…
cs.PL2022
Invariant Inference With Provable Complexity From the Monotone Theory
Yotam M. Y. Feldman, Sharon Shoham
Invariant inference algorithms such as interpolation-based inference and IC3/PDR show that it is feasible, in practice, to find inductive invariants for many interesting systems, b…