Proofs and types
A variable typed logic of effects
Information and Computation
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
PLAN: a packet language for active networks
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
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
Communication and Concurrency
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
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
Ensuring termination by typability
Information and Computation
A Hybrid Type System for Lock-Freedom of Mobile Processes
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
A hybrid type system for lock-freedom of mobile processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of termination inference for processes
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Typing termination in a higher-order concurrent imperative language
Information and Computation
Mobile processes and termination
Semantics and algebraic specification
Termination in impure concurrent languages
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Termination in higher-order concurrent calculi
FSEN'09 Proceedings of the Third 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
Fair cooperative multithreading: typing termination in a higher-order concurrent imperative language
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
A process $M$ terminates if it cannot produce an infinite sequence of reductions $M \mathop{\rightarrow}^{\tau} M_1\mathop{\rightarrow}^{\tau} M_2 \ldots$. Termination is a useful property in concurrency. For instance, a terminating applet, when loaded on a machine, will not run for ever, possibly absorbing all computing resources (a ‘denial of service’ attack). Similarly, termination guarantees that queries to a given service originate only finite computations.We ensure termination of a non-trivial subset of the $\pi$-calculus by a combination of conditions on types and on the syntax. The proof of termination is in two parts. The first uses the technique of logical relations – a well-know technique of $\lambda$-calculi – on a small set of non-deterministic ‘functional’ processes. The second part of the proof uses techniques of process calculi, in particular, techniques of behavioural preorders.