In this talk, we describe the challenges of reasoning about inheritance, multithreading, modification of the shared state (so called modifies clauses), abstraction, and reentrance. We explain why separation logic is suited to tackle some of these problems, in particular the modification of shared state. We describe recent work extending separation logic to deal with abstraction, fork/join style of concurrency and locking.