Regression Verification - A Practical Way to Verify Programs. - Ofer Strichman; Benny Godlin (VSTTE, 2005)

Formal verification of concurrent software: two case studies. - Hana Chockler; Eitan Farchi; Ziv Glazberg; Benny Godlin; Yarden Nir-Buchbinder; Ishai Rabinovitz (PADTAD, 2006)

Computing Graph Polynomials on Graphs of Bounded Clique-Width. - Johann A. Makowsky; Udi Rotics; Ilya Averbouch; Benny Godlin (WG, 2006)

Cross-Entropy Based Testing. - Hana Chockler; Eitan Farchi; Benny Godlin; Sergey Novikov (FMCAD, 2007)

A Most General Edge Elimination Polynomial. - Ilya Averbouch; Benny Godlin; Johann A. Makowsky (WG, 2008)

Evaluations of Graph Polynomials. - Benny Godlin; Tomer Kotek; Johann A. Makowsky (WG, 2008)

Inference rules for proving the equivalence of recursive procedures. - Benny Godlin; Ofer Strichman (Acta Informatica, 2008)

Regression verification. - Benny Godlin; Ofer Strichman (DAC, 2009)

Cross-Entropy-Based Replay of Concurrent Programs. - Hana Chockler; Eitan Farchi; Benny Godlin; Sergey Novikov (FASE, 2009)

An extension of the bivariate chromatic polynomial. - Ilya Averbouch; Benny Godlin; Johann A. Makowsky (Eur. J. Comb., 2010)

Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas. - Benny Godlin; Emilia Katz; Johann A. Makowsky (J. Log. Comput., 2012)

Regression verification: proving the equivalence of similar programs. - Benny Godlin; Ofer Strichman (Softw. Test. Verification Reliab., 2013)