{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T15:08:29Z","timestamp":1723993709589},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2015,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            When reasoning about distributed systems, it is essential to have information about the different kinds of nodes that 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\n            <jats:italic>abstraction<\/jats:italic>\n            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\n            <jats:italic>resource analysis<\/jats:italic>\n            that limit the number of concrete instances that the nodes and arcs represent and their resource consumption. The information available in our\n            <jats:italic>quantified abstract configurations<\/jats:italic>\n            allows us to define performance indicators which measure the quality of the system. In particular, we present several indicators that assess the level of distribution in the system, the amount of communication among distributed nodes that it requires, and how balanced the load of the distributed nodes that compose the system is. Our performance indicators are given as functions on the input data sizes, and they can be used to automate the comparison of different distributed settings and guide towards finding the optimal configuration.\n          <\/jats:p>","DOI":"10.1007\/s00165-014-0321-z","type":"journal-article","created":{"date-parts":[[2014,11,5]],"date-time":"2014-11-05T08:16:59Z","timestamp":1415175419000},"page":"665-699","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantified abstract configurations of distributed systems"],"prefix":"10.1145","volume":"27","author":[{"given":"Elvira","family":"Albert","sequence":"first","affiliation":[{"name":"Departamento Sistemas Inform\u00e1ticos y Computaci\u00f3n (DSIC), Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, C\/Prof. Jos\u00e9 Garc\u00eda Santesmases, s\/n, 28040, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas","family":"Correas","sequence":"additional","affiliation":[{"name":"Departamento Sistemas Inform\u00e1ticos y Computaci\u00f3n (DSIC), Facultad de Inform\u00e1tica, Universidad Complutense de Madrid, C\/Prof. Jos\u00e9 Garc\u00eda Santesmases, s\/n, 28040, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Puebla","sequence":"additional","affiliation":[{"name":"Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Espa\u00f1a"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Rom\u00e1n-D\u00edez","sequence":"additional","affiliation":[{"name":"Campus de Montegancedo, 28660, Boadilla del Monte, Madrid, Espa\u00f1a"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Albert E Arenas P Genaim S Puebla G Zanardini D (2007) Cost analysis of Java bytecode. In: De Nicola R (ed) Proceedings of the 16th European symposium on programming (ESOP\u201907). Lecture notes in computer science vol 4421. Springer New York pp 157\u2013172","DOI":"10.1007\/978-3-540-71316-6_12"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Albert E Arenas P Genaim S Herraiz I Puebla G (2010) Comparing cost functions in resource analysis. In: 1st International workshop on foundational and practical aspects of resource analysis (FOPARA\u201909). Lecture notes in computer science vol 6234. Springer New York pp 1\u201317","DOI":"10.1007\/978-3-642-15331-0_1"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"crossref","unstructured":"Albert E Arenas P Genaim S G\u00f3mez-Zamalloa M Puebla G (2011) Cost analysis of concurrent oo programs. In: Proceedings of APLAS\u201911. LNCS vol 7078. Springer New York pp 238\u2013254","DOI":"10.1007\/978-3-642-25318-8_19"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Albert E Arenas P Genaim S G\u00f3mez-Zamalloa M Puebla G (2012) COSTABS: a cost and termination analyzer for ABS. In: Proceedings of PEPM\u201912. ACM Press New York pp 151\u2013154","DOI":"10.1145\/2103746.2103774"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.07.009"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","unstructured":"Albert E Arenas P Genaim S Puebla G (2008) Automatic inference of upper bounds for recurrence relations in cost analysis. In: Proceedings of SAS\u201908. Lecture notes in computer science vol 5079. Springer New York pp 221\u2013237","DOI":"10.1007\/978-3-540-69166-2_15"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9174-1"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"crossref","unstructured":"Albert E Correas J Puebla G Rom\u00e1n-D\u00edez G (2013) Quantified abstractions of distributed systems. In: Proceedings of iFM\u201913. LNCS vol 7940. Springer New York pp 285\u2013300","DOI":"10.1007\/978-3-642-38613-8_20"},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"crossref","unstructured":"Albert E Flores-Montoya A Genaim S Martin-Martin E (2013) Termination and cost analysis of loops with concurrent interleavings. In: ATVA\u201913 LNCS vol 8172. Springer New York pp 349\u2013364","DOI":"10.1007\/978-3-319-02444-8_25"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BF01887214","article-title":"Issues in the design of a parallel object-oriented language","volume":"1","author":"America P","year":"1989","journal-title":"Form Asp Comput"},{"key":"e_1_2_1_2_11_2","unstructured":"Albert E Arenas P Correas J G\u00f3mez-Zamalloa M Genaim S Puebla G Rom\u00e1n-D\u00edez G (2012) Object-sensitive cost analysis for concurrent objects. http:\/\/costa.ls.fi.upm.es\/papers\/costa\/AlbertACGGPRtr.pdf. Accessed 15 May 2014"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.17713\/ajs.v38i3.272"},{"key":"e_1_2_1_2_13_2","volume-title":"Concurrent programming in Erlang","author":"Armstrong J","year":"1996"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1216374.1216378"},{"issue":"1","key":"e_1_2_1_2_15_2","first-page":"29","article-title":"User-defined schedulers for real-time concurrent objects","volume":"9","author":"Bj\u00f8rk J","year":"2013","journal-title":"ISSE"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2008.12.001"},{"key":"e_1_2_1_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/162685.162711"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2012.03.009"},{"key":"e_1_2_1_2_19_2","first-page":"37","article-title":"Quantitative static analysis of distributed systems","volume":"1","author":"Di Pierro A","year":"2005","journal-title":"J Funct Program"},{"issue":"2","key":"e_1_2_1_2_20_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S1571-0661(05)01155-2","article-title":"Occurrence counting analysis for the pi-calculus","volume":"39","author":"Feret J","year":"2001","journal-title":"Electron Notes Theor Comput Sci"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"crossref","unstructured":"Flores-Montoya A Albert E Genaim S (2013) May-happen-in-parallel based deadlock analysis for concurrent objects. In: FORTE\u201913. LNCS. Springer New York pp 273\u2013288","DOI":"10.1007\/978-3-642-38592-6_19"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"crossref","unstructured":"Gori R Levi F (2005) A new occurrence counting analysis for bioambients. In: APLAS. LNCS vol 3780. Springer New York pp 381\u2013400","DOI":"10.1007\/11575467_25"},{"key":"e_1_2_1_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.019"},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"crossref","unstructured":"Johnsen EB H\u00e4hnle R Sch\u00e4fer J Schlatte R Steffen M (2012) ABS: a core language for abstract behavioral specification. In: Proceedings of FMCO\u201910 (revised papers). LNCS vol 6957. Springer New York pp 142\u2013164","DOI":"10.1007\/978-3-642-25271-6_8"},{"key":"e_1_2_1_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/1044834.1044835"},{"key":"e_1_2_1_2_26_2","doi-asserted-by":"crossref","unstructured":"Smaragdakis Y Bravenboer M Lhot\u00e1k O (2011) Pick your contexts well: understanding object-sensitivity. In: Proceedings of POPL\u201911. ACM New York pp 17\u201330","DOI":"10.1145\/1925844.1926390"},{"key":"e_1_2_1_2_27_2","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer J Poetzsch-Heffter A (2010) JCobox: generalizing active objects to concurrent components. In: Proceedings of ECOOP\u201910. LNCS. Springer New York pp 275\u2013299","DOI":"10.1007\/978-3-642-14107-2_13"},{"key":"e_1_2_1_2_28_2","doi-asserted-by":"crossref","unstructured":"Yonezawa A Briot JP Shibayama E (1986) Object-oriented concurrent programming ABCL\/1. In: Proceedings of OOPLSA\u201986. ACM New York pp 258\u2013268","DOI":"10.1145\/28697.28722"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-014-0321-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-014-0321-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-014-0321-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T16:15:42Z","timestamp":1641485742000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-014-0321-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["10.1007\/s00165-014-0321-z"],"URL":"https:\/\/doi.org\/10.1007\/s00165-014-0321-z","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}