default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugene Goldberg
Person information
- affiliation (since 2016): Diffblue Ltd., Oxford, UK
- affiliation (2009 - 2015): Northeastern University, Boston, MA, USA
- affiliation (1997 - 2008): Cadence Berkeley Labs, Berkeley, CA, USA
- affiliation (1996 - 1997): University of California, Department of EECS, Berkeley, CA, USA
- affiliation (PhD 1995): Academy of Sciences of Belarus, Minsk, Belarus
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i23]Eugene Goldberg:
Local Computing By Partial Quantifier Elimination. CoRR abs/2403.05928 (2024)- [i22]Eugene Goldberg:
On Efficient Algorithms For Partial Quantifier Elimination. CoRR abs/2406.01307 (2024) - 2023
- [c31]Eugene Goldberg:
Partial Quantifier Elimination and Property Generation. CAV (2) 2023: 110-131 - [i21]Eugene Goldberg:
Partial Quantifier Elimination And Property Generation. CoRR abs/2303.13811 (2023) - [i20]Eugene Goldberg:
Verification Of Partial Quantifier Elimination. CoRR abs/2303.14928 (2023) - 2020
- [i19]Eugene Goldberg:
Partial Quantifier Elimination By Certificate Clauses. CoRR abs/2003.09667 (2020) - [i18]Eugene Goldberg:
Generation Of A Complete Set Of Properties. CoRR abs/2004.05853 (2020) - [i17]Eugene Goldberg:
On Verifying Designs With Incomplete Specification. CoRR abs/2004.09503 (2020)
2010 – 2019
- 2019
- [i16]Eugene Goldberg:
Partial Quantifier Elimination With Learning. CoRR abs/1906.10357 (2019) - 2018
- [c30]Eugene Goldberg, Matthias Güdemann
, Daniel Kroening, Rajdeep Mukherjee:
Efficient verification of multi-property designs (The benefit of wrong assumptions). DATE 2018: 43-48 - [c29]Eugene Goldberg:
Complete Test Sets And Their Approximations. FMCAD 2018: 1-9 - [i15]Eugene Goldberg:
Generation of complete test sets. CoRR abs/1804.00073 (2018) - [i14]Eugene Goldberg:
Complete Test Sets And Their Approximations. CoRR abs/1808.05750 (2018) - [i13]Eugene Goldberg:
Improving Convergence Rate Of IC3. CoRR abs/1809.00503 (2018) - [i12]Eugene Goldberg:
Quantifier Elimination With Structural Learning. CoRR abs/1810.00160 (2018) - 2017
- [i11]Eugene Goldberg, Matthias Güdemann, Daniel Kroening, Rajdeep Mukherjee:
Efficient Verification of Multi-Property Designs (The Benefit of Wrong Assumptions) (Extended Version). CoRR abs/1711.05698 (2017) - 2016
- [c28]Eugene Goldberg:
Equivalence checking by logic relaxation. FMCAD 2016: 49-56 - [i10]Eugene Goldberg:
Property Checking By Logic Relaxation. CoRR abs/1601.02742 (2016) - [i9]Eugene Goldberg:
Property Checking Without Invariant Generation. CoRR abs/1602.05829 (2016) - 2015
- [i8]Eugene Goldberg:
Equivalence Checking and Simulation By Computing Range Reduction. CoRR abs/1507.02297 (2015) - [i7]Eugene Goldberg:
Equivalence Checking By Logic Relaxation. CoRR abs/1511.01368 (2015) - 2014
- [j8]Eugene Goldberg, Panagiotis Manolios:
Quantifier elimination by dependency sequents. Formal Methods Syst. Des. 45(2): 111-143 (2014) - [c27]Eugene Goldberg, Panagiotis Manolios:
Partial Quantifier Elimination. Haifa Verification Conference 2014: 148-164 - [c26]Eugene Goldberg, Panagiotis Manolios:
Software for Quantifier Elimination in Propositional Logic. ICMS 2014: 291-294 - [i6]Eugene Goldberg, Panagiotis Manolios:
Partial Quantifier Elimination. CoRR abs/1407.4835 (2014) - [i5]Eugene Goldberg, Panagiotis Manolios:
Bug Hunting By Computing Range Reduction. CoRR abs/1408.7039 (2014) - 2013
- [c25]Eugene Goldberg, Panagiotis Manolios:
Quantifier elimination via clause redundancy. FMCAD 2013: 85-92 - [i4]Eugene Goldberg, Mitesh Jain, Panagiotis Manolios:
Verification of Sequential Circuits by Tests-As-Proofs Paradigm. CoRR abs/1308.0583 (2013) - 2012
- [c24]Eugene Goldberg, Panagiotis Manolios:
Quantifier elimination by Dependency Sequents. FMCAD 2012: 34-43 - [i3]Eugene Goldberg, Panagiotis Manolios:
Quantifier Elimination by Dependency Sequents. CoRR abs/1201.5653 (2012) - [i2]Eugene Goldberg, Panagiotis Manolios:
Removal of Quantifiers by Elimination of Boundary Points. CoRR abs/1204.1746 (2012) - [i1]Eugene Goldberg, Panagiotis Manolios:
Checking Satisfiability by Dependency Sequents. CoRR abs/1207.5014 (2012) - 2010
- [c23]Eugene Goldberg, Panagiotis Manolios:
SAT-Solving Based on Boundary Point Elimination. Haifa Verification Conference 2010: 93-111 - [c22]Eugene Goldberg, Panagiotis Manolios:
Generating High-Quality Tests for Boolean Circuits by Treating Tests as Proof Encoding. TAP@TOOLS 2010: 101-116
2000 – 2009
- 2009
- [c21]Eugene Goldberg:
Boundary Points and Resolution. SAT 2009: 147-160 - 2008
- [j7]Eugene Goldberg:
A Resolution Based SAT-solver Operating on Complete Assignments. J. Satisf. Boolean Model. Comput. 5(1-4): 217-242 (2008) - [c20]Eugene Goldberg:
A Decision-Making Procedure for Resolution-Based SAT-Solvers. SAT 2008: 119-132 - [c19]Eugene Goldberg:
On Bridging Simulation and Formal Verification. VMCAI 2008: 127-141 - 2007
- [j6]Eugene Goldberg, Yakov Novikov:
BerkMin: A fast and robust Sat-solver. Discret. Appl. Math. 155(12): 1549-1561 (2007) - [c18]Eugene Goldberg, Kanupriya Gulati:
On Complexity of Internal and External Equivalence Checking. DSD 2007: 197-206 - [c17]Eugene Goldberg, Kanupriya Gulati, Sunil P. Khatri:
Toggle Equivalence Preserving (TEP) Logic Optimization. DSD 2007: 271-279 - 2006
- [c16]Eugene Goldberg:
Determinization of Resolution by an Algorithm Operating on Complete Assignments. SAT 2006: 90-95 - 2005
- [j5]Eugene Goldberg:
Testing satisfiability of CNF formulas by computing a stable set of points. Ann. Math. Artif. Intell. 43(1): 65-89 (2005) - [c15]Eugene Goldberg:
On equivalence checking and logic synthesis of circuits with a common specification. ACM Great Lakes Symposium on VLSI 2005: 102-107 - [c14]Eugene Goldberg:
Equivalence Checking of Circuits with Parameterized Specifications. SAT 2005: 107-121 - 2003
- [c13]Evguenii I. Goldberg, Yakov Novikov:
Verification of Proofs of Unsatisfiability for CNF Formulas. DATE 2003: 10886-10891 - [c12]Eugene Goldberg, Yakov Novikov:
How Good Can a Resolution Based SAT-solver Be? SAT 2003: 37-52 - 2002
- [j4]Eugene Goldberg:
Proving Unsatisfiability of CNFs Locally. J. Autom. Reason. 28(5): 417-434 (2002) - [c11]Eugene Goldberg:
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points. CADE 2002: 161-180 - [c10]Evguenii I. Goldberg, Mukul R. Prasad, Robert K. Brayton:
Using Problem Symmetry in Search Based Satisfiability Algorithms. DATE 2002: 134-141 - [c9]Evguenii I. Goldberg, Yakov Novikov:
BerkMin: A Fast and Robust Sat-Solver. DATE 2002: 142-149 - 2001
- [j3]Eugene Goldberg:
Proving unsatisfiability of CNFs locally. Electron. Notes Discret. Math. 9: 96-114 (2001) - [c8]Evguenii I. Goldberg, Mukul R. Prasad, Robert K. Brayton:
Using SAT for combinational equivalence checking. DATE 2001: 114-121 - [c7]Yakov Novikov, Evguenii I. Goldberg:
An efficient learning procedure for multiple implication checks. DATE 2001: 127-135 - 2000
- [j2]Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli:
Negative thinking in branch-and-bound: the case of unate covering. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(3): 281-294 (2000) - [c6]Eugene Goldberg, Alexander Saldanha:
Timing Analysis with Implicitly Specified False Paths. VLSI Design 2000: 518-522
1990 – 1999
- 1999
- [c5]Luca P. Carloni, Evguenii I. Goldberg, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli:
Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems. VLSI 1999: 346-361 - 1998
- [j1]Evguenii I. Goldberg, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli:
Theory and algorithms for face hypercube embedding. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17(6): 472-488 (1998) - [c4]Evguenii I. Goldberg, Yuji Kukimoto, Robert K. Brayton:
Combinational Verification based on High-Level Functional Specifications. DATE 1998: 803-808 - 1997
- [c3]Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli:
Negative thinking by incremental problem solving: application to unate covering. ICCAD 1997: 91-98 - [c2]Evguenii I. Goldberg, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli:
A fast and robust exact algorithm for face embedding. ICCAD 1997: 296-303 - 1994
- [c1]Eugene Goldberg, Ludmila Krasilnikova:
Using Consensusless Covers for Fast Operating on Boolean Functions. FPL 1994: 114-116
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
