Complexity Analysis of Tree Share Structure

by   Xuan-Bach Le, et al.

The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical study. We show that the first-order theory of the full Boolean algebra of tree shares (that is, with all tree-share constants) is decidable and has the same complexity as of the first-order theory of Countable Atomless Boolean Algebras. We prove that combining this additive structure with a constant-restricted unary multiplicative "relativization" operator has a non-elementary lower bound. We examine the consequences of this lower bound and prove that it comes from the combination of both theories by proving an upper bound on a generalization of the restricted multiplicative theory in isolation.



There are no comments yet.


page 1

page 2

page 3

page 4


Parity Decision Tree Complexity is Greater Than Granularity

We prove a new lower bound on the parity decision tree complexity D_⊕(f)...

A Tight Lower Bound for Uniformly Stable Algorithms

Leveraging algorithmic stability to derive sharp generalization bounds i...

On the read-once property of branching programs and CNFs of bounded treewidth

In this paper we prove a space lower bound of n^Ω(k) for non-determinist...

Lower bound for monotone Boolean convolution

Any monotone Boolean circuit computing the n-dimensional Boolean convolu...

One-way communication complexity and non-adaptive decision trees

We study the relationship between various one-way communication complexi...

Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function

In this paper, we prove that a degree d Boolean function depends on at m...

Additive Sparsification of CSPs

Multiplicative cut sparsifiers, introduced by Benczúr and Karger [STOC'9...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.