Roman Gershman

According to our database, Roman Gershman authored at least 5 papers between 2005 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

HaifaSat: a SAT solver based on an Abstraction/Refinement model.

Roman Gershman, Ofer Strichman

J. Satisf. Boolean Model. Comput., 2009

2008

An approach for extracting a small unsatisfiable core.

Roman Gershman, Maya Koifman, Ofer Strichman

Formal Methods Syst. Des., 2008

2006

Deriving Small Unsatisfiable Cores with Dominators.

Roman Gershman, Maya Koifman, Ofer Strichman

Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005

Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas.

Roman Gershman, Ofer Strichman

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

HaifaSat: A New Robust SAT Solver.

Roman Gershman, Ofer Strichman

Proceedings of the Hardware and Software Verification and Testing, 2005