References

  1. P. A. Abdulla, S. Aronis, M. F. Atig, B. Jonsson, C. Leonardsson & K. Sagonas (2015): Stateless Model Checking for TSO and PSO. In: C. Baier & C. Tinelli: Proc. of 21st Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2015, Lect. Notes in Comput. Sci. 9035. Springer, pp. 353–367, doi:10.1007/978-3-662-46681-0_28.
  2. J. Alglave (2010): A Shared Memory Poetics. Université Paris 7. Available at http://www0.cs.ucl.ac.uk/staff/J.Alglave/these.pdf.
  3. G. Boudol, G. Petri & Serpette G. (2012): Relaxed Operational Semantics of Concurrent Programming Languages. In: B. Luttik & M. A. Reniers: Proc. of Combined 19th Wksh. on Expressiveness in Concurrency and 9th Wksh. on Structural Operational Semantics, EXPRESS/SOS 2012, Electron. Proc. in Theor. Comput. Sci. 89, pp. 19–33, doi:10.4204/eptcs.89.3.
  4. P. Cartier & D. Foata (1969): Problemes combinatoires de commutation et réarrangements. Lect. Notes in Math. 85. Springer, doi:10.1007/bfb0079468.
  5. P. Godefroid (1996): Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem. Springer, doi:10.1007/3-540-60761-7.
  6. L. Lamport (1979): How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE Trans. on Comput. 28(9), pp. 690–691, doi:10.1109/tc.1979.1675439.
  7. A. Mazurkiewicz (1995): Introduction to Trace Theory. The Book of Traces, pp. 3–41, doi:10.1142/9789814261456_0001.
  8. S. Owens, S. Sarkar & P. Sewell (2009): A Better x86 Memory Model: x86-TSO. In: S. Berghofer, T. Nipkow, C. Urban & M. Wenzel: Proc. of 22nd Int. Conf. on Theorem Proving in Higher Order Logics, TPHOLs 2009, Lect. Notes in Comput. Sci. 5674. Springer, pp. 391–407, doi:10.1007/978-3-642-03359-9_27.
  9. S. Park & D. L. Dill (1995): An Executable Specification, Analyzer and Verifier for RMO (Relaxed Memory Order). In: Proc. of 7th Ann. ACM Symp. on Parallel Algorithms and Architectures, SPAA '95. ACM, pp. 34–41, doi:10.1145/215399.215413.
  10. V. Sassone, M. Nielsen & G. Winskel (1993): Deterministic Behavioural Models for Concurrency. In: A. M. Borzyszkowski & S. Sokolowski: Proc. of 18th Int. Symp. on Mathematical Foundations of Computer Science, MFCS '93, Lect. Notes in Comput. Sci. 711. Springer, pp. 682–692, doi:10.1007/3-540-57182-5_59.
  11. SPARC International Inc. & David L. Weaver (1994): The SPARC Architecture Manual. Prentice-Hall.
  12. Y. Yang, G. Gopalakrishnan, G. Lindstrom & K. Slind (2004): Nemos: A Framework for Axiomatic and Executable Specifications of Memory Consistency Models. In: Proc. of 18th Int. Parallel and Distributed Processing Symposium, IPDPS 2004. IEEE, pp. 31–40, doi:10.1109/ipdps.2004.1302944.
  13. N. Zhang, M. Kusano & C. Wang (2015): Dynamic Partial Order Reduction for Relaxed Memory Models. In: Proc. of 36th ACM SIGPLAN Conf. on Principles of Language Design and Implementation, PLDI 2015. ACM, pp. 250–259, doi:10.1145/2737924.2737956.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org