Model checking transactional memories

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The thesis is dedicated to the study of two main partial differential equations (PDEs) in fluid dynamics: the Navier-Stokes equations, which describe the motion of incompressible fluids, and the transport equation with divergence-free velocity fields, whic ...

Enterprises collect data in large volumes and leverage them to drive numerous concurrent decisions and business processes. Their teams deploy multiple applications that often operate concurrently on the same data and infrastructure but have widely differen ...

Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...

The popular isolation level multiversion Read Committed (RC) exchanges some of the strong guarantees of serializability for increased transaction throughput. Nevertheless, transaction workloads can sometimes be executed under RC while still guaranteeing se ...

Exoskeletons intended for partial assistance of walking should be able to follow the gait pattern of their users, via online adaptive control strategies rather than imposing predefined kinetic or kinematic profiles. NeuroMuscular Controllers (NMCs) are ada ...

We introduce the first multitasking vision transformer adapters that learn generalizable task affinities which can be applied to novel tasks and domains. Integrated into an off-the-shelf vision transformer backbone, our adapters can simultaneously solve mu ...

Understanding how things break and slide is of paramount importance to describe the dynamics of a broad range of physical systems. This includes day-to-day problems such as the breaking of a glass of wine or the sliding of skis on snow, but also engineerin ...

Locomotion is based on a sophisticated interaction among the environment, the musculoskeletal system, the spinal cord, and the brain locomotor areas. Quality of life is strongly related to the proper capability of this movement. However, many pathologies, ...

The aim of this paper is to serve as a lightweight introduction to concurrency control for database theorists through a uniform presentation of the work on robustness against Multiversion Read Committed and Snapshot Isolation. ...

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ̅L ...

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

While serializability always guarantees application correctness, lower isolation levels can be chosen to improve transaction throughput at the risk of introducing certain anomalies. A set of transactions is robust against a given isolation level if every p ...

The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining the perfect isolation of ...

Modern large-scale data platforms manage colossal amount of data, generated by the ever-increasing number of concurrent users. Geo-replicated and sharded key-value data stores play a central role when building such platforms. As the strongest consistency m ...

Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and ...

Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and neve ...

We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...

Geo-replicated data platforms are at the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the ...

Model checking transactional memories

Chat with Graph Search

Anomalous dissipation and other non-smooth phenomena in fluids

Oligolithic Cross-task Optimizations across Isolated Workloads

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

When is it safe to run a transactional workload under Read Committed?

Novel Design and Implementation of a Neuromuscular Controller on a Hip Exoskeleton for Partial Gait Assistance

Vision Transformer Adapters for Generalizable Multitask Learning

Friction and fracture: richness and complexity in dynamic rupture

Investigating the neuromechanical control of healthy gait modulation and pathological gaits observed in cerebral palsy using neuromuscular simulations

Concurrency control for database theorists

Lower Bounds for Unambiguous Automata via Communication Complexity

A PCP Theorem for Interactive Proofs and Applications

Data-driven and Safe Networked Control with Applications to Microgrids

Deciding Robustness for Lower SQL Isolation Levels

Robustness against Read Committed for Transaction Templates

Efficient Protocols for Enforcing Causal Consistency in Geo-Replicated Key-Value Data Stores

Task scheduling for highly concurrent analytical and transaction workloads

Deciding Robustness for Lower SQL Isolation Levels

Fast General Distributed Transactions with Opacity

Distributed Transactional Systems Cannot Be Fast

PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication