4 citations · 7 across the 3 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2024
On Efficient Algorithms For Partial Quantifier Elimination
Eugene Goldberg
Earlier, we introduced Partial Quantifier Elimination (PQE). It is a of regular quantifier elimination where one can take a of the formula…
cs.LO2014★ 4 cited
Bug Hunting By Computing Range Reduction
Eugene Goldberg, Panagiotis Manolios
We describe a method of model checking called Computing Range Reduction (CRR). The CRR method is based on derivation of clauses that reduce the set of traces of reachable states in…
cs.LO2012★ 3 cited
Removal of Quantifiers by Elimination of Boundary Points
Eugene Goldberg, Panagiotis Manolios
We consider the problem of elimination of existential quantifiers from a Boolean CNF formula. Our approach is based on the following observation. One can get rid of dependency on a…