In cloud computing, resources as files, databases, applications, and virtual machines may either scale or move from one machine to another in response to load increases and decreases (resource deployment). We study a type-based technique for analysing the deployments of resources in cloud computing. In particular, we design a type system for a concurrent object-oriented language with dynamic resource creations and movements. The type of a program is behavioural, namely it expresses the resource deployments over periods of (logical) time. Our technique admits the inference of types and may underlie the optimisation of the costs and consumption of resources.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert, E., Correas, J., Puebla, G., Román-Díez, G.: Quantified abstractions of distributed systems. In: Johnsen, E.B., Petre, L. (eds.) IFM 2013. LNCS, vol. 7940, pp. 285–300. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  2. 2.
    Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R.H., Konwinski, A., Lee, G., Patterson, D.A., Rabkin, A., Stoica, I., Zaharia, M.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)CrossRefGoogle Scholar
  3. 3.
    Bove, A., Dybjer, P.: Dependent types at work. In: Bove, A., Barbosa, L.S., Pardo, A., Pinto, J.S. (eds.) LerNet ALFA Summer School 2008. LNCS, vol. 5520, pp. 57–99. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Czajkowski, G., von Eicken, T.: JRes: A resource accounting interface for Java. In: Proceedings of OOPSLA, pp. 21–35 (1998)Google Scholar
  5. 5.
    de Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 316–330. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Foster, H., Emmerich, W., Kramer, J., Magee, J., Rosenblum, D.S., Uchitel, S.: Model checking service compositions under resource constraints. In: Proc. 6th of the European Software Engineering Conf. and the Symposium on Foundations of Software Engineering, pp. 225–234. ACM (2007)Google Scholar
  7. 7.
    Gay, S., Hole, M.: Subtyping for session types in the π-calculus. Acta Informatica 42(2-3), 191–225 (2005)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Giachino, E., Grazia, C.A., Laneve, C., Lienhardt, M., Wong, P.Y.H.: Deadlock analysis of concurrent objects: Theory and practice. In: Johnsen, E.B., Petre, L. (eds.) IFM 2013. LNCS, vol. 7940, pp. 394–411. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  9. 9.
    Giachino, E., Kobayashi, N., Laneve, C.: Deadlock analysis of unbounded process networks. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 63–77. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  10. 10.
    Giachino, E., Laneve, C., Lienhardt, M.: A Framework for Deadlock Detection in ABS. Software and Systems Modeling (to appear, 2014)Google Scholar
  11. 11.
    Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. 34(3), 14 (2012)Google Scholar
  12. 12.
    Hofmann, M., Rodriguez, D.: Automatic type inference for amortised heap-space analysis. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 593–613. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  13. 13.
    Johnsen, E.B., Hähnle, R., Schäfer, J., Schlatte, R., Steffen, M.: ABS: A core language for abstract behavioral specification. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol. 6957, pp. 142–164. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  14. 14.
    Johnsen, E.B., Owe, O., Schlatte, R., Tapia Tarifa, S.L.: Dynamic resource reallocation between deployment components. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol. 6447, pp. 646–661. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  15. 15.
    Johnsen, E.B., Owe, O., Schlatte, R., Tapia Tarifa, S.L.: Validating timed models of deployment components with parametric concurrency. In: Beckert, B., Marché, C. (eds.) FoVeOOS 2010. LNCS, vol. 6528, pp. 46–60. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  16. 16.
    Kobayashi, N., Suenaga, K., Wischik, L.: Resource usage analysis for the pi-calculus. Logical Methods in Computer Science 2(3) (2006)Google Scholar
  17. 17.
    Laneve, C., Padovani, L.: The must preorder revisited. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 212–225. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  18. 18.
    Lüttgen, G., Vogler, W.: Bisimulation on speed: A unified approach. Theoretical Computer Science 360(1-3), 209–227 (2006)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Milner, R.: A Calculus of Communicating Systems. Springer (1982)Google Scholar
  20. 20.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, ii. Inf. and Comput. 100, 41–77 (1992)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Moreau, L., Queinnec, C.: Resource aware programming. ACM Trans. Program. Lang. Syst. 27(3), 441–476 (2005)CrossRefGoogle Scholar
  22. 22.
    Netjes, M., van der Aalst, W.M., Reijers, H.A.: Analysis of resource-constrained processes with Colored Petri Nets. In: Proceedings of the Sixth Workshop on the Practical Use of Coloured Petri Nets and CPN Tools (CPN 2005). DAIMI, vol. 576. University of Aarhus (2005)Google Scholar
  23. 23.
    Sgroi, M., Lavagno, L., Watanabe, Y., Sangiovanni-Vincentelli, A.: Synthesis of embedded software using free-choice Petri nets. In: Proc. 36th ACM/IEEE Design Automation Conference (DAC 1999), pp. 805–810. ACM (1999)Google Scholar
  24. 24.
    Vulgarakis, A., Seceleanu, C.C.: Embedded systems resources: Views on modeling and analysis. In: Proc. 32nd IEEE Intl. Computer Software and Applications Conference (COMPSAC 2008), pp. 1321–1328. IEEE Computer Society (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Elena Giachino
    • 1
  • Cosimo Laneve
    • 1
  1. 1.Dept. of Computer Science and EngineeringUniversità di Bologna - INRIA FOCUSItaly

Personalised recommendations