Author:
Abdulla Parosh Aziz,Atig Mohamad Faouzi,Furbach Florian,Godbole Adwait A.,Hendi Yacoub G.,Krishna Shankara N.,Spengler Stephan
Abstract
AbstractWe consider parameterized verification of systems executing according to the total store ordering (TSO) semantics. The processes manipulate abstract data types over potentially infinite domains. We present a framework that translates the reachability problem for such systems to the reachability problem for register machines enriched with the given abstract data type.
Publisher
Springer Nature Switzerland
Reference48 articles.
1. Parosh Aziz Abdulla.Regular model checking.STTT, 14(2):109–118, 2012.
2. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo. A load-buffer semantics for total store ordering.LMCS, 14(1), 2018.
3. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Florian Furbach, Adwait Godbole, Yacoub G. Hendi, Shankaranarayanan Krishna, and Stephan Spengler. Parameterized verification under tso with data types. arXiv e-prints, 2023. arXiv:2302.02163.
4. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Rojin Rezvan. Parameterized verification under tso is pspace-complete. Proc. ACM Program. Lang., 4(POPL), 2019.
5. Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzanno, Frédéric Haziza, Chih-Duo Hong, and Ahmed Rezine. Constrained monotonic abstraction: A CEGAR for parameterized verification. In CONCUR 2010, pages 86–101, 2010.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. TSO Games - On the decidability of safety games under the total store order semantics;Electronic Proceedings in Theoretical Computer Science;2023-09-30
2. Parameterized Verification under TSO with Data Types;Tools and Algorithms for the Construction and Analysis of Systems;2023