Techniques for Detection, Root Cause Diagnosis, and Classification of In-Production Concurrency Bugs

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.

Data races have long been a notorious problem in concurrent programming. They are subtle to detect, and lead to non-deterministic behaviours. There has been a lot of interest in type systems that statically guarantee data race freedom. Significant progress ...

Computer systems rely heavily on abstraction to manage the exponential growth of complexity across hardware and software. Due to practical considerations of compatibility between components of these complex systems across generations, developers have favou ...

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 ...

Software is going through a trust crisis. Privileged code is no longer trusted and processes insufficiently protect user code from unverified libraries. While usually treated separately, confidential computing and program compartmentalization are both symp ...

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

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 ...

Fuzzing reliably and efficiently finds bugs in software, including operating system kernels. In general, higher code coverage leads to the discovery of more bugs. This is why most existing kernel fuzzers adopt strategies to generate a series of inputs that ...

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 ...

Native reactive electrophilic species (RES) are long-recognized regulators of pathophysiology; yet, knowledge surrounding how RES regulate context-specific biology remains limited. The latest technological advances in profiling and precision decoding of RE ...

Fuzzing has emerged as the most broadly used testing technique to discover bugs. Effective fuzzers rely on coverage to prioritize inputs that exercise new program areas. Edge-based code coverage of the Program Under Test (PUT) is the most commonly used cov ...

The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...

Today's continued increase in demand for processing power, despite the slowdown of Moore's law, has led to an increase in processor count, which has resulted in energy consumption and distribution problems. To address this, there is a growing trend toward ...

Code-reuse attacks are dangerous threats that attracted the attention of the security community for years. These attacks aim at corrupting important control-flow transfers for taking control of a process without injecting code. Nowadays, the combinations o ...

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

A generic search is presented for the associated production of a Z boson or a photon with an additional unspecified massive particle X, pp -> pp + Z/gamma + X, in proton-tagged events from proton-proton collisions at root s = 13 TeV, recorded in 2017 with ...

The opportunities provided by adopting digitally-generated visual tools in urban participatory planning are compelling. These visual tools can promote interactions between authorities and citizens and among citizens. However, the urban participatory practi ...

Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...

Online services have become ubiquitous in technological society, the global demand for which has driven enterprises to construct gigantic datacenters that run their software. Such facilities have also recently become a substrate for third-party organizatio ...

We present a self-consistent and versatile forward modelling software package that can produce time series and pixel-level simulations of time-varying strongly lensed systems. The time dimension, which needs to take into account different physical mechanis ...

Recent advances in computational neuroscience have demonstrated the usefulness and importance of stochastic, spatial reaction-diffusion simulations. However, ever increasing model complexity renders traditional serial solvers, as well as naive parallel imp ...

Techniques for Detection, Root Cause Diagnosis, and Classification of In-Production Concurrency Bugs

Chat with Graph Search

Degrees of Separation: A Flexible Type System for Safe Concurrency

Secure Interface Design Leveraging Hardware/Software Support

Oligolithic Cross-task Optimizations across Isolated Workloads

Creating Trust by Abolishing Hierarchies

Robust Collaborative Learning with Linear Gradient Overhead

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

ACTOR: Action-Guided Kernel Fuzzing

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

Structural Insights into Electrophiles and Electrophilic Metabolites Sensing and Signaling: The Missing Information

Arvin: Greybox Fuzzing Using Approximate Dynamic CFG Analysis

Reliable Microsecond-Scale Distributed Computing

Compilation and Design Space Exploration of Dataflow Programs for Heterogeneous CPU-GPU Platforms

WarpAttack: Bypassing CFI through Compiler-Introduced Double-Fetches

The splay-list: a distribution-adaptive concurrent skip-list

A search for new physics in central exclusive production using the missing mass technique with the CMS detector and the CMS-TOTEM precision proton spectrometer

Media Coverage of 3D Visual Tools Used in Urban Participatory Planning

Automated Verification of Network Function Binaries

Hardware and Software Support for RPC-Centric Server Architecture

Simulating time-varying strong lenses

STEPS 4.0: Fast and memory-efficient molecular simulations of neurons at the nanoscale