Abstract
We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be partially confluent than previous approaches and is able to handle a mix of different kinds of communication channels, including shared reference cells.
This research was supported in part by NSF Grant No. CCR-0326577.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiken, A., Gay, D.: Barrier inference. In: Proceedings of the 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, pp. 342–354 (January 1998)
Blom, S., van de Pol, J.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 596–609. Springer, Heidelberg (2002)
Boyland, J.: Checking interference with fractional permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 55–72. Springer, Heidelberg (2003)
Crary, K., Walker, D., Morrisett, G.: Typed memory management in a calculus of capabilities. In: Proceedings of the 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas, pp. 262–275 (January 1999)
Edwards, S.A., Tardieu, O.: Shim: a deterministic model for heterogeneous embedded systems. In: Proceedings of the 5th ACM International Conference On Embedded Software, Jersey City, NJ, pp. 264–272 (September 2005)
Groote, J.F., van de Pol, J.: State space reduction using partial tau-confluence. In: Proceedings of 25th International Symposium on the Mathematical Foundations of Computer Science 2000, Bratislava, Slovakia, pp. 383–393 (August 2000)
Kahn, G.: The semantics of a simple language for parallel programming. In: Information processing, Stockholm, Sweden, pp. 471–475 (August 1974)
Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems 21(5), 914–947 (1999)
König, B.: Analysing input/output-capabilities of mobile processes with a generic type system. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 403–414. Springer, Heidelberg (2000)
Nestmann, U., Steffen, M.: Typing confluence. In: Proceedings of FMICS 1997, pp. 77–101 (1997)
Terauchi, T., Aiken, A.: Witnessing side-effects. In: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, Tallinn, Estonia, September 2005, pp. 105–115. ACM, New York (2005)
Terauchi, T., Aiken, A.: A capability calculus for concurrency and determinism. Technical Report UCB/EECS-2006-84, University of California, Berkeley (2006)
Walker, D., Morrisett, G.: Alias types for recursive data structures. In: International Workshop on Types in Compilation, Montreal, Canada (September 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Terauchi, T., Aiken, A. (2006). A Capability Calculus for Concurrency and Determinism. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_15
Download citation
DOI: https://doi.org/10.1007/11817949_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37376-6
Online ISBN: 978-3-540-37377-3
eBook Packages: Computer ScienceComputer Science (R0)