Might be a little late, but I was in the same situation like you and ended up creating my own library for exactly your use-case. Since I was forced to come up with a solution myself, I decided to release it on Github, to spare others the hard work. You can find it here: https://github.com/SQiShER/java-object-diff

--- Edit ---

Here is a little usage example based on the OPs code:

SomeClass a = new SomeClass();
SomeClass b = new SomeClass();

a.setProp1("A");
a.setProp2("X");

b.setProp1("B");
b.setProp2("X");

DiffNode diff = ObjectDifferBuilder.buildDefault().compare(a, b);

assert diff.hasChanges();
assert diff.childCount() == 1;
assert diff.getChild('prop1').getState() == DiffNode.State.CHANGED;

I created a library for that: https://github.com/SQiShER/java-object-diff

It builds a tree structure of your compared objects and allows you to traverse the nodes via visitor pattern. Take a look at the Getting Started page, to see some examples. It works with almost any kind of object and can handle as many nesting levels as you like. I even managed to build an automatic object merger based on it.

A printed version of such an object graph looks like this:

Property at path '/contacts/item[Walter White]/middleName' has been added => [ Hartwell ]
Property at path '/contacts/item[Jesse Pinkman]/middleName' has been added => [ Bruce ]

I'm using it myself and it works like a charm. Hope it helps!

I don't know how complex your objects are, but doing it manually via reflection gets out of hand rather quickly. Especially when Maps and Collections get involved.