4 citations · 29 across the 20 of their papers we have counts for
21 papers
Verification Of Partial Quantifier Elimination
Eugene Goldberg
Quantifier elimination (QE) is an important problem that has numerous applications. Unfortunately, QE is computationally very hard. Earlier we introduced a generalization of QE cal…
Partial Quantifier Elimination And Property Generation
Eugene Goldberg
We study partial quantifier elimination (PQE) for propositional CNF formulas with existential quantifiers. PQE is a generalization of quantifier elimination where one can limit the…
On Verifying Designs With Incomplete Specification
Eugene Goldberg
Incompleteness of a specification creates two problems. First, an implementation of may have some properties tha…
Generation Of A Complete Set Of Properties
Eugene Goldberg
One of the problems of formal verification is that it is not functionally complete due the incompleteness of specifications. An implementation meeting an incomplete specification m…
Partial Quantifier Elimination By Certificate Clauses
Eugene Goldberg
In this report, we study partial quantifier elimination (PQE) for propositional CNF formulas. PQE is a generalization of quantifier elimination where one can limit the set of claus…
Partial Quantifier Elimination With Learning
Eugene Goldberg
We consider a modification of the Quantifier Elimination (QE) problem called Partial QE (PQE). In PQE, only a small part of the formula is taken out of the scope of quantifiers. Th…