Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

TSO Games -- On the decidability of safety games under the total store order semantics (extended LMCS version with appendix) (2309.02862v4)

Published 6 Sep 2023 in cs.GT

Abstract: We consider an extension of the classical Total Store Order (TSO) semantics by expanding it to turn-based 2-player safety games. During her turn, a player can select any of the communicating processes and perform its next transition. We consider different formulations of the safety game problem depending on whether one player or both of them transfer messages from the process buffers to the shared memory. We give the complete decidability picture for all the possible alternatives.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. Probabilistic total store ordering. In Ilya Sergey, editor, Programming Languages and Systems - 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, volume 13240 of Lecture Notes in Computer Science, pages 317–345. Springer, 2022. doi:10.1007/978-3-030-99336-8_12.
  2. The benefits of duality in verifying concurrent programs under TSO. In Josée Desharnais and Radha Jagadeesan, editors, 27th International Conference on Concurrency Theory, CONCUR 2016, August 23-26, 2016, Québec City, Canada, volume 59 of LIPIcs, pages 5:1–5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. doi:10.4230/LIPIcs.CONCUR.2016.5.
  3. A load-buffer semantics for total store ordering. Log. Methods Comput. Sci., 14(1), 2018. doi:10.23638/LMCS-14(1:9)2018.
  4. Counter-example guided fence insertion under TSO. In Cormac Flanagan and Barbara König, editors, Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference, TACAS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, volume 7214 of Lecture Notes in Computer Science, pages 204–219. Springer, 2012. doi:10.1007/978-3-642-28756-5_15.
  5. Parameterized verification under TSO with data types. In Sriram Sankaranarayanan and Natasha Sharygina, editors, Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part I, volume 13993 of Lecture Notes in Computer Science, pages 588–606. Springer, 2023. doi:10.1007/978-3-031-30823-9_30.
  6. The best of both worlds: Trading efficiency and optimality in fence insertion for TSO. In Jan Vitek, editor, Programming Languages and Systems - 24th European Symposium on Programming, ESOP 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings, volume 9032 of Lecture Notes in Computer Science, pages 308–332. Springer, 2015. doi:10.1007/978-3-662-46669-8_13.
  7. Parameterized verification under TSO is pspace-complete. Proc. ACM Program. Lang., 4(POPL):26:1–26:29, 2020. doi:10.1145/3371094.
  8. On the verification problem for weak memory models. In Manuel V. Hermenegildo and Jens Palsberg, editors, Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, January 17-23, 2010, pages 7–18. ACM, 2010. doi:10.1145/1706299.1706303.
  9. Monotonic and downward closed games. J. Log. Comput., 18(1):153–169, 2008. doi:10.1093/logcom/exm062.
  10. Undecidable verification problems for programs with unreliable channels. In Serge Abiteboul and Eli Shamir, editors, Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, volume 820 of Lecture Notes in Computer Science, pages 316–327. Springer, 1994. doi:10.1007/3-540-58201-0_78.
  11. Verifying programs with unreliable channels. Inf. Comput., 127(2):91–101, 1996. doi:10.1006/inco.1996.0053.
  12. ARM. ARM Architecture Reference Manual, ARMv7-A and ARMv7-R edition, 2014. URL: https://developer.arm.com/documentation/ddi0406/latest/.
  13. Mohamed Faouzi Atig. What is decidable under the TSO memory model? ACM SIGLOG News, 7(4):4–19, 2020. doi:10.1145/3458593.3458595.
  14. Checking and enforcing robustness against TSO. In Matthias Felleisen and Philippa Gardner, editors, Programming Languages and Systems - 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, volume 7792 of Lecture Notes in Computer Science, pages 533–553. Springer, 2013. doi:10.1007/978-3-642-37036-6_29.
  15. Deciding robustness against total store ordering. In Luca Aceto, Monika Henzinger, and Jirí Sgall, editors, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, volume 6756 of Lecture Notes in Computer Science, pages 428–440. Springer, 2011. doi:10.1007/978-3-642-22012-8_34.
  16. On communicating finite-state machines. J. ACM, 30(2):323–342, 1983. doi:10.1145/322374.322380.
  17. Alternation. J. ACM, 28(1):114–133, 1981. doi:10.1145/322234.322243.
  18. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1-2):63–92, 2001. doi:10.1016/S0304-3975(00)00102-X.
  19. Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], volume 2500 of Lecture Notes in Computer Science. Springer, 2002. doi:10.1007/3-540-36387-4.
  20. IBM. Power ISA, Version 3.1b, 2021. URL: https://files.openpower.foundation/s/dAYSdGzTfW4j2r2/download/OPF_PowerISA_v3.1B.pdf.
  21. Intel Corporation. Intel 64 and IA-32 Architectures Software Developers Manual, 2012. URL: https://www.intel.com/content/www/us/en/developer/articles/technical/intel-sdm.html.
  22. Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Computers, 28(9):690–691, 1979. doi:10.1109/TC.1979.1675439.
  23. René Mazala. Infinite games. In Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors, Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], volume 2500 of Lecture Notes in Computer Science, pages 23–42. Springer, 2001. doi:10.1007/3-540-36387-4_2.
  24. A better x86 memory model: x86-tso. In Stefan Berghofer, Tobias Nipkow, Christian Urban, and Makarius Wenzel, editors, Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings, volume 5674 of Lecture Notes in Computer Science, pages 391–407. Springer, 2009. doi:10.1007/978-3-642-03359-9_27.
  25. Philippe Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett., 83(5):251–261, 2002. doi:10.1016/S0020-0190(01)00337-4.
  26. SPARC International, Inc. SPARC Architecture Manual Version 9, 1994. URL: https://sparc.org/wp-content/uploads/2014/01/SPARCV9.pdf.gz.
  27. TSO games - on the decidability of safety games under the total store order semantics. In Antonis Achilleos and Dario Della Monica, editors, Proceedings of the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2023, Udine, Italy, 18-20th September 2023, volume 390 of EPTCS, pages 82–98, 2023. doi:10.4204/EPTCS.390.6.
  28. x86-tso: a rigorous and usable programmer’s model for x86 multiprocessors. Commun. ACM, 53(7):89–97, 2010. doi:10.1145/1785414.1785443.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets