Quantified Abstractions of Distributed Systems

  • Elvira Albert
  • Jesús Correas
  • Germán Puebla
  • Guillermo Román-Díez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7940)


When reasoning about distributed systems, it is essential to have information about the different kinds of nodes which compose the system, how many instances of each kind exist, and how nodes communicate with other nodes. In this paper we present a static-analysis-based approach which is able to provide information about the questions above. In order to cope with an unbounded number of nodes and an unbounded number of calls among them, the analysis performs an abstraction of the system producing a graph whose nodes may represent (infinitely) many concrete nodes and arcs represent any number of (infinitely) many calls among nodes. The crux of our approach is that the abstraction is enriched with upper bounds inferred by a resource analysis which limit the number of concrete instances which the nodes and arcs represent. The combined information provided by our approach has interesting applications such as debugging, optimizing and dimensioning distributed systems.


Cost Model Interaction Graph Allocation Sequence Cost Center Program Point 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert, E., Arenas, P., Genaim, S., Gómez-Zamalloa, M., Puebla, G.: Cost Analysis of Concurrent OO Programs. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 238–254. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Albert, E., Arenas, P., Genaim, S., Gómez-Zamalloa, M., Puebla, G.: COSTABS: A Cost and Termination Analyzer for ABS. In: Procs. of PEPM 2012, pp. 151–154. ACM Press (2012)Google Scholar
  3. 3.
    Albert, E., Arenas, P., Correas, J., Gómez-Zamalloa, M., Genaim, S., Puebla, G., Román-Díez, G.: Object-sensitive cost analysis for concurrect objects. Technical Report (2012),
  4. 4.
    America, P.: Issues in the design of a parallel object-oriented language. Formal Aspects of Computing 1, 366–411 (1989)zbMATHCrossRefGoogle Scholar
  5. 5.
    Buyya, R., Yeo, C.S., Venugopal, S., Broberg, J., Brandic, I.: Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility. Future Generation Computer Systems 25(6), 599–616 (2009)CrossRefGoogle Scholar
  6. 6.
    Caromel, D.: Towards a method of object-oriented concurrent programming. Communications of the ACM 36(9), 90–102 (1993)CrossRefGoogle Scholar
  7. 7.
    Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints Among Variables of a Program. In: POPL, ACM Press (1978)Google Scholar
  8. 8.
    Feret, J.: Occurrence counting analysis for the pi-calculus. ENTCS 39(2), 1–18 (2001)Google Scholar
  9. 9.
    Gori, R., Levi, F.: A new occurrence counting analysis for bioambients. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 381–400. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Milanova, A., Rountev, A., Ryder, B.G.: Parameterized object sensitivity for points-to analysis for java. ACM Trans. Softw. Eng. Methodol. 14, 1–41 (2005)CrossRefGoogle Scholar
  12. 12.
    Schäfer, J., Poetzsch-Heffter, A.: JCoBox: Generalizing Active Objects to Concurrent Components. In: D’Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 275–299. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Smaragdakis, Y., Bravenboer, M., Lhoták, O.: Pick your contexts well: understanding object-sensitivity. In: Procs. of POPL 2011, pp. 17–30. ACM (2011)Google Scholar
  14. 14.
    Yonezawa, A., Briot, J.P., Shibayama, E.: Object-oriented concurrent programming ABCL/1. In: Procs. of OOPLSA 1986, pp. 258–268. ACM, USA (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Elvira Albert
    • 1
  • Jesús Correas
    • 1
  • Germán Puebla
    • 2
  • Guillermo Román-Díez
    • 2
  1. 1.DSICComplutense University of Madrid (UCM)Spain
  2. 2.DLSIISTechnical University of Madrid (UPM)Spain

Personalised recommendations