{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:28Z","timestamp":1750308088833,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,11,11]],"date-time":"2005-11-11T00:00:00Z","timestamp":1131667200000},"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":[],"published-print":{"date-parts":[[2005,11,11]]},"DOI":"10.1145\/1103626.1103634","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["On the effectiveness of automatic patching"],"prefix":"10.1145","author":[{"given":"Milan","family":"Vojnovi\u0106","sequence":"first","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayalvadi","family":"Ganesh","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1"},{"key":"e_1_3_2_1_3_1","unstructured":"M. Castro P. Druschel M. Jones A.-M. Kermarrec A. Rowstron and M. Theimer. Sim Pastry version 1.1. http:\/\/www.research.microsoft.com\/antr\/pastry\/download.htm 2002.  M. Castro P. Druschel M. Jones A.-M. Kermarrec A. Rowstron and M. Theimer. Sim Pastry version 1.1. http:\/\/www.research.microsoft.com\/antr\/pastry\/download.htm 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095824"},{"key":"e_1_3_2_1_5_1","unstructured":"http:\/\/www.caida.org\/analysis\/security\/witty 2005.  http:\/\/www.caida.org\/analysis\/security\/witty 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.71"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. QoS-IP","author":"Kesidis G.","year":"2005","unstructured":"G. Kesidis , I. Hamadeh , and S. Jiwasurat . Coupled Kermack-McKendrick Model for Randomly Scanning Worms and Bandwidth-staturating Internet Worms . In Proc. QoS-IP , Sicily, Italy , February 2005 . G. Kesidis, I. Hamadeh, and S. Jiwasurat. Coupled Kermack-McKendrick Model for Randomly Scanning Worms and Bandwidth-staturating Internet Worms. In Proc. QoS-IP, Sicily, Italy, February 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSECP.2003.1219056"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209212"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_12_1","volume-title":"Heildelberg","author":"Druschel A. Rowstronand P.","year":"2001","unstructured":"A. Rowstronand P. Druschel . Pastry : Scalable, distributed object location and routing for large-scalepeer-to-peer systems. In IFIP\/ACM Int'l Conf. on Distributed Systems Platforms(Middleware), pages 329--350 , Heildelberg , Germany , November 2001 . A. Rowstronand P. Druschel. Pastry: Scalable, distributed object location and routing for large-scalepeer-to-peer systems. In IFIP\/ACM Int'l Conf. on Distributed Systems Platforms(Middleware), pages 329--350, Heildelberg, Germany, November 2001."},{"key":"e_1_3_2_1_13_1","volume-title":"How to Own Internet in your Spare Time","author":"Staniford N. Weaver S.","year":"2004","unstructured":"N. Weaver S. Staniford , V. Paxson . How to Own Internet in your Spare Time . In IEEE Security & Privacy , 2004 . N. Weaver S. Staniford, V. Paxson. How to Own Internet in your Spare Time. In IEEE Security & Privacy, 2004."},{"key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","volume-title":"Journal of Computer Security( ToAppear)","author":"Staniford S.","year":"2004","unstructured":"S. Staniford . Containment of scanning worms inenterprise networks . Journal of Computer Security( ToAppear) , 2004 . S. Staniford. Containment of scanning worms inenterprise networks. Journal of Computer Security( ToAppear), 2004."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_3_2_1_17_1","volume-title":"ACSAC","author":"Williamson M. M.","year":"2002","unstructured":"M. M. Williamson . Throttling viruses : Restricting propagation to defeat malicious mobile code . In ACSAC , 2002 . M. M. Williamson. Throttling viruses: Restricting propagation to defeat malicious mobile code. In ACSAC, 2002."},{"key":"e_1_3_2_1_18_1","volume-title":"Florence","author":"Wong C.","year":"2004","unstructured":"C. Wong , C. Wang , D. Song , S. Bielski , and G. R. Ganger . Dynamic quarantine of internet worms.InProc. of the Internationa lConferenceon Dependable Systems and Networks(DSN-2004) , Florence , Italy , June 2004 . C. Wong, C. Wang, D. Song, S. Bielski, and G. R. Ganger. Dynamic quarantine of internet worms.InProc. of the Internationa lConferenceon Dependable Systems and Networks(DSN-2004), Florence, Italy, June 2004."},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of the INFOCOM'96","author":"Zegura E.","year":"1996","unstructured":"E. Zegura and S. Bhattacharjee . How to model an internet work . In Proc. of the INFOCOM'96 , San Francisco, California , 1996 . E. Zegura and S. Bhattacharjee. How to model an internet work. In Proc. of the INFOCOM'96, San Francisco, California, 1996."}],"event":{"name":"CCS05: 12th ACM Conference on Computer and Communications Security 2005","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Fairfax VA USA","acronym":"CCS05"},"container-title":["Proceedings of the 2005 ACM workshop on Rapid malcode"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103626.1103634","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1103626.1103634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:52Z","timestamp":1750262872000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103626.1103634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,11]]},"references-count":18,"alternative-id":["10.1145\/1103626.1103634","10.1145\/1103626"],"URL":"https:\/\/doi.org\/10.1145\/1103626.1103634","relation":{},"subject":[],"published":{"date-parts":[[2005,11,11]]},"assertion":[{"value":"2005-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}