240 citations · 362 across the 9 of their papers we have counts for
3 papers · 1 filter
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…