# Benny Godlin

According to our database

Collaborative distances:

^{1}, Benny Godlin authored at least 14 papers between 2005 and 2013.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2013

Regression verification: proving the equivalence of similar programs.

Softw. Test., Verif. Reliab., 2013

2012

Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas.

J. Log. Comput., 2012

2010

An extension of the bivariate chromatic polynomial.

Eur. J. Comb., 2010

Inference Rules for Proving the Equivalence of Recursive Procedures.

Proceedings of the Time for Verification, 2010

2009

Cross-Entropy-Based Replay of Concurrent Programs.

Proceedings of the Fundamental Approaches to Software Engineering, 2009

Regression verification.

Proceedings of the 46th Design Automation Conference, 2009

2008

Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas

CoRR, 2008

Inference rules for proving the equivalence of recursive procedures.

Acta Inf., 2008

Evaluations of Graph Polynomials.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

A Most General Edge Elimination Polynomial.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007

Cross-Entropy Based Testing.

Proceedings of the Formal Methods in Computer-Aided Design, 7th International Conference, 2007

2006

Computing Graph Polynomials on Graphs of Bounded Clique-Width.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Formal verification of concurrent software: two case studies.

Proceedings of the 4th Workshop on Parallel and Distributed Systems: Testing, 2006

2005

Regression Verification - A Practical Way to Verify Programs.

Proceedings of the Verified Software: Theories, 2005