240 citations · 362 across the 9 of their papers we have counts for
11 papers
Multi-Structural Games and Beyond
Marco Carmosino, Ronald Fagin, Neil Immerman +3
Multi-structural (MS) games are combinatorial games that capture the number of quantifiers of first-order sentences. On the face of their definition, MS games differ from Ehrenfeuc…
Summing Up Smart Transitions
Neta Elad, Sophie Rain, Neil Immerman +2
Some of the most significant high-level properties of currencies are the sums of certain account balances. Properties of such sums can ensure the integrity of currencies and transa…
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…
The -Dimensional Weisfeiler-Leman Algorithm
Neil Immerman, Rik Sengupta
In this note, we provide details of the -dimensional Weisfeiler-Leman Algorithm and its analysis from Immerman-Lander (1990). In particular, we present an optimized version of t…
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins
Cibele Freire, Wolfgang Gatterbauer, Neil Immerman +1
The resilience of a Boolean query is the minimum number of tuples that need to be deleted from the input tables in order to make the query false. A solution to this problem immedia…
Bounded Quantifier Instantiation for Checking Inductive Invariants
Yotam M. Y. Feldman, Oded Padon, Neil Immerman +2
We consider the problem of checking whether a proposed invariant expressed in first-order logic with quantifier alternation is inductive, i.e. preserved by a piece of code. Whi…