Lock inference for Java

This thesis explores the technique of lock inference, which infers a set of locks that attempt to balance the requirements of maximal concurrency, minimal locking overhead and freedom from deadlock, and focuses on lock inference techniques for tackling large Java programs making use of mature libraries.