We propose a new approach for reasoning about concurrency in object-oriented programs. Central to our approach is static ownership inference analysis — we conjecture that this a...
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
Abstract. The conjectures of Deligne, Beilinson, and Bloch-Kato assert that there should be relations between the arithmetic of algebrogeometric objects and the special values of t...
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Normative study of probability-agreeing orderings of propositions, much of it rooted in a false but evocative conjecture of Bruno de Finetti, has typically sought to credal ration...