Dynamically checking ownership policies in concurrent c/c++ programs

Martin, Jean-Phillipe; Hicks, Michael; Costa, Manuel; Akritidis, Periklis; Castro, Miguel

doi:10.1145/1706299.1706351

Cited by 12 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another study uses similar concepts to verify programmer-specified ownership policies [27], but that analysis is more restricted in its ability to reason about aliasing and function calls, and it requires programmers to specify when a thread has exclusive access to memory locations, rather than inferring it. Raman et al developed a race condition algorithm for the very different context of structured parallelism, as in Cilk or X10 [33].…”

Section: Related Workmentioning

confidence: 99%

RedCard: Redundant Check Elimination for Dynamic Race Detectors

Flanagan

Freund

2013

ECOOP 2013 – Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. Precise dynamic race detectors report an error if and only if an observed program trace exhibits a data race. They must typically check for races on all memory accesses to ensure that they catch all races and generate no spurious warnings. However, a race check for a particular memory access is guaranteed to be redundant if the accessing thread has already accessed that location within the same release-free span. A release-free span is any sequence of instructions containing no lock releases or other "release-like" synchronization operations, such as wait or fork.We present a static analysis to identify redundant race checks by reasoning about memory accesses within release-free spans. In contrast to prior whole program analyses for identifying accesses that are always race-free, our redundant check analysis is span-local and can also be made method-local without any major loss in effectiveness. RedCard, our prototype implementation for the Java language, enables dynamic race detectors to reduce the number of run-time checks by close to 40% with no loss in precision.We also present a complementary shadow proxy analysis for identifying when multiple memory locations can be treated as a single location by a dynamic race detector, again with no loss in precision. Combined, our analyses reduce the number of memory accesses requiring checks by roughly 50%.

show abstract

Section: Related Workmentioning

confidence: 99%

RedCard: Redundant Check Elimination for Dynamic Race Detectors

Flanagan

Freund

2013

ECOOP 2013 – Object-Oriented Programming

View full text Add to dashboard Cite

show abstract

“…An approach to transferring permissions that is similar to our approach for transferring modes using the annotations acq and rel are the inhale and exhale commands in Chalice [53]. The closest form of assumption to those used in the present paper are the thread-level exclusive ownership (nobody else will read or write) and read ownership policies used in recent work of Martin et al [54]. Ownership is acquired and released via annotations.…”

Section: Related Workmentioning

confidence: 99%

Assumptions and Guarantees for Compositional Noninterference

Mantel

Sands

Sudbrock

2011

2011 IEEE 24th Computer Security Foundations Symposium

View full text Add to dashboard Cite

Abstract-The idea of building secure systems by plugging together "secure" components is appealing, but this requires a definition of security which, in addition to taking care of toplevel security goals, is strengthened appropriately in order to be compositional. This approach has been previously studied for information-flow security of shared-variable concurrent programs, but the price for compositionality is very high: a thread must be extremely pessimistic about what an environment might do with shared resources. This pessimism leads to many intuitively secure threads being labelled as insecure.Since in practice it is only meaningful to compose threads which follow an agreed protocol for data access, we take advantage of this to develop a more liberal compositional security condition. The idea is to give the security definition access to the intended pattern of data usage, as expressed by assumption-guarantee style conditions associated with each thread. We illustrate the improved precision by developing the first flow-sensitive security type system that provably enforces a noninterference-like property for concurrent programs.

show abstract

“…In the OO setting, regions are closely related to ownership types which use the class hierarchy of the program to separate the heap into disjoint, nested regions [9,29]. In addition to isolation, ownership types can be used to track effects [8], and to reason about data races and deadlocks [6,4,22]. Such techniques can be used to enforce determinism [30], but regions and ownership relations are not enough to enforce finegrained separation.…”

Section: Related Workmentioning

confidence: 99%

Deterministic parallelism via liquid effects

KawaguchiMing¹,

RondonPatrick²,

BakstAlexander³

et al. 2012

SIGPLAN Not.

View full text Add to dashboard Cite

Shared memory multithreading is a popular approach to parallel programming, but also fiendishly hard to get right. We present Liquid Effects, a type-and-effect system based on refinement types which allows for fine-grained, low-level, shared memory multithreading while statically guaranteeing that a program is deterministic. Liquid Effects records the effect of an expression as a formula in first-order logic, making our type-and-effect system highly expressive. Further, effects like Read and Write are recorded in Liquid Effects as ordinary uninterpreted predicates, leaving the effect system open to extension by the user. By building our system as an extension to an existing dependent refinement type system, our system gains precise value-and branch-sensitive reasoning about effects. Finally, our system exploits the Liquid Types refinement type inference technique to automatically infer refinement types and effects. We have implemented our type-and-effect checking techniques in CSOLVE, a refinement type inference system for C programs. We demonstrate how CSOLVE uses Liquid Effects to prove the determinism of a variety of benchmarks.

show abstract

Dynamically checking ownership policies in concurrent c/c++ programs

Cited by 12 publications

References 18 publications

RedCard: Redundant Check Elimination for Dynamic Race Detectors

RedCard: Redundant Check Elimination for Dynamic Race Detectors

Assumptions and Guarantees for Compositional Noninterference

Deterministic parallelism via liquid effects

Contact Info

Product

Resources

About