Citation Context

...ally focused on appropriately guided search over the syntax tree of the synthesized program. Search techniques have also been applied to automatically derived concurrent garbage collection algorithms =-=[VYBR07]-=-. In contrast, our synthesis uses the mathematical structure of a decidable theory to explore the space of all functions that satisfy the specification. This enables our approach to achieve completene...

Citation Context

...arlier work [23] the authors apply an automated transformational-style space exploration to derive provably correct variants from a basic (correct) concurrent GC implementation. In a more recent work =-=[24]-=- an exhaustive exploration procedure is applied to a space of implementationstion variants with varying degrees of atomicity and instruction reordering, and combined with effective pruning of vacuousl...

Citation Context

...lude Tolerace [19] which creates local copies of variables to detect and recover from races, and ISOLATOR [21] which can recover from violations of isolation. Search-based Synthesis: In previous work =-=[28, 29]-=-, we used a semi-automated approach for exploring a space concurrent garbage collectors and linearizable data-structures. The work used a search procedure and an abstraction specifically geared toward...

Citation Context

...eleted nodes.The block R1 is a parametric block. algorithms that only use CAS, rather than DCAS as the best nullbased algorithm does. From our previous study on another class of concurrent algorithms =-=[29]-=-, we know that it is possible to trade-off space for synchronization. That is, introducing more space may allows us to reduce the required synchronization. To that end, we introduce a separate marked ...

Citation Context

...valuating it on various challenging state-of-the-art concurrent algorithms. The work presented here is a small sample from our wider work on synthesis of synchronization in concurrent programs (e.g., =-=[32, 34, 33, 35, 24]-=-). In the future, we plan to extend our techniques to handle infinite-state programs (e.g., heap-manipulating programs) running on relaxed memory models. Acknowledgements Eran Yahav is a Deloro Fellow...

Citation Context

...y models. The approach of [38] is close to our work in spirit, and deals with inferring synchronization under abstraction, but it enumerates traces explicitly, which does not scale to our setting. In =-=[37, 39]-=-, inference of synchronization is performed by syntactic exploration of placements of atomic sections to create candidate algorithms, and using a backing verifier to attempt verification of each candi...

Citation Context

...aker property than correctness, though, and these techniques don’t obviously extend to mark-sweep collection. We borrow ideas from typed regions to help us verify our copying collector. Vechev et al. =-=[26]-=- describe how to mechanically fit prefabricated, high-level garbage collection building blocks together in a provably correct way, but they do not mechanically verify the building blocks themselves. 3...

Citation Context

...ecent work in the eld is designed for synthesis within in a speci c domain of algorithms (e.g. [8]). Notable in this context is the work on synthesis of concurrent garbage collectors by Vechev et al. =-=[66,67]-=- In their earlier work [66], the authors apply an automated transformation-based space exploration to derive provably correct variants from a basic (correct) concurrent GC implementation. In a more re...