Abstract
Several type systems have been proposed for characterizing resource usage in process calculi, starting with the work on linear and unbounded names in the \(\pi \)-calculus by Kobayashi, Pierce and Turner. In this paper we use the general framework of \(\psi \)-calculi proposed by Bengtson, Parrow et al. to provide a general theory of type systems of this kind. We present a general type system that allows for a subject reduction property generalizing that of Kobayashi et al. and show how existing, quite different type systems for resource control can be expressed within our general type system. These are the original type system for linear names in the \(\pi \)-calculus, the graph types for strong normalization in the \(\pi \)-calculus due to Honda, Yoshida and Berger, a type system for termination in a value-passing calculus due to Deng and Sangiorgi and a type system for allocation and deallocation of generated names due to de Vries, Francalanza and Hennessy.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Meth. Comput. Sci. 7(1), 11 (2011)
Bugliesi, M., Calzavara, S., Eigner, F., Maffei, M.: Resource-aware authorization policies for statically typed cryptographic protocols. In: Proceedings of CSF 2011, pp. 83–98. IEEE Computer Society (2011)
Dardha, O., Giachino, E., Sangiorgi, D.: Session types revisited. In: Proceedings of PPDP, pp. 139–150. ACM, New York (2012)
de Vries, E., Francalanza, A., Hennessy, M.: Uniqueness typing for resource management in message-passing concurrency. In: LINEARITY. EPTCS, vol. 22, pp. 26–37 (2009)
Demangeon, R., Honda, K.: Full Abstraction in a Subtyped pi-calculus with Linear Types. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 280–296. Springer, Heidelberg (2011)
Deng, Y., Sangiorgi, D.: Ensuring termination by typability. Inf. Comput. 204(7), 1045–1082 (2006)
Gabbay, M.J., Mathijssen, A.: Nominal (universal) algebra: equational logic with names and binding. J. Logic Comput. 19(6), 1455–1508 (2009)
Girard, J.-Y.: Linear logic. Theoret. Comput. Sci. 50, 1–102 (1987)
Giunti, M., Vasconcelos, V.T.: A linear account of session types in the Pi calculus. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 432–446. Springer, Heidelberg (2010)
Honda, K.: Types for dynamic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509–523. Springer, Heidelberg (1993)
Honda, K.: Composing processes. In: Proceedings of POPL 1996, pp. 344–357 (1996)
Kähkönen, K., Kindermann, R., Heljanko, K., Niemelä, I.: Experimental comparison of concolic and random testing for Java card applets. In: Pol, J., Weber, M. (eds.) Model Checking Software. LNCS, vol. 6349, pp. 22–39. Springer, Heidelberg (2010)
Hüttel, H.: Typed \(\psi \)-calculi. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 265–279. Springer, Heidelberg (2011)
Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the pi-calculus. ACM Trans. Program. Lang. Syst. 21(5), 914–947 (1999)
Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, Ch., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233–247. Springer, Heidelberg (2006)
Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the \(\pi \)-calculus. In: Proceedings of LICS 2001, pp. 311–322. IEEE (2001)
Yoshida, N., Berger, M., Honda, K.: Genericity and the \(\pi \)-calculus. Acta Inf. 42(2/3), 83–141 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hüttel, H. (2014). Types for Resources in \(\psi \)-calculi. In: Abadi, M., Lluch Lafuente, A. (eds) Trustworthy Global Computing. TGC 2013. Lecture Notes in Computer Science(), vol 8358. Springer, Cham. https://doi.org/10.1007/978-3-319-05119-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-05119-2_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05118-5
Online ISBN: 978-3-319-05119-2
eBook Packages: Computer ScienceComputer Science (R0)