25 citations · 79 across the 35 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.LO2007★ 8 cited
Space-Efficient Bounded Model Checking
Jacob Katz, Ziyad Hanna, Nachum Dershowitz
Current algorithms for bounded model checking use SAT methods for checking satisfiability of Boolean formulae. These methods suffer from the potential memory explosion problem. Met…
cs.CC2007
Complexity of Propositional Proofs under a Promise
Nachum Dershowitz, Iddo Tzameret
We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has…