Computing Publications

Publications Home » Lock Inference in the Presence of...

Lock Inference in the Presence of Large Libraries

Khilan Gudka, Tim Harris, Susan Eisenbach

Conference or Workshop Paper
European Conference on Object-Oriented Programming
Eurepean Conference for Object-Oriented Programming
June, 2012
Abstract

Atomic sections can be implemented using lock inference. For the implementation of lock inference to be practically useful, it is crucial that large libraries be analysed. Large libraries are challenging for static analysis, due to their cyclomatic complexity.

Existing approaches either ignore libraries, require library implementers to annotate which locks to take or only consider accesses performed upto one level deep in library call chains. As a result, some accesses performed within the library may go unprotected, leading to atomicity violations that atomic sections are supposed to eliminate.

We present a lock inference approach for Java that analyses library methods in full. We achieve this by (i) formulating lock inference as an Interprocedural Distributive Environment dataflow problem, (ii) using a graph representation for summary information and (iii) applying a number of optimisations to our implementation to reduce space-time requirements. We evaluate the effects of each optimisation and show that propagating only new dataflow information gives the biggest speed up whilst also reducing memory usage. We identify and remove many locks for thread-local and internal objects via simple analyses. We demonstrate the scalability of our approach by analysing the entire GNU Classpath library comprising 122KLOC.

Keywords
Concurrency
Language Design
Distributed Software Engineering
SLURP
PDF of full publication (270 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.