Replacing Store Buffers by Load Buffers in TSO

We consider the weak memory model of Total Store Ordering (TSO). In the classical definition of TSO, an unbounded buffer is inserted between each process and the shared memory. The buffers contains ...

[1]  Eran Yahav,et al.  Automatic inference of memory fences , 2010, Formal Methods in Computer Aided Design.

[2]  Sebastian Burckhardt,et al.  What's Decidable about Weak Memory Models? , 2012, ESOP.

[3]  Parosh Aziz Abdulla,et al.  Precise and Sound Automatic Fence Insertion Procedure under PSO , 2015, NETYS.

[4]  Feng Liu,et al.  Dynamic synthesis for relaxed memory models , 2012, PLDI.

[5]  Parosh Aziz Abdulla,et al.  Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO , 2013, TACAS.

[6]  Sebastian Burckhardt,et al.  CheckFence: checking consistency of concurrent data types on relaxed memory models , 2007, PLDI '07.

[7]  Jeremy Manson,et al.  The Java memory model , 2005, POPL '05.

[8]  Parosh Aziz Abdulla,et al.  Automatic Fence Insertion in Integer Programs via Predicate Abstraction , 2012, SAS.

[9]  Ori Lahav,et al.  Explaining Relaxed Memory Models with Program Transformations , 2016, FM.

[10]  Daniel Kroening,et al.  Software Verification for Weak Memory via Program Transformation , 2012, ESOP.

[11]  Jeff Huang,et al.  Maximal causality reduction for TSO and PSO , 2016, OOPSLA.

[12]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[13]  Shengchao Qin,et al.  Reasoning about Fences and Relaxed Atomics , 2016, 2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP).

[14]  Ori Lahav,et al.  Owicki-Gries Reasoning for Weak Memory Models , 2015, ICALP.

[15]  Viktor Vafeiadis.  Separation logic for weak memory models , 2015, PLMW '15.

[16]  Peter Sewell,et al.  A Better x86 Memory Model: x86-TSO (Extended Version) , 2009 .

[17]  Mohamed Faouzi Atig,et al.  Getting Rid of Store-Buffers in TSO Analysis , 2011, CAV.

[18]  Yue Yang,et al.  Nemos: a framework for axiomatic and executable specifications of memory consistency models , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[19]  Paul E. McKenney.  Memory ordering in modern microprocessors, Part II , 2005 .

[20]  Bryan Carpenter,et al.  ARMCI: A Portable Remote Memory Copy Libray for Ditributed Array Libraries and Compiler Run-Time Systems , 1999, IPPS/SPDP Workshops.

[21]  Chao Wang,et al.  Dynamic partial order reduction for relaxed memory models , 2015, PLDI.

[22]  Koushik Sen,et al.  Testing concurrent programs on relaxed memory models , 2011, ISSTA '11.

[23]  Eran Yahav,et al.  Effective abstractions for verification under relaxed memory models , 2017, Comput. Lang. Syst. Struct..

[24]  Parosh Aziz Abdulla,et al.  Well (and Better) Quasi-Ordered Transition Systems , 2010, The Bulletin of Symbolic Logic.

[25]  Sebastian Burckhardt,et al.  Effective Program Verification for Relaxed Memory Models , 2008, CAV.

[26]  Parosh Aziz Abdulla,et al.  Counter-Example Guided Fence Insertion under TSO , 2012, TACAS.

[27]  Eran Yahav,et al.  Predicate Abstraction for Relaxed Memory Models , 2013, SAS.

[28]  Roland Meyer,et al.  Robustness against Power is PSpace-complete , 2014, ICALP.

[29]  Parosh Aziz Abdulla,et al.  Stateless Model Checking for POWER , 2016, CAV.

[30]  Salvatore La Torre,et al.  Embedding weak memory models within eager sequentialization , 2016 .

[31]  Parosh Aziz Abdulla,et al.  Stateless Model Checking for TSO and PSO , 2015, TACAS.

[32]  Rajeev Alur,et al.  An Axiomatic Memory Model for POWER Multiprocessors , 2012, CAV.

[33]  Peter Sewell,et al.  A Better x86 Memory Model: x86-TSO , 2009, TPHOLs.

[34]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[35]  Sebastian Burckhardt,et al.  On the verification problem for weak memory models , 2010, POPL '10.

[36]  Parosh Aziz Abdulla,et al.  The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO , 2015, ESOP.

[37]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[38]  Oleg Travkin,et al.  Verification of Concurrent Programs on Weak Memory Models , 2016, ICTAC.

[39]  Daniel Kroening,et al.  Partial Orders for Efficient Bounded Model Checking of Concurrent Software , 2013, CAV.

[40]  Patrick Lam,et al.  SATCheck: SAT-directed stateless model checking for SC and TSO , 2015, OOPSLA.

[41]  Salvatore La Torre,et al.  Lazy sequentialization for TSO and PSO via shared memory abstractions , 2016, 2016 Formal Methods in Computer-Aided Design (FMCAD).

[42]  Eran Yahav,et al.  Partial-coherence abstractions for relaxed memory models , 2011, PLDI '11.

[43]  Francesco Zappa Nardelli,et al.  x86-TSO , 2010, Commun. ACM.

[44]  Parosh Aziz Abdulla,et al.  Context-Bounded Analysis for POWER , 2017, TACAS.

[45]  Roland Meyer,et al.  Checking and Enforcing Robustness against TSO , 2013, ESOP.