66 citations · 97 across the 11 of their papers we have counts for
6 papers · 1 filter
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…
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…
Property-Directed Reachability as Abstract Interpretation in the Monotone Theory
Yotam M. Y. Feldman, Mooly Sagiv, Sharon Shoham +1
Inferring inductive invariants is one of the main challenges of formal verification. The theory of abstract interpretation provides a rich framework to devise invariant inference a…
Learning the Boundary of Inductive Invariants
Yotam M. Y. Feldman, Mooly Sagiv, Sharon Shoham +1
We study the complexity of invariant inference and its connections to exact concept learning. We define a condition on invariants and their geometry, called the fence condition, wh…
Complexity and Information in Invariant Inference
Yotam M. Y. Feldman, Neil Immerman, Mooly Sagiv +1
This paper addresses the complexity of SAT-based invariant inference, a prominent approach to safety verification. We consider the problem of inferring an inductive invariant of po…
Inferring Inductive Invariants from Phase Structures
Yotam M. Y. Feldman, James R. Wilcox, Sharon Shoham +1
Infinite-state systems such as distributed protocols are challenging to verify using interactive theorem provers or automatic verification tools. Of these techniques, deductive ver…