38 citations · 63 across the 23 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…
Learning the Boundary of Inductive Invariants
Yotam M. Y. Feldman, Mooly Sagiv, Sharon Shoham +1
We study the complexity of invariant inference and its connections to exact concept learning. We define a condition on invariants and their geometry, called the fence condition, wh…
Global Guidance for Local Generalization in Model Checking
Hari Govind V K, YuTing Chen, Sharon Shoham +1
SMT-based model checkers, especially IC3-style ones, are currently the most effective techniques for verification of infinite state systems. They infer global inductive invariants…