Author:
Deng Yuxin,Sangiorgi Davide
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference28 articles.
1. Mathematical Foundations of Programming;Beckman,1980
2. Genericity and the pi-calculus;Berger,2003
3. Mathematical background;Bezem,2003
4. On strong normalization in the intersection type discipline;Boudol,2003
5. Y. Deng, D. Sangiorgi, Ensuring termination by typability, in: Proceedings of the 3rd IFIP International Conference on Theoretical Computer Science, Kluwer, Dordrecht, 2004, pp. 619–632.
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Termination in Concurrency, Revisited;International Symposium on Principles and Practice of Declarative Programming;2023-10-22
2. Causal computational complexity of distributed processes;Information and Computation;2023-01
3. Fair termination of binary sessions;Proceedings of the ACM on Programming Languages;2022-01-12
4. On sequentiality and well-bracketing in the π-calculus;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
5. Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination;Programming Languages and Systems;2021