38 citations · 63 across the 23 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.PL2018★ 1 cited
Undecidability of Inferring Linear Integer Invariants
Sharon Shoham
We show that the problem of determining the existence of an inductive invariant in the language of quantifier free linear integer arithmetic (QFLIA) is undecidable, even for transi…
cs.DC2018
Order out of Chaos: Proving Linearizability Using Local Views
Yotam M. Y. Feldman, Constantin Enea, Adam Morrison +2
Proving the linearizability of highly concurrent data structures, such as those using optimistic concurrency control, is a challenging task. The main difficulty is in reasoning abo…