Travelled to:1 × China
1 × Cyprus
1 × Germany
1 × Greece
1 × India
1 × Ireland
1 × Italy
1 × Spain
1 × Sweden
1 × The Netherlands
1 × Turkey
1 × United Kingdom
11 × USA
2 × Austria
2 × Canada
2 × Switzerland
3 × France
Collaborated with:M.Kapalka ∅ P.T.Eugster B.Garbinato P.Felber A.Schiper T.David V.Trigonakis C.H.Damm S.Gilbert T.A.Henzinger V.Singh A.Dragojevic V.Gramoli E.Ruppert J.Kienzle R.Capobianchi A.Lanusse P.Roux J.H.Spring J.Vitek A.Kermarrec R.Banabic G.Candea V.Kuncak G.Losa H.S.Alavi E.Gafni B.Pochon A.Doudou J.Sventek R.Patra M.Taziki D.Alistarh M.Zadimoghaddam B.Jobstmann J.Privat P.Oser C.Gasser D.Gorostidi K.Mazouni A.Bouajjani C.Enea J.Hamza J.Barreto P.Ferreira J.S.Auerbach D.F.Bacon H.Attiya D.Hendler P.Kuznetsov M.M.Michael M.T.Vechev Diego Didona Nuno Diegues Ricardo Neves Paolo Romano 0002
Talks about:transact (9) memori (9) distribut (5) concurr (5) object (5) failur (4) asynchron (3) system (3) model (3) case (3)
Person: Rachid Guerraoui
DBLP: Guerraoui:Rachid
Facilitated 1 volumes:
EdContributed to:
2015
201520142014
2013
2012
2011
2010
2010
20092009200920092008
2008200820082008
2007
2005
2004
20022002
200220012000199819981996199619941992
199220172016Wrote 36 papers:
- ASPLOS-2015-DavidGT #concurrent #data type #scalability
- Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures (TD, RG, VT), pp. 631–644.
- VLDB-2015-GuerraouiKPT #difference #named #privacy #recommendation
- D2P: Distance-Based Differential Privacy in Recommenders (RG, AMK, RP, MT), pp. 862–873.
- ASPLOS-2014-BanabicCG #distributed
- Finding trojan message vulnerabilities in distributed systems (RB, GC, RG), pp. 113–126.
- ECOOP-2014-GramoliG #concurrent #data type #reuse
- Reusable Concurrent Data Types (VG, RG), pp. 182–206.
- SOSP-2013-DavidGT #afraid to ask
- Everything you always wanted to know about synchronization but were afraid to ask (TD, RG, VT), pp. 33–48.
- PLDI-2012-GuerraouiKL
- Speculative linearizability (RG, VK, GL), pp. 55–66.
- POPL-2011-AttiyaGHKMV #algorithm #concurrent #order
- Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (HA, RG, DH, PK, MMM, MTV), pp. 487–498.
- ICALP-v2-2010-AlistarhGGZ #cost analysis #how #performance
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (DA, SG, RG, MZ), pp. 115–126.
- PPoPP-2010-BarretoDFGK #memory management #parallel #transaction
- Leveraging parallel nesting in transactional memory (JB, AD, PF, RG, MK), pp. 91–100.
- CAV-2009-GuerraouiHS #memory management #modelling #transaction
- Software Transactional Memory on Relaxed Memory Models (RG, TAH, VS), pp. 321–336.
- CAV-2009-GuerraouiK #memory management #transaction
- Transactional Memory: Glimmer of a Theory (RG, MK), pp. 1–15.
- ICALP-v2-2009-GuerraouiR #mobile
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures (RG, ER), pp. 484–495.
- PLDI-2009-DragojevicGK #memory management #transaction
- Stretching transactional memory (AD, RG, MK), pp. 155–165.
- POPL-2009-GuerraouiK #memory management #semantics #transaction
- The semantics of progress in lock-based transactional memory (RG, MK), pp. 404–415.
- ECOOP-2008-Guerraoui #transaction
- The Return of Transactions (RG), p. 1.
- LCTES-2008-AuerbachBGSV #concurrent #flexibility #graph #java #programming #strict #thread
- Flexible task graphs: a unified restricted thread programming model for java (JSA, DFB, RG, JHS, JV), pp. 1–11.
- PLDI-2008-GuerraouiHJS #model checking #transaction
- Model checking transactional memories (RG, TAH, BJ, VS), pp. 372–382.
- POPL-2008-AlaviGG #encoding
- Extensible encoding of type hierarchies (HSA, SG, RG), pp. 349–358.
- PPoPP-2008-GuerraouiK #correctness #memory management #on the #transaction
- On the correctness of transactional memory (RG, MK), pp. 175–184.
- OOPSLA-2007-SpringPGV #java #named #programming
- Streamflex: high-throughput stream programming in java (JHS, JP, RG, JV), pp. 211–228.
- STOC-2005-GafniGP #adaptation #bound #complexity #set
- From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.
- ICSE-2004-EugsterDG #development #distributed #towards
- Towards Safe Distributed Application Development (PTE, CHD, RG), pp. 347–356.
- AdaEurope-2002-DoudouGG #detection #encapsulation
- Encapsulating Failure Detection: From Crash to Byzantine Failures (AD, BG, RG), pp. 24–50.
- ECOOP-2002-KienzleG #aspect-oriented #concurrent #named
- AOP: Does It Make Sense? The Case of Concurrency and Failures (JK, RG), pp. 37–61.
- EDOC-2002-OserGGG #framework #incremental
- The LEAF Platform: Incremental Enhancements for the J2EE (PO, CG, DG, RG), pp. 238–248.
- OOPSLA-2001-EugsterGD #on the
- On Objects and Events (PTE, RG, CHD), pp. 254–269.
- ECOOP-2000-EugsterGS #abstraction #distributed #interactive
- Distributed Asynchronous Collections: Abstractions for Publish/Subscribe Interaction (PTE, RG, JS), pp. 252–276.
- EDOC-1998-FelberGS #corba
- Evaluating CORBA portability: the case of an object group service (PF, RG, AS), pp. 164–173.
- OOPSLA-1998-GuerraouiFGM
- System Support for Object Groups (RG, PF, BG, KM), pp. 244–258.
- AdaEurope-1996-GuerraouiS #distributed #fault tolerance #replication
- Fault-Tolerance by Replication in Distributed Systems (RG, AS), pp. 38–57.
- ECOOP-1996-GarbinatoFG #design #distributed #protocol #reliability
- Protocol Classes for Designing Reliable Distributed Environments (BG, PF, RG), pp. 316–343.
- ECOOP-1994-Guerraoui #composition
- Atomic Object Composition (RG), pp. 118–138.
- ECOOP-1992-GuerraouiCLR #message passing #protocol
- Nesting Actions through Asynchronous Message Passing: the ACS Protocol (RG, RC, AL, PR), pp. 170–184.
- TOOLS-EUROPE-1992-CapobianchiGLR #case study #parallel
- Active Objects on Parallel Machines: a Case Study (RC, RG, AL, PR), pp. 207–216.
- POPL-2017-BouajjaniEGH #consistency #on the #verification
- On verifying causal consistency (AB, CE, RG, JH), pp. 626–638.
- ASPLOS-2016-DidonaDKGNR #abstraction #memory management #named #performance #transaction
- ProteusTM: Abstraction Meets Performance in Transactional Memory (DD, ND, AMK, RG, RN, PR0), pp. 757–771.