{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:15Z","timestamp":1750307895559,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2008,6]]},"abstract":"<jats:p>Decomposing distributed systems into modules, each with a precise interface and a functional implementation independent specification, is highly effective both from a software engineering point of view and for theoretical purposes. The usefulness of this approach has been demonstrated in the past in several areas of distributed computing. Yet, despite its attractiveness, so far work on peer to peer systems failed to do so. This paper argues in favor of this approach and advocates such a decomposition for peer to peer systems. This allows designers to understand and explain both what a system does and how it does it.<\/jats:p>","DOI":"10.1145\/1388240.1388258","type":"journal-article","created":{"date-parts":[[2008,7,8]],"date-time":"2008-07-08T16:02:15Z","timestamp":1215532935000},"page":"91-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Modularity"],"prefix":"10.1145","volume":"39","author":[{"given":"Roy","family":"Friedman","sequence":"first","affiliation":[{"name":"Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Marie","family":"Kermarrec","sequence":"additional","affiliation":[{"name":"INRIA Bretagne-Atlantique, Rennes Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Rennes, Rennes Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"http:\/\/www.gnutella.com\/]]  http:\/\/www.gnutella.com\/]]"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/176575.176576"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782394.1782421"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.774912"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_3"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/945506.945507"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1176982"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/325164.325102"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/362670.362673"},{"volume-title":"The Java Language Specification","year":"1996","author":"Gosling J.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11734697_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275517.1275520"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_2_1_18_1","first-page":"402","volume-title":"Composition: A Way to Make Proofs Harder. Revised Lectures from the Int'l Symposium on Compositionality: The Significant Difference (COMPOS)","author":"Lamport L.","year":"1998"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2003.1209946"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/304065.304106"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646591.697650"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-4441-x"},{"key":"e_1_2_1_25_1","first-page":"393","article-title":"Collective dynamics of small-world networks","author":"Watts D. J.","year":"1998","journal-title":"Nature"},{"volume-title":"UCB\/CSD-01-1141, Computer Science Department","year":"2001","author":"Zhao B. Y.","key":"e_1_2_1_26_1"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1388240.1388258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1388240.1388258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:26Z","timestamp":1750258046000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1388240.1388258"}},"subtitle":["a first class concept to address distributed systems"],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["10.1145\/1388240.1388258"],"URL":"https:\/\/doi.org\/10.1145\/1388240.1388258","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2008,6]]},"assertion":[{"value":"2008-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}