Bipolar Proof Nets for MALL

In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious refinement of Classical Logic. Moreover, we set a correspon- dence between this paradigm and those more pragmatic ones inspired to transactional or distributed systems. In particular we show that the construction of additive proof nets can be interpreted as a model for super-ACID (or co-operative) transactions over distributed transactional systems (typi- cally, multi-databases).Comment: Proceedings of the "Proof, Computation, Complexity" International Workshop, 17-18 August 2012, University of Copenhagen, Denmar

Towards Efficient Abstractions for Concurrent Consensus

Consensus is an often occurring problem in concurrent and distributed programming. We present a programming language with simple semantics and build-in support for consensus in the form of communicating transactions. We motivate the need for such a construct with a characteristic example of generalized consensus which can be naturally encoded in our language. We then focus on the challenges in achieving an implementation that can efficiently run such programs. We setup an architecture to evaluate different implementation alternatives and use it to experimentally evaluate runtime heuristics. This is the basis for a research project on realistic programming language support for consensus.Comment: 15 pages, 5 figures, symposium: TFP 201

Model-Based Proactive Read-Validation in Transaction Processing Systems

Concurrency control protocols based on read-validation schemes allow transactions which are doomed to abort to still run until a subsequent validation check reveals them as invalid. These late aborts do not favor the reduction of wasted computation and can penalize performance. To counteract this problem, we present an analytical model that predicts the abort probability of transactions handled via read-validation schemes. Our goal is to determine what are the suited points-along a transaction lifetime-to carry out a validation check. This may lead to early aborting doomed transactions, thus saving CPU time. We show how to exploit the abort probability predictions returned by the model in combination with a threshold-based scheme to trigger read-validations. We also show how this approach can definitely improve performance-leading up to 14 % better turnaround-as demonstrated by some experiments carried out with a port of the TPC-C benchmark to Software Transactional Memory

Why Everettians Should Appreciate the Transactional Interpretation

The attractive feature of the Everett approach is its admirable spirit of approaching the quantum puzzle with a Zen-like "beginner’s mind" in order to try to envision what the pure formalism might be saying about quantum reality, even if that journey leads to a strange place. It is argued that the transactional interpretation of quantum mechanics (TI), appropriately interpreted, shares the same motivation and achieves much more, with far fewer conceptual perplexities, by taking into account heretofore overlooked features of the quantum formalism itself (i.e. advanced states). In particular, TI does not need to talk about brain states, consciousness, or observers (rational or otherwise). In its possibilist variant (“PTI”), it shares the realist virtues of treating state vector branches as genuine dynamical entities, without having to explain how or why all of their associated outcomes actually happen (they don’t), how to account for a plenitude of counterpart observers in some coherent notion of trans-temporal identity of the bifurcating observers (observers don’t bifurcate in TI), nor how the certainty of all outcomes could be consistent with any coherent theory of probability, let alone the Born probability (the Born probability emerges naturally in TI). In short, TI is precisely the one-world interpretation Kent is looking for in his (2010)