5,041 research outputs found
Efficient Black-box Checking of Snapshot Isolation in Databases
Snapshot isolation (SI) is a prevalent weak isolation level that avoids the
performance penalty imposed by serializability and simultaneously prevents
various undesired data anomalies. Nevertheless, SI anomalies have recently been
found in production cloud databases that claim to provide the SI guarantee.
Given the complex and often unavailable internals of such databases, a
black-box SI checker is highly desirable.
In this paper we present PolySI, a novel black-box checker that efficiently
checks SI and provides understandable counterexamples upon detecting
violations. PolySI builds on a novel characterization of SI using generalized
polygraphs (GPs), for which we establish its soundness and completeness. PolySI
employs an SMT solver and also accelerates SMT solving by utilizing the compact
constraint encoding of GPs and domain-specific optimizations for pruning
constraints. As demonstrated by our extensive assessment, PolySI successfully
reproduces all of 2477 known SI anomalies, detects novel SI violations in three
production cloud databases, identifies their causes, outperforms the
state-of-the-art black-box checkers under a wide range of workloads, and can
scale up to large-sized workloads.Comment: 20 pages, 15 figures, accepted by PVLD
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. The lack of formalization of the Internet architecture meant limited
abstractions and modularity, especially for the control and management planes,
thus requiring for every new need a new protocol built from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
The power of quantum systems on a line
We study the computational strength of quantum particles (each of finite
dimensionality) arranged on a line. First, we prove that it is possible to
perform universal adiabatic quantum computation using a one-dimensional quantum
system (with 9 states per particle). This might have practical implications for
experimentalists interested in constructing an adiabatic quantum computer.
Building on the same construction, but with some additional technical effort
and 12 states per particle, we show that the problem of approximating the
ground state energy of a system composed of a line of quantum particles is
QMA-complete; QMA is a quantum analogue of NP. This is in striking contrast to
the fact that the analogous classical problem, namely, one-dimensional
MAX-2-SAT with nearest neighbor constraints, is in P. The proof of the
QMA-completeness result requires an additional idea beyond the usual techniques
in the area: Not all illegal configurations can be ruled out by local checks,
so instead we rule out such illegal configurations because they would, in the
future, evolve into a state which can be seen locally to be illegal. Our
construction implies (assuming the quantum Church-Turing thesis and that
quantum computers cannot efficiently solve QMA-complete problems) that there
are one-dimensional systems which take an exponential time to relax to their
ground states at any temperature, making them candidates for being
one-dimensional spin glasses.Comment: 21 pages. v2 has numerous corrections and clarifications, and most
importantly a new author, merged from arXiv:0705.4067. v3 is the published
version, with additional clarifications, publisher's version available at
http://www.springerlink.co
A recommender system for process discovery
Over the last decade, several algorithms for process discovery and process conformance have been proposed. Still, it is well-accepted that there is no dominant algorithm in any of these two disciplines, and then it is often difficult to apply them successfully. Most of these algorithms need a close-to expert knowledge in order to be applied satisfactorily. In this paper, we present a recommender system that uses portfolio-based algorithm selection strategies to face the following problems: to find the best discovery algorithm for the data at hand, and to allow bridging the gap between general users and process mining algorithms. Experiments performed with the developed tool witness the usefulness of the approach for a variety of instances.Peer ReviewedPostprint (author’s final draft
- …