On the complexity of termination inference for processes

Authors:
Romain Demangeon;Daniel Hirschkoff;Naoki Kobayashi;Davide Sangiorgi
Affiliations:
ENS Lyon, CNRS, INRIA, UCBL, UMR, France;ENS Lyon, CNRS, INRIA, UCBL, UMR, France;Tohoku University, Japan;Università di Bologna, Italy
Venue:
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Year:
2007

Citing 9
Cited 6

A sort inference algorithm for the polyadic &pgr;-calculus

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tractable constraints in finite semilattices

Science of Computer Programming
Type reconstruction for linear &pgr;-calculus with I/O subtyping

Information and Computation
Principal Typing Schemes in a Polyadic pi-Calculus

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Implicit Typing à la ML for the Join-Calculus

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Strong normalisation in the π-calculus

Information and Computation
Termination of processes

Mathematical Structures in Computer Science
Ensuring termination by typability

Information and Computation
Proving thread termination

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation

A Hybrid Type System for Lock-Freedom of Mobile Processes

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
A hybrid type system for lock-freedom of mobile processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mobile processes and termination

Semantics and algebraic specification
Termination in impure concurrent languages

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the statistical thermodynamics of reversible communicating processes

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Termination in higher-order concurrent calculi

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done in polynomial time for two of these, but that this is not the case for the two most expressive systems. To remedy this, we study two modifications of these type systems that allow us to recover a polynomial type inference.