12 citations · 14 across the 9 of their papers we have counts for
4 papers · 1 filter
Proving Highly-Concurrent Traversals Correct
Yotam M. Y. Feldman, Artem Khyzha, Constantin Enea +4
Modern highly-concurrent search data structures, such as search trees, obtain multi-core scalability and performance by having operations traverse the data structure without any sy…
A Thread-Local Semantics and Efficient Static Analyses for Race Free Programs
Suvam Mukherjee, Oded Padon, Sharon Shoham +2
Data race free (DRF) programs constitute an important class of concurrent programs. In this paper we provide a framework for designing and proving the correctness of data flow anal…
Hypothetical Reasoning via Provenance Abstraction
Daniel Deutch, Yuval Moskovitch, Noam Rinetzky
Data analytics often involves hypothetical reasoning: repeatedly modifying the data and observing the induced effect on the computation result of a data-centric application. Previo…
COBRA: Compression via Abstraction of Provenance for Hypothetical Reasoning
Daniel Deutch, Yuval Moskovitch, Noam Rinetzky
Data analytics often involves hypothetical reasoning: repeatedly modifying the data and observing the induced effect on the computation result of a data-centric application. Recent…