Abstract
In this paper we present a use of abstract interpretation techniques for reducing synchronization overhead in an object calculus. First we present the new raconcς calculus, an extension of an already existing calculus for supporting reentrant locks. Then we use an abstract form of this calculus to check when synchronization operations may be safely eliminated from statements. Thus our approach may be used to improve performance in object oriented languages by eliminating locks, without the risks caused by "manual" optimizations performed by programmers.
Get full access to this article
View all access options for this article.