English
Related papers

Related papers: On the Semantics of Snapshot Isolation

200 papers

Transactional memory (TM) allows concurrent processes to organize sequences of operations on shared \emph{data items} into atomic transactions. A transaction may commit, in which case it appears to have executed sequentially or it may…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-16 Petr Kuznetsov , Srivatsan Ravi

Differential privacy is a useful tool to build machine learning models which do not release too much information about the training data. We study the R\'enyi differential privacy of stochastic gradient descent when each training example is…

Machine Learning · Computer Science 2020-02-18 Eloïse Berthier , Sai Praneeth Karimireddy

Transactional memory allows the user to declare sequences of instructions as speculative \emph{transactions} that can either \emph{commit} or \emph{abort}. If a transaction commits, it appears to be executed sequentially, so that the…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-04-11 Hagit Attiya , Sandeep Hans , Petr Kuznetsov , Srivatsan Ravi

Communicating transactions is a form of distributed, non-isolated transactions which provides a simple construct for building concurrent systems. In this paper we develop a logical framework to express properties of the observable behaviour…

Logic in Computer Science · Computer Science 2018-01-15 Vasileios Koutavas , Maciej Gazda , Matthew Hennessy

While a number of weak consistency mechanisms have been developed in recent years to improve performance and ensure availability in distributed, replicated systems, ensuring correctness of transactional applications running on top of such…

Programming Languages · Computer Science 2018-06-25 Kartik Nagar , Suresh Jagannathan

The wait-free read-write memory model has been characterized as an iterated \emph{Immediate Snapshot} (IS) task. The IS task is \emph{affine}---it can be defined as a (sub)set of simplices of the standard chromatic subdivision. It is known…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-10-06 Eli Gafni , Yuan He , Petr Kuznetsov , Thibault Rieutord

Transition System Specifications provide programming and specification languages with a semantics. They provide the meaning of a closed term as a process graph: a state in a labelled transition system. At the same time they provide the…

Logic in Computer Science · Computer Science 2019-08-26 Rob van Glabbeek

Modern societies have an abundance of data yet good system models are rare. Unfortunately, many of the current system identification and machine learning techniques fail to generalize outside of the training set, producing models that…

Systems and Control · Electrical Eng. & Systems 2023-11-27 Gabriel F. Machado , Morgan Jones

Logic locking is a prominent technique to protect the integrity of hardware designs throughout the integrated circuit design and fabrication flow. However, in recent years, the security of locking schemes has been thoroughly challenged by…

Cryptography and Security · Computer Science 2021-05-20 Dominik Sisejkovic , Farhad Merchant , Lennart M. Reimann , Harshit Srivastava , Ahmed Hallawa , Rainer Leupers

Sampling and quantization are standard practices in signal and image processing, but a theoretical understanding of their impact is incomplete. We consider discrete image registration when the underlying function is a one-dimensional…

Computer Vision and Pattern Recognition · Computer Science 2024-10-28 Serap A. Savari

Transactional memory promises to make concurrent programming tractable and efficient by allowing the user to assemble sequences of actions in atomic transactions with all-or-nothing semantics. It is believed that, by its very virtue,…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-10-15 Petr Kuznetsov , Sathya Peri

We propose a formal model of distributed computing based on register automata that captures a broad class of synchronous network algorithms. The local memory of each process is represented by a finite-state controller and a fixed number of…

Formal Languages and Automata Theory · Computer Science 2019-04-15 Benedikt Bollig , Patricia Bouyer , Fabian Reiter

Recoverable algorithms tolerate failures and recoveries of processes by using non-volatile memory. Of particular interest are self-implementations of key operations, in which a recoverable operation is implemented from its non-recoverable…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-08-08 Tomer Lev Lehman , Hagit Attiya , Danny Hendler

Non-orthogonal multiple access (NOMA) serves multiple users simultaneously via the same resource block by exploiting superposition coding at the transmitter and successive interference cancellation (SIC) at the receivers. Under practical…

Information Theory · Computer Science 2023-08-21 Sapna Thapar , Deepak Mishra , Derrick Wing Kwan Ng , Ravikant Saini

Transactional memory (TM) facilitates the development of concurrent applications by letting the programmer designate certain code blocks as atomic. Programmers using a TM often would like to access the same data both inside and outside…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-01-15 Artem Khyzha , Hagit Attiya , Alexey Gotsman , Noam Rinetzky

The SPARC TSO weak memory model is defined axiomatically, with a non-compositional formulation that makes modular reasoning about programs difficult. Our denotational approach uses pomsets to provide a compositional semantics capturing…

Programming Languages · Computer Science 2023-06-22 Ryan Kavanagh , Stephen Brookes

A behavioural theory consists of machine-independent postulates characterizing a particular class of algorithms or systems, an abstract machine model that provably satisfies these postulates, and a rigorous proof that any algorithm or…

Logic in Computer Science · Computer Science 2017-05-30 Flavio Ferrarotti , Klaus-Dieter Schewe , Loredana Tec , Qing Wang

Sometimes, it is of interest to single out the fluctuations associated to a given frequency. We propose a new variant of SSA, Circulant SSA (CiSSA), that allows to extract the signal associated to any frequency specified beforehand. This is…

Signal Processing · Electrical Eng. & Systems 2020-10-02 Juan Bógalo , Pilar Poncela , Eva Senra

SRAM bitcells in retention mode behave as autonomous stochastic nonlinear dynamical systems. From observation of variability-aware transient noise simulations, we provide an unidimensional model, fully characterizable by conventional…

Hardware Architecture · Computer Science 2024-02-20 Léopold Van Brandt , Denis Flandre , Jean-Charles Delvenne

Self-Sovereign Identity (SSI) is an identity model centered on the user. The user maintains and controls their data in this model. When a service provider requests data from the user, the user sends it directly to the service provider,…

Cryptography and Security · Computer Science 2022-06-22 Frederico Schardong , Ricardo Custódio
‹ Prev 1 3 4 5 6 7 10 Next ›