Vadim Ryvchin
Vadim Ryvchin
Unknown affiliation
Verified email at tx.technion.ac.il - Homepage
Title
Cited by
Cited by
Year
Faster extraction of high-level minimal unsatisfiable cores
V Ryvchin, O Strichman
International Conference on Theory and Applications of Satisfiability …, 2011
602011
Chronological backtracking
A Nadel, V Ryvchin
International Conference on Theory and Applications of Satisfiability …, 2018
542018
Efficient SAT solving under assumptions
A Nadel, V Ryvchin
International Conference on Theory and Applications of Satisfiability …, 2012
542012
Efficient MUS extraction with resolution
A Nadel, V Ryvchin, O Strichman
2013 Formal Methods in Computer-Aided Design, 197-200, 2013
422013
Local restarts
V Ryvchin, O Strichman
International Conference on Theory and Applications of Satisfiability …, 2008
412008
Ultimately incremental SAT
A Nadel, V Ryvchin, O Strichman
International Conference on Theory and Applications of Satisfiability …, 2014
322014
Bit-vector optimization
A Nadel, V Ryvchin
International Conference on Tools and Algorithms for the Construction and …, 2016
282016
Accelerated deletion-based extraction of minimal unsatisfiable cores
A Nadel, V Ryvchin, O Strichman
Journal on Satisfiability, Boolean Modeling and Computation 9 (1), 27-51, 2014
272014
Maple lcm dist chronobt: Featuring chronological backtracking
V Ryvchin, A Nadel
Proceedings of SAT competition 2018, 2018
242018
Efficient generation of small interpolants in CNF
Y Vizel, A Nadel, V Ryvchin
Formal Methods in System Design 47 (1), 51-74, 2015
202015
Preprocessing in incremental SAT
A Nadel, V Ryvchin, O Strichman
International Conference on Theory and Applications of Satisfiability …, 2012
152012
Designers work less with quality formal equivalence checking
O Cohen, M Gordon, M Lifshits, A Nadel, V Ryvchin
Design and Verification Conference (DVCon), 2010
152010
Assignment stack shrinking
A Nadel, V Ryvchin
International Conference on Theory and Applications of Satisfiability …, 2010
142010
Local restarts in SAT
V Ryvchin, O Strichman
Constraint Programming Letters (CPL) 4, 3-13, 2008
62008
Maple LCM dist ChronoBT: featuring chronological backtracking
A Nadel, V Ryvchin
Proc. of SAT Competition, 29, 2018
52018
Mining backbone literals in incremental SAT
A Ivrii, V Ryvchin, O Strichman
International Conference on Theory and Applications of Satisfiability …, 2015
32015
Hints Revealed
J Kalechstain, V Ryvchin, N Dershowitz
International Conference on Theory and Applications of Satisfiability …, 2015
22015
Core algorithms for SAT and SAT-related problems
V Ryvchin
Technion-Israel Institute of Technology, Faculty of Industrial and …, 2014
12014
Local Search with a SAT Oracle for Combinatorial Optimization.
A Cohen, A Nadel, V Ryvchin
TACAS (2), 87-104, 2021
2021
Using Hints to Speed-Up SAT
J Kalechstain, V Ryvchin, N Dershowitz
The system can't perform the operation now. Try again later.
Articles 1–20