Testing atomicity of composed concurrent operations

Shacham, Ohad; Bronson, Nathan; Aiken, Alex; Sagiv, Mooly; Vechev, Martin; Yahav, Eran

doi:10.1145/2048066.2048073

Cited by 69 publications

(35 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…New formal verification methods applied to even mature real-world multi-threaded programs often find numerous programming errors [26], [27]. In comparison, multi-process programs cannot have these memory consistency errors.…”

Section: Discussionmentioning

confidence: 99%

Robust and efficient communication for real-time multi-process robot software

Dantam

Stilman

2012

2012 12th IEEE-RAS International Conference on Humanoid Robots (Humanoids 2012)

View full text Add to dashboard Cite

We present a new Interprocess Communication (IPC) mechanism and library. Ach is uniquely suited for coordinating drivers, controllers, and algorithms in complex robotic systems such as humanoid robots. Ach eliminates the Head-of-Line Blocking problem for applications that always require access to the newest message. Ach is efficient, robust, and formally verified. It has been tested and demonstrated on a variety of physical robotic systems, and we discuss the implementation on our humanoid robot Golem Krang. Finally, the source code for Ach is available under an Open Source permissive license.

show abstract

Section: Discussionmentioning

confidence: 99%

Robust and efficient communication for real-time multi-process robot software

Dantam

Stilman

2012

2012 12th IEEE-RAS International Conference on Humanoid Robots (Humanoids 2012)

View full text Add to dashboard Cite

show abstract

“…If an access point pt touched by the action e was not active, it is made active. 16 In the algorithm, the set active(o) grows continuously. To reduce its size, several optimizations are possible.…”

Section: Our Approachmentioning

confidence: 99%

“…We believe that our work serves as a motivation to further provide such commutativity specifications. The work of Shacham et al [16] found a number of incorrect usages of concurrent objects. They use a procedure which only generates inputs where the operations do not commute and then (bounded) model checks the space of interleavings for that input.…”

Section: Related Workmentioning

confidence: 99%

Commutativity race detection

et al. 2014

Self Cite

View full text Add to dashboard Cite

This paper introduces the concept of a commutativity race. A commutativity race occurs in a given execution when two library method invocations can happen concurrently yet they do not commute. Commutativity races are an elegant concept enabling reasoning about concurrent interaction at the library interface.We present a dynamic commutativity race detector. Our technique is based on a novel combination of vector clocks and a structural representation automatically obtained from a commutativity specification. Conceptually, our work can be seen as generalizing classical read-write race detection.We also present a new logical fragment for specifying commutativity conditions. This fragment is expressive, yet guarantees a constant number of comparisons per method invocation rather than linear with unrestricted specifications.We implemented our analyzer and evaluated it on real-world applications. Experimental results indicate that our analysis is practical: it discovered harmful commutativity races with overhead comparable to state-of-the-art, low-level race detectors.

show abstract

“…Many model checking exploration techniques have been developed that seek to achieve high coverage of executions in a scalable way [13]-such as partial-order reduction [5,7], symmetry reduction [8], preemption bounding [19], fair stateless model checking [20], and commutativity guided scheduling [25]. These techniques do not directly help to efficiently examine interesting and potentially-problematic interleaving scenarios.…”

Section: Benchmarkmentioning

confidence: 99%

Concurrit

Elmas

Burnim

Necula

et al. 2013

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

We present CONCURRIT, a domain-specific language (DSL) for reproducing concurrency bugs. Given some partial information about the nature of a bug in an application, a programmer can write a CONCURRIT script to formally and concisely specify a set of thread schedules to explore in order to find a schedule exhibiting the bug. Further, the programmer can specify how these thread schedules should be searched to find a schedule that reproduces the bug. We implemented CONCURRIT as an embedded DSL in C++, which uses manual or automatic source instrumentation to partially control the scheduling of the software under test. Using CONCURRIT, we were able to write concise tests to reproduce concurrency bugs in a variety of benchmarks, including the Mozilla's SpiderMonkey JavaScript engine, Memcached, Apache's HTTP server, and MySQL.

show abstract

Testing atomicity of composed concurrent operations

Cited by 69 publications

References 19 publications

Robust and efficient communication for real-time multi-process robot software

Robust and efficient communication for real-time multi-process robot software

Commutativity race detection

Concurrit

Contact Info

Product

Resources

About