Publisher
Springer International Publishing
Reference23 articles.
1. Liang, H., Feng, X., Shao, Z.: Compositional verification of termination-preserving refinement of concurrent programs. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), ACM (2014), Article No. 65
2. Hoffmann, J., Marmar, M., Shao, Z.: Quantitative reasoning for proving lock-freedom. In: 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS). IEEE, pp. 124–133 (2013)
3. Lecture Notes in Computer Science;P Rocha Pinto da,2016
4. Lecture Notes in Computer Science;KRM Leino,2010
5. Boström, P., Müller, P.: Modular Verification of Finite Blocking in Non-terminating Programs, vol. 37. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany (2015)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing;Proceedings of the ACM on Programming Languages;2024-01-05
2. Higher-Order Leak and Deadlock Free Locks;Proceedings of the ACM on Programming Languages;2023-01-09
3. Deadlock prediction via generalized dependency;Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis;2022-07-18
4. Connectivity graphs: a method for proving deadlock freedom based on separation logic;Proceedings of the ACM on Programming Languages;2022-01-12
5. Ghost Signals: Verifying Termination of Busy Waiting;Computer Aided Verification;2021