A Type System for Lock-Free Processes-Reference-Cited by-同舟云学术

A Type System for Lock-Free Processes

Published:2002-09 Issue:2 Volume:177 Page:122-159
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Kobayashi Naoki

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference39 articles.

1. Boudol, G.1997, Typing the use of resources in a concurrent calculus, inProceedings of ASIAN'97, Lecture Notes in Computer Science, Vol. 1345, pp. 239–253, Springer-Verlag, Berlin/New York.

2. Chen, L. 1992, Timed Processes: Models, Axioms and Decidability, Ph.D. thesis, University of Edinburgh.

3. Weak and strong fairness in CCS;Costa;Inform. and Comput.,1987

4. Cousot, P.1997, Types as abstract interpretations, inProceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pp. 316–331.

5. Cousot, P., and Cousot, R.1977, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, inProceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pp. 238–252.

Cited by 63 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A logical account of subtyping for session types;Journal of Logical and Algebraic Methods in Programming;2024-10

2. On the Almost-Sure Termination of Binary Sessions;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09

3. Fair termination of multiparty sessions;Journal of Logical and Algebraic Methods in Programming;2024-06

4. Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing;Proceedings of the ACM on Programming Languages;2024-01-05

5. Multicompatibility for Multiparty-Session Composition;International Symposium on Principles and Practice of Declarative Programming;2023-10-22