Citation Context

...tions or type inference, particularly for legacy code. Combining dynamic atomicity checking with other static checkers for multithreaded code, such as the Calvin-R tool developed by Freund and Qadeer =-=[26]-=-, would yield similar benefits. The presentation of our results proceeds as follows. Section 2 introduces a model of concurrent programs that we use as the basis for our development. Section 3 describ...

Citation Context

...orld programs that use locks. In recent years, a number of techniques have been proposed and applied to check atomicity properties. Such techniques include dynamic analysis [48, 21, 49], type systems =-=[32, 23, 24]-=-, and modelchecking [28, 18]. A problem with type based atomicity checking is that it requires the programmer to write complex annotations that involve the specification of which lock protects which v...

Citation Context

... developed a type system leveraging the ideas of reduction and transactions to verify atomicity in multithreaded programs [15, 14]. Their type system was inspired by the Calvin-R static checking tool =-=[16]-=-. Calvin-R supports modular verification of multithreaded programs by annotating each procedure with a specification; this specification is related to the procedure implementation via an abstraction r...

Citation Context

..., requires prior specific permission and/or a fee. TLDI’05, January 10, 2005, Long Beach, California, USA. Copyright 2005 ACM 1-58113-999-3/05/0001 ...$5.00 dynamic analysis [11, 38], theorem proving =-=[18]-=-, and model checking [22]. The type-based approach seems particularly promising, since it avoids both the test coverage limitations of dynamic analyses and the scalability limitations of some other an...

Citation Context

...ese approaches are different from ours in that (i) they are limited to simple synchronization disciplines and (ii) can only reason about commutativity of accesses that are not simultaneously enabled. =-=[13]-=- addresses the first issue by using auxiliary variables and access predicates to enable wider application of reduction. In addition to regular locking primitives, [23] applies mover-analysis to non-bl...

Citation Context

...tly synchronized programs should satisfy this requirement. Over the past year, a number of tools have been developed for verifying this atomicity requirement, using techniques such as theorem proving =-=[11], -=-static typing systems [9, 10], dynamic analysis [8, 23], and model checking [13]. All these approaches are based on reduction, either Lipton’s theory of reduction [16] or partial order reduction [21...

Citation Context

...thodology used by the tools was never formalized enough to allow a soundness proof. Method specifications in our methodology pertain only to the pre-state and post-state of method calls. Some systems =-=[7, 8]-=- additionally support specification and verification of the atomic transactions performed during a method call. We focus on verification of object invariants, which does not require such specification...