RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of programming languages
Foundations of programming languages
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
The name discipline of uniform receptiveness
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
&lgr;-calculus, multiplicities, and the &pgr;-calculus
Proof, language, and interaction
Proving termination with multiset orderings
Communications of the ACM
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Fully Abstract Semantics for Concurrent Lambda-calculus
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
The Varieties of Programming Language Semantics
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Mathematical Structures in Computer Science
Ensuring termination by typability
Information and Computation
Exploiting Labels in Structural Operational Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Formal Semantics of Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of termination inference for processes
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Termination in higher-order concurrent calculi
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Strong normalisation in λ-calculi with references
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Linear logical relations for session-based concurrency
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
| Hi-index | 0.00 |
This paper surveys some recent works on the study of termination in a concurrent setting. Processes are p-calculus processes, on which type systems are imposed that ensure termination of the process computations. Two approaches are exposed. The first one draws on the method of logical relations, which has been extensively used in the analysis of sequential languages. The second approach exploits notions from term rewriting.