A hybrid type system for lock-freedom of mobile processes

ACM Transactions on Programming Languages and Systems

Volumn 32, Issue 5, 2010, Pages

  Kobayashi, Naoki ^a   Sangiorgi, Davide ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Concurrency; Mobile processes; Type systems

Indexed keywords

ANALYSIS TOOLS; COMMUNICATION STRUCTURES; CONCURRENT PROGRAM; CONFLUENCE ANALYSIS; DEADLOCK FREEDOM; HYBRID TYPE; LOCAL REASONING; MOBILE PROCESS; NON-TRIVIAL PROGRAMS; PARAMETERIZED; TYPE SYSTEMS;

AUTOMATA THEORY; CALCULATIONS;

MODEL CHECKING;

EID: 77952901027     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1745312.1745313     Document Type: Article

References (39)

1. ACCIAI, L. AND BOREALE, M. 2008. Responsiveness in process calculi. Theor. Comput. Sci. 409, 1, 59-93.
2. BEN-AMRAM, A. M. AND LEE, C. S. 2007. Program termination analysis in polynomial time. ACM Trans. Prog. Lang. Syst. 29, 1 (Article 5).
3. BIDINGER, P. AND COMPAGNONI, A. B. 2009. Pict correctness revisited. Theoret. Comput. Sci. 410, 2-3, 114-127.
4. BODEI, C., DEGANO, P., NIELSON, F., AND NIELSON, H. R. 1998. Control flow analysis for the picalculus. In Proceedings of CONCUR'98. Lecture Notes in Computer Science, vol.1466. Springer-Verlag, Berlin, Germany, 84-98.
5. BOREALE, M., NICOLA, R. D., AND PUGLIESE, R. 1999. Basic observables for processes. Inf. Comput. 149, 1, 77-98.
6. BOYAPATI, C., LEE, R., AND RINARD, M. 2002. Ownership types for safe programming: Preventing data races and deadlocks. In Proceedings of OOPSLA 2002. ACM, New York, 211-230.
7. BRINKSMA, E., RENSINK, A., AND VOLGER, W. 1995. Fair testing. In Proceedings of CONCUR 1995. Lecture Notes in Computer Science, vol.962. Springer-Verlag, Berlin, Germany, 313-327.
8. CAIRES, L. 2007. Logical semantics of types for concurrency. In Proceedings of CALCO 2007. Lecture Notes in Computer Science, vol.4624. Springer-Verlag, Berlin, Germany, 16-35.
9. CAIRES, L., AND CARDELLI, L. 2003. A spatial logic for concurrency (part I). Inf. Comput. 186, 2, 194-235.
10. CHAKI, S., RAJAMANI, S., AND REHOF, J. 2002. Types as models: Model checking message-passing programs. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). ACM, New York, 45-57.
11. COOK, B., GOTSMAN, A., PODELSKI, A., RYBALCHENKO, A., AND VARDI, M. Y. 2007a. Proving that programs eventually do something good. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL). ACM, New York, 265-276.
12. COOK, B., PODELSKI, A., AND RYBALCHENKO, A. 2007b. Proving thread termination. In Proceedings of the Programming Language Design and Implementation (PLDI). ACM, New York, 320-330.
13. DAM, M. 1996. Model checking mobile processes. Inf. Comput. 129, 1, 35-51.
14. DEMANGEON, R., HIRSCHKOFF, D., KOBAYASHI, N., AND SANGIORGI, D. 2008. On the complexity of termination inference for processes. In Proceedings of the Conference on Trusted Global Computing (TGC'08). Lecture Notes in Computer Science, vol.4912. Springer-Verlag, Berlin, Germany, 140-155.
15. DENG, Y., AND SANGIORGI, D. 2006. Ensuring termination by typability. Inf. Comput. 204, 7, 1045-1082.
16. FERET, J. 2005. Abstract interpretation of mobile systems. J. Logic. Algebr. Program. 63, 1, 59-130.
17. HOLZMANN,G. J. 2003. The SPINModel Checker: Premier and Reference Manual. Addison-Wesley, Reading, MA.
18. HONDA, K., VASCONCELOS, V., AND YOSHIDA, N. 2000. Secure information flow as typed process behaviour. In Proceedings of the European Symposium on Programming (ESOP'00). Lecture Notes in Computer Science, vol.1782. Springer-Verlag, Berlin, Germany, 180-199.
19. HONDA, K., AND YOSHIDA, N. 2007. A uniform type structure for secure information flow. ACM Trans. Program. Lang. Syst. 29, 6.
20. HUGO VIEIRA, L. C., AND VIEGAS, R. 2005. The spatial logic model checker user's manual v1.0. TR-DI/FCT/UNL-05, http://ctp.di.fct.unl.pt/SLMC/.
21. JONES, C. 1993. A integral-calculus semantics for an object-based design notation. In Proceedings of CONCUR'93. Lecture Notes in Computer Science, vol.715. Springer-Verlag, Berlin, Germany, 158-172.
22. KOBAYASHI, N. 2002. A type system for lock-free processes. Inf. Comput. 177, 122-159.
23. KOBAYASHI, N. 2005a. Type-based information flow analysis for the pi-calculus. Acta Inf. 42, 4-5, 291-347.
24. KOBAYASHI, N. 2005b. TYPICAL: A type-based static analyzer for the pi-calculus. Tool available at http://www.kb.ecei.tohoku.ac.jp/ koba/typical/.
25. KOBAYASHI, N. 2006. A new type system for deadlock-free processes. In Proceedings of CONCUR2006. Lecture Notes in Computer Science, vol.4137. Springer-Verlag, Berlin,Germany, 233-247.
26. KOBAYASHI, N., PIERCE, B. C., AND TURNER, D. N. 1999. Linearity and the pi-calculus. ACM Trans. Prog. Lang. Syst. 21, 5, 914-947.
27. KOBAYASHI, N., SUENAGA, K., AND WISCHIK, L. 2006. Resource usage analysis for the pi-calculus. Logic. Meth. Comput. Sci. 2, 3:4, 1-42.
28. LEROY, X. 2000. A modular module system. J. Funct. Program. 10, 3, 269-303.
29. MILNER, R. 1993. The polyadic integral-calculus: a tutorial. In Logic and Algebra of Specification, Springer-Verlag, Berlin, Germany.
30. NATARAJAN, V. AND CLEAVELAND, R. 1995. Divergence and fair testing. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP'95). Lecture Notes in Computer Science, vol.944. Springer-Verlag, Berlin, Germany, 648-659.
31. PIERCE, B. C. AND TURNER, D. N. 2000. Pict: A programming language based on the pi-calculus. In Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press, Cambridge, MA, 455-494.
32. SANGIORGI, D. 1996. integral-calculus, internal mobility and agent-passing calculi. Theoret. Comput. Sci. 167, 2, 235-274.
33. SANGIORGI, D. 1999. The name discipline of uniform receptiveness. Theoret. Comput. Sci. 221, 1-2, 457-493.
34. SANGIORGI, D. 2006. Termination of processes. Math. Struct. Comput. Sci. 16, 1, 1-39. (Pubitemid 44707008)
35. SANGIORGI, D. AND WALKER, D. 2001. The Pi-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge, MA.
36. SUENAGA, K. AND KOBAYASHI, N. 2007. Type-based analysis of deadlock for a concurrent calculus with interrupts. In Proceedings of ESOP 2007. Lecture Notes in Computer Science, vol.4421. Springer-Verlag, Berlin, Germany, 490-504.
37. TERAUCHI, T., AND AIKEN, A. 2008. A capability calculus for concurrency and determinism. ACM Trans. Prog. Lang. Syst. 30, 5.
38. YOSHIDA, N. 2002. Type-based liveness guarantee in the presence of nontermination and nondeterminism. Tech. rep. 2002-2020, MSC Technical Report, University of Leicester. April.
39. YOSHIDA, N., BERGER, M., AND HONDA, K. 2004. Strong normalisation in the pi-calculus. Inf. Comput. 191, 2, 145-202.