| 2009 |
|---|
| 9 | EE | Hana Chockler,
Eitan Farchi,
Benny Godlin,
Sergey Novikov:
Cross-Entropy-Based Replay of Concurrent Programs.
FASE 2009: 201-215 |
| 2008 |
|---|
| 8 | EE | Benny Godlin,
Tomer Kotek,
Johann A. Makowsky:
Evaluations of Graph Polynomials.
WG 2008: 183-194 |
| 7 | EE | Ilya Averbouch,
Benny Godlin,
Johann A. Makowsky:
A Most General Edge Elimination Polynomial.
WG 2008: 31-42 |
| 6 | EE | Benny Godlin,
Ofer Strichman:
Inference rules for proving the equivalence of recursive procedures.
Acta Inf. 45(6): 403-439 (2008) |
| 5 | EE | Benny Godlin,
Emilia Katz,
Johann A. Makowsky:
Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas
CoRR abs/0812.1364: (2008) |
| 2007 |
|---|
| 4 | EE | Hana Chockler,
Eitan Farchi,
Benny Godlin,
Sergey Novikov:
Cross-Entropy Based Testing.
FMCAD 2007: 101-108 |
| 2006 |
|---|
| 3 | EE | Hana Chockler,
Eitan Farchi,
Ziv Glazberg,
Benny Godlin,
Yarden Nir-Buchbinder,
Ishai Rabinovitz:
Formal verification of concurrent software: two case studies.
PADTAD 2006: 11-22 |
| 2 | EE | Johann A. Makowsky,
Udi Rotics,
Ilya Averbouch,
Benny Godlin:
Computing Graph Polynomials on Graphs of Bounded Clique-Width.
WG 2006: 191-204 |
| 2005 |
|---|
| 1 | EE | Ofer Strichman,
Benny Godlin:
Regression Verification - A Practical Way to Verify Programs.
VSTTE 2005: 496-501 |
