Author:
Kobayashi Naoki,Sangiorgi Davide
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;L. Acciai,2006
2. Ben-Amram, A.M., Lee, C.S.: Program termination analysis in polynomial time. ACM Trans. Prog. Lang. Syst. 29(1 (Article 5)) (2007)
3. Lecture Notes in Computer Science;P. Bidinger,2007
4. Lecture Notes in Computer Science;E. Brinksma,1995
5. Cook, B., Gotsman, A., Podelski, A., Rybalchenko, A., Vardi, M.Y.: Proving that programs eventually do something good. In: Proc. of POPL, pp. 265–276 (2007)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Almost-Sure Termination of Binary Sessions;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
2. Process-Local Static Analysis of Synchronous Processes;Static Analysis;2018
3. Light logics and higher-order processes;Mathematical Structures in Computer Science;2014-11-17
4. Spatial and behavioral types in the pi-calculus;Information and Computation;2010-10
5. Responsive Choice in Mobile Processes;Trustworthly Global Computing;2010