We study the problem of verifying robustness concurrent programs against a C11-style memory model that includes relaxed accesses and release/acquire fences, show this verification can be reduced to standard reachability under sequential consistency. further observe existing notions do not allow use speculative reads as in sequence lock mechanism, introduce novel "observational robustness" prope...

We present an algorithm to distinguish several types of brick walls, picket fences, and hedges based on the analysis of backscattered sonar echoes. The echo data are acquired by a mobile robot with a single-transducer 50 kHz pulse-echo sonar computer-controlled scanning system packaged as its sensor head. For several locations along a wall, fence, or hedge, a fan of backscatter sonar echoes is ...

We address the problem of fence inference in infinite-state concurrent programs running on relaxed memory models such as TSO and PSO. We present a novel algorithm that can automatically synthesize the necessary fences for infinite-state programs. Our technique is based on two main ideas: (i) verification with numerical domains: we reduce verification under relaxed models to verification under s...

Work-stealing is an efficient method to implement load balancing in fine-grained task parallelism. Typically, concurrent deques are used for this purpose. A disadvantage of many concurrent deques is that they require expensive memory fences for local deque operations. In this paper, we propose a new non-blocking work-stealing deque based on the split task queue. Our design uses a dynamic split ...

The installation of fences to protect agricultural products, natural resources, or other areas from deer (Odocoileus spp.) can be expensive and potential benefits of fencing are difficult to quantify. A rational method is needed to help evaluate whether fencing can be cost-effective and which fence designs will be optimal for particular applications. We describe an interactive, dynamic simulati...