The temporal logic Sugar I Beer, S Ben-David, C Eisner, D Fisman, A Gringauze, Y Rodeh Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001 | 223 | 2001 |
Efficient detection of vacuity in ACTL formulas I Beer, S Ben-David, C Eisner, Y Rodeh Computer Aided Verification: 9th International Conference, CAV'97 Haifa …, 1997 | 186 | 1997 |
Efficient detection of vacuity in temporal model checking I Beer, S Ben-David, C Eisner, Y Rodeh Formal Methods in System Design 18, 141-163, 2001 | 135 | 2001 |
Deciding equality formulas by small domains instantiations A Pnueli, Y Rodeh, O Shtrichman, M Siegel Computer Aided Verification: 11th International Conference, CAV’99 Trento …, 1999 | 123 | 1999 |
The small model property: How small can it be? A Pnueli, Y Rodeh, O Strichman, M Siegel Information and computation 178 (1), 279-293, 2002 | 92 | 2002 |
RuleBase: Model checking at IBM I Beer, S Ben-David, C Eisner, D Geist, L Gluhovsky, T Heyman, ... Computer Aided Verification: 9th International Conference, CAV'97 Haifa …, 1997 | 68 | 1997 |
Labeling schemes for dynamic tree networks A Korman, D Peleg, Y Rodeh Theory of Computing Systems 37, 49-75, 2004 | 64 | 2004 |
Method and system for reducing state space variables prior to symbolic model checking I Beer, C Eisner, Y Rodeh US Patent 6,192,505, 2001 | 33 | 2001 |
Searching for counter-examples intelligently Y Rodeh US Patent 6,587,998, 2003 | 31 | 2003 |
Fast rendezvous on a cycle by agents with different speeds O Feinerman, A Korman, S Kutten, Y Rodeh International Conference on Distributed Computing and Networking, 1-13, 2014 | 22 | 2014 |
Finite instantiations in equivalence logic with uninterpreted functions Y Rodeh, O Shtrichman Computer Aided Verification: 13th International Conference, CAV 2001 Paris …, 2001 | 22 | 2001 |
Ant collective cognition allows for efficient navigation through disordered environments A Gelblum, E Fonio, Y Rodeh, A Korman, O Feinerman Elife 9, e55195, 2020 | 19 | 2020 |
Constructing labeling schemes through universal matrices A Korman, D Peleg, Y Rodeh Algorithmica 57 (4), 641-652, 2010 | 19 | 2010 |
Searching Trees with Permanently Noisy Advice: Walking and Query Algorithms L Boczkowski, U Feige, A Korman, Y Rodeh arXiv preprint arXiv:1611.01403, 2016 | 18 | 2016 |
Parallel exhaustive search without coordination P Fraigniaud, A Korman, Y Rodeh Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 12 | 2016 |
Building small equality graphs for deciding equality logic with uninterpreted functions Y Rodeh, O Strichman Information and Computation 204 (1), 26-59, 2006 | 11 | 2006 |
Navigating in trees with permanently noisy advice L Boczkowski, U Feige, A Korman, Y Rodeh ACM Transactions on Algorithms (TALG) 17 (2), 1-27, 2021 | 10 | 2021 |
Constructing labeling schemes through universal matrices A Korman, D Peleg, Y Rodeh International Symposium on Algorithms and Computation, 409-418, 2006 | 10 | 2006 |
The ROBDD size of simple CNF formulas M Langberg, A Pnueli, Y Rodeh Correct Hardware Design and Verification Methods: 12th IFIP WG 10.5 Advanced …, 2003 | 8 | 2003 |
Fast rendezvous on a cycle by agents with different speeds O Feinerman, A Korman, S Kutten, Y Rodeh Theoretical Computer Science 688, 77-85, 2017 | 7 | 2017 |