Publication

Automated Classification of Data Races Under Both Strong and Weak Memory Models

Related publications (35)

Graph Chatbot

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.

Execution Synthesis: A Technique for Automated Software Debugging

George Candea, Cristian Zamfir

Debugging real systems is hard, requires deep knowledge of the code, and is time-consuming. Bug reports rarely provide sufficient information, thus forcing developers to turn into detectives searching for an explanation of how the program could have arrive ...

2010

Scalable real-time planar targets tracking for digilog books

Vincent Lepetit

We propose a novel 3D tracking method that supports several hundreds of pre-trained potential planar targets without losing real-time performance. This goes well beyond the state-of-the-art, and to reach this level of performances, two threads run in paral ...

Springer Verlag2010

On the enzymatic activity of catalase: an iron L-edge X-ray absorption study of the active centre

Majed Chergui

Catalase and methaemoglobin have very similar haem groups, which are both ferric, yet catalase decomposes hydrogen peroxide to water and oxygen very efficiently, while methaemoglobin does not. Structural studies have attributed this behaviour to their diff ...

Royal Society of Chemistry2010

Scala actors: Unifying thread-based and event-based programming

Martin Odersky, Philipp Haller

There is an impedance mismatch between message-passing concurrency and virtual machines, such as the JVM. VMs usually map their threads to heavyweight OS processes. Without a lightweight process abstraction, users are often forced to write parts of concurr ...

2009

Actors that Unify Threads and Events

Martin Odersky, Philipp Haller

In practice, concurrent programming systems based on message passing are often instantiations of the actor model. A popular implementation of this form of concurrency is the Erlang programming language. Erlang supports massively concurrent systems such as ...

2007

Scheduling threads for constructive cache sharing on CMPs

Anastasia Ailamaki, Babak Falsafi

In chip multiprocessors (CMPs), limiting the number of offchip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently scheduled threads share a largely overlappi ...

2007

Actors that Unify Threads and Events

Martin Odersky, Philipp Haller

Springer2007

Parallel depth first vs. work stealing schedulers on CMP architectures

Anastasia Ailamaki, Babak Falsafi

In chip multiprocessors (CMPs), limiting the number of off-chip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently scheduled threads share a largely overlapp ...

2006

Role-Based Declarative Synchronization for Reconfigurable Systems

Vlad Tanasescu

In this paper we address the problem of encoding complex concurrency control in reconfigurable systems. Such systems can be often reconfigured, either statically, or dynamically, in order to adapt to new requirements and a changing environment. We therefor ...

Springer2005

Looking Ahead in Open Multithreaded Transactions

Maxime Monod

Complex distributed object-oriented systems often need complex concurrency features, which may go beyond the traditional concurrency control associated with separate method calls. A transaction groups together a sequence of operations, and can therefore en ...

2004