A capability calculus for concurrency and determinism

ACM Transactions on Programming Languages and Systems

Volumn 30, Issue 5, 2008, Pages

  Terauchi, Tachio ^a   Aiken, Alex ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Capabilities; Determinism; Type systems

Indexed keywords

BROADCAST CHANNELS; CAPABILITIES; COMMUNICATION METHODS; CONCURRENT PROCESSING; DETERMINISM; LINEAR INEQUALITIES; POLYNOMIAL-TIME; TYPE SYSTEMS;

POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 51849136830     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1387673.1387676     Document Type: Article

References (30)

1. AIKEN, A. and GAY, D. 1998. Barrier inference. In Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 342-354.
2. BLOM, S. AND VAN DE POL, J. 2002. State space reduction by proving confluence. In Proceedings of the 14th International Conference on Computer Aided Verification. 596-609.
3. BOUDOL, G. 1992. Asynchrony and the pi-calculus. Tech. rep. 1702, INRIA Sophia Antipolis.
4. BOYLAND, J. 2003. Checking interference with fractional permissions. In Proceedings of the 10th International Symposium on Static Ananysis. 55-72.
5. COATES, W. S., LEXAU, J. K., JONES, I. W., FAIRBANKS, S. M., and SUTHERLAND, I. E. 2001. Fleetzero: An asynchronous switching experiment. In Proceedings of the 7th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC'01). IEEE Computer Society.
6. CRARY, K., WALKER, D., AND MORRISETT, G. 1999. Typed memory management in a calculus of capabilities. In Proceedings of the 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 262-275.
7. DELINE, R. AND FÄHNDRICH, M. 2001. Enforcing High-Level Protocols in Low-Level Software. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. 1, 59-69.
8. EDWARDS, S. A. AND TARDIEU, O. 2005. Shim: a deterministic model for heterogeneous embedded systems. In Proceedings of the 5th ACM International Conference On Embedded Software. 264-272.
9. FOSTER, J. S., TERAUCHI, T., AND AIKEN, A. 2002. Flow-sensitive type qualifiers. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
10. GORDON, A. D. AND JEFFREY, A. 2001. Typing correspondence assertions for communication protocols. Theor. Comput. Sci. 45.
11. GORDON, A. D. AND JEFFREY, A. 2002. Types and Effects for Asymmetric Cryptographic Protocols. IEEE Computer Society.
12. GROOTE, J. F. AND VAN DE POL, J. 2000. State space reduction using partial tau-confluence. In Proceedings of 25th International Symposium on the Mathematical Foundations of Computer Science. 383-393.
13. HANSEN, H. AND VALMARI, A. 2006. Operational determinism and fast algorithms. In Concurrency Theory, 17th International Conference (CONCUR'06). Vol. 4137. Springer, 188-202.
14. HONDA, K. AND TOKORO, M. 1992. On asynchronous communication semantics. In Proceedings of the European Conference on Object-Oriented Programming Workshop on Object-Based Concurrent Computing. Springer-Verlag, 21-51.
15. IGARASHI, A. AND KOBAYASHI, N. 2004. A generic type system for the pi-calculus. Theor. Comput. Sci. 311, 1-3, 121-163.
16. KAHN, G. 1974. The semantics of a simple language for parallel programming In Information Processing. Stockholm, Sweden, 471-475.
17. KOBAYASHI, N. 2007. Personal communication.
18. KOBAYASHI, N., NAKADE, M., AND YONEZAWA, A. 1995. Static analysis of communication for asynchronous concurrent programming languages. In Proceedings of the 2nd International Symposium on Static Analysis. Glasgow, Scotland, 225-242.
19. KOBAYASHI, N., PIERCE, B. C., AND TURNER, D. N. 1999. Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst. 21, 5 914-947.
20. KÖNIG, B. 2000. Analysing input/output-capabilities of mobile processes with a generic type system. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming. 403-414.
21. LEE, E. A. 2006. The problem with threads. Tech. rep. UCB/EECS-2006-1, EECS Department, University of California, Berkeley.
22. MEGACZ, A. 2006. CCCD implementation. http://research.cs. berkeley.edu/project/cccd-impl/README.
23. NESTMANN, U. AND STEFFEN, M. 1997. Typing confluence. In Proceedings of FMICS '97. 77-101.
24. SMITH, F., WALKER, D., AND MORRISETT, G. 2000. Alias Types. In Proceedings of the 9th European Symposium on Programming, G. Smolka, Ed. Lecture Notes in Computer Science, vol. 1782. Springer-Verlag, Berlin, Germany, 366-381.
25. SUTTER, H. AND LARUS, J. 2005. Software and the concurrency revolution. Queue 3, 7, 54-62.
26. TERAUCHI, T. AND AIKEN, A. 2005. Witnessing side-effects. In Proceedings of the 10th ACM SIG-PLAN International Conference on Functional Programming. ACM, 105-115.
27. TERAUCHI, T. AND AIKEN, A. 2006. A capability calculus for concurrency and determinism. In Concurrency Theory, 17th International Conference (CONCUR'06). Vol. 4137. Springer, Bonn, Germany, 218-232.
28. WALKER, D. AND MORRISETT, G. 2000. Alias types for recursive data structures. In Proceedings of the International Workshop on Types in Compilation. Montreal, Canada.
29. WANG, X. AND KWIATKOWSKA, M. 2006. Compositional state space reduction using untangled actions. In Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EX-PRESS'06). 16-28.
30. YOSHIDA, N., BERGER, M., AND HONDA, K. 2004. Strong normalisation in the pi-calculus. Inform. Comput. 191, 2, 145-202.