Eugene Goldberg

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 21

Top Topics

Propositional Logic

Structural Learning

Constraint Propagation

Top Venues

Publications

Eugene Goldberg
On Efficient Algorithms For Partial Quantifier Elimination. CoRR (2024)
Eugene Goldberg
Local Computing By Partial Quantifier Elimination. CoRR (2024)
Eugene Goldberg
Partial Quantifier Elimination And Property Generation. CoRR (2023)
Eugene Goldberg
Partial Quantifier Elimination and Property Generation. CAV (2) (2023)
Eugene Goldberg
Verification Of Partial Quantifier Elimination. CoRR (2023)
Eugene Goldberg
Generation Of A Complete Set Of Properties. CoRR (2020)
Eugene Goldberg
Partial Quantifier Elimination By Certificate Clauses. CoRR (2020)
Eugene Goldberg
On Verifying Designs With Incomplete Specification. CoRR (2020)
Eugene Goldberg
Partial Quantifier Elimination With Learning. CoRR (2019)
Eugene Goldberg
Generation of complete test sets. CoRR (2018)
Eugene Goldberg
Complete Test Sets And Their Approximations. FMCAD (2018)
Eugene Goldberg
Quantifier Elimination With Structural Learning. CoRR (2018)
Eugene Goldberg, Matthias Güdemann, Daniel Kroening, Rajdeep Mukherjee
Efficient verification of multi-property designs (The benefit of wrong assumptions). DATE (2018)
Eugene Goldberg
Complete Test Sets And Their Approximations. CoRR (2018)
Eugene Goldberg
Improving Convergence Rate Of IC3. CoRR (2018)
Eugene Goldberg, Matthias Güdemann, Daniel Kroening, Rajdeep Mukherjee
Efficient Verification of Multi-Property Designs (The Benefit of Wrong Assumptions) (Extended Version). CoRR (2017)
Eugene Goldberg
Property Checking By Logic Relaxation. CoRR (2016)
Eugene Goldberg
Equivalence checking by logic relaxation. FMCAD (2016)
Eugene Goldberg
Property Checking Without Invariant Generation. CoRR (2016)
Eugene Goldberg
Equivalence Checking and Simulation By Computing Range Reduction. CoRR (2015)
Eugene Goldberg
Equivalence Checking By Logic Relaxation. CoRR (2015)
Eugene Goldberg, Panagiotis Manolios
Partial Quantifier Elimination. Haifa Verification Conference (2014)
Eugene Goldberg, Panagiotis Manolios
Bug Hunting By Computing Range Reduction. CoRR (2014)
Eugene Goldberg, Panagiotis Manolios
Quantifier elimination by dependency sequents. Formal Methods Syst. Des. 45 (2) (2014)
Eugene Goldberg, Panagiotis Manolios
Software for Quantifier Elimination in Propositional Logic. ICMS (2014)
Eugene Goldberg, Panagiotis Manolios
Partial Quantifier Elimination. CoRR (2014)
Eugene Goldberg, Panagiotis Manolios
Quantifier elimination via clause redundancy. FMCAD (2013)
Eugene Goldberg, Mitesh Jain, Panagiotis Manolios
Verification of Sequential Circuits by Tests-As-Proofs Paradigm. CoRR (2013)
Eugene Goldberg, Panagiotis Manolios
Quantifier elimination by Dependency Sequents. FMCAD (2012)
Eugene Goldberg, Panagiotis Manolios
Removal of Quantifiers by Elimination of Boundary Points CoRR (2012)
Eugene Goldberg, Panagiotis Manolios
Quantifier Elimination by Dependency Sequents CoRR (2012)
Eugene Goldberg, Panagiotis Manolios
Checking Satisfiability by Dependency Sequents CoRR (2012)
Eugene Goldberg, Panagiotis Manolios
SAT-Solving Based on Boundary Point Elimination. Haifa Verification Conference (2010)
Eugene Goldberg, Panagiotis Manolios
Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding. TAP@TOOLS (2010)
Eugene Goldberg
Boundary Points and Resolution. SAT (2009)
Eugene Goldberg
A Decision-Making Procedure for Resolution-Based SAT-Solvers. SAT (2008)
Eugene Goldberg
On Bridging Simulation and Formal Verification. VMCAI (2008)
Eugene Goldberg
A Resolution Based SAT-solver Operating on Complete Assignments. J. Satisf. Boolean Model. Comput. 5 (1-4) (2008)
Eugene Goldberg, Kanupriya Gulati
On Complexity of Internal and External Equivalence Checking. DSD (2007)
Eugene Goldberg, Yakov Novikov
BerkMin: A fast and robust Sat-solver. Discret. Appl. Math. 155 (12) (2007)
Eugene Goldberg, Kanupriya Gulati, Sunil P. Khatri
Toggle Equivalence Preserving (TEP) Logic Optimization. DSD (2007)
Eugene Goldberg
Determinization of Resolution by an Algorithm Operating on Complete Assignments. SAT (2006)
Eugene Goldberg
Equivalence Checking of Circuits with Parameterized Specifications. SAT (2005)
Eugene Goldberg
Testing satisfiability of CNF formulas by computing a stable set of points. Ann. Math. Artif. Intell. 43 (1) (2005)
Eugene Goldberg
On equivalence checking and logic synthesis of circuits with a common specification. ACM Great Lakes Symposium on VLSI (2005)
Eugene Goldberg, Yakov Novikov
How Good Can a Resolution Based SAT-solver Be? SAT (2003)
Eugene Goldberg
Proving Unsatisfiability of CNFs Locally. J. Autom. Reason. 28 (5) (2002)
Eugene Goldberg
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points. CADE (2002)
Eugene Goldberg
Proving unsatisfiability of CNFs locally. Electron. Notes Discret. Math. 9 (2001)
Eugene Goldberg, Alexander Saldanha
Timing Analysis with Implicitly Specified False Paths. VLSI Design (2000)
Eugene Goldberg, Ludmila Krasilnikova
Using Consensusless Covers for Fast Operating on Boolean Functions. FPL (1994)