On the complexity of termination inference for processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4912 LNCS, Issue , 2008, Pages 140-155

  Demangeon, Romain ^a   Hirschkoff, Daniel ^a   Kobayashi, Naoki ^b   Sangiorgi, Davide ^c  

^a UNIVERSITÉ DE LYON   (France)

^b TOHOKU UNIVERSITY   (Japan)

^c UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS;

POLYNOMIAL TIME; POLYNOMIAL TYPE INFERENCE;

COMPUTATIONAL COMPLEXITY;

EID: 41549104589     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78663-4_11     Document Type: Conference Paper

References (13)

1. The Terminator Project: proof tools for termination and liveness (2007), http://research.microsoft.com/terminator/
2. Cook, B., Podelski, A., Rybalchenko, A.: Proving Thread Termination. In: Proc. of PLDI 2007, pp. 320-330. ACM Press, New York (2007)
3. Cook, B., Gotsman, A., Podelski. A., Rybalchenko, A., Vardi, M.Y.: Proving that programs eventually do something good, pp. 265-276 (2007)
4. Deng, Y., Sangiorgi, D.: Ensuring Termination by Typability. Information and Computation 204(7), 1045-1082 (2006)
5. Fournet, C., Laneve, C., Maranget, L., Rémy, D.: Implicit Typing à la ML for the Join-Calculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 196-212. Springer, Heidelberg (1997)
6. Gay, S.J.: A Sort Inference Algorithm for the Polyadic Pi-Calculus. In: Proc. of POPL 1993, pp. 429-438. ACM Press, New York (1993)
7. Igarashi, A., Kobayashi, N.: Type Reconstruction for Linear Pi-Calculus with I/O Subtyping. Information and Computation 161(1), 1-44 (2000)
8. Kobayashi, N.: TyPiCal: Type-based static analyzer for the Pi-Calculus (2007), http://www.kb.ecei.tohoku.ac.jp/~koba/typical/
9. Kobayashi, N., Sangiorgi, D.: From Deadlock-Freedom and Termination to Lock-Freedom (submitted 2007)
10. Rehof, J., Mogensen, T.: Tractable Constraints in Finite Semilattices. Science of Computer Programming 35(2), 191-221 (1999)
11. Sangiorgi, D.: Termination of Processes. Mathematical Structures in Computer Science 16(1), 1-39 (2006)
12. Vasconcelos, V.T., Honda, K.: Principal Typing Schemes in a Polyadic pi-Calculus. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 524-538. Springer, Heidelberg (1993)
13. Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the Pi-Calculus. Information and Computation 191(2), 145-202 (2004)