Eugene Goldberg

52 papers A 7B 6C 2Misc 1Journal 30Unranked 6

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