{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:42Z","timestamp":1772164002300,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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":[[2011,6,4]]},"DOI":"10.1145\/1993498.1993559","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T07:53:52Z","timestamp":1307346832000},"page":"516-527","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Mining hot calling contexts in small space"],"prefix":"10.1145","author":[{"given":"Daniele Cono","family":"D'Elia","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camil","family":"Demetrescu","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"Finocchi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/989393.989451"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/258916.258924"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/586094.586104"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378832"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/243846.243857"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268958"},{"key":"e_1_3_2_1_8_1","volume-title":"Incremental call-path profiling. Technical report","author":"Bernat A. R.","year":"2004","unstructured":"A. R. Bernat and B. P. Miller . Incremental call-path profiling. Technical report , University of Wisconsin , 2004 . A. R. Bernat and B. P. Miller. Incremental call-path profiling. Technical report, University of Wisconsin, 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2005.16"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2005.28"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297105.1297035"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380220502"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"e_1_3_2_1_14_1","volume-title":"Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems","author":"Demetrescu C.","year":"2007","unstructured":"C. Demetrescu and I. Finocchi . Algorithms for data streams . In Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems . John Wiley and Sons , 2007 . C. Demetrescu and I. Finocchi. Algorithms for data streams. In Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems. John Wiley and Sons, 2007."},{"key":"e_1_3_2_1_15_1","first-page":"62","volume-title":"Proc. 2003 IEEE Symposium on Security and Privacy, SP '03","author":"Feng H. H.","unstructured":"H. H. Feng , O. M. Kolesnikov , P. Fogla , W. Lee , and W. Gong . Anomaly detection using call stack information . In Proc. 2003 IEEE Symposium on Security and Privacy, SP '03 , pages 62 --. IEEE Computer Society, 2003. ISBN 0-7695-1940-7. H. H. Feng, O. M. Kolesnikov, P. Fogla, W. Lee, and W. Gong. Anomaly detection using call stack information. In Proc. 2003 IEEE Symposium on Security and Privacy, SP '03, pages 62--. IEEE Computer Society, 2003. ISBN 0-7695-1940-7."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088149.1088161"},{"key":"e_1_3_2_1_17_1","first-page":"49","volume-title":"Best of PLDI","author":"Graham S. L.","year":"1982","unstructured":"S. L. Graham , P. B. Kessler , and M. K. McKusick . gprof: a call graph execution profiler (with retrospective) . In K. S. McKinley, editor, Best of PLDI , pages 49 -- 57 . ACM, 1982 . ISBN 1-58113-623-4. S. L. Graham, P. B. Kessler, and M. K. McKusick. gprof: a call graph execution profiler (with retrospective). In K. S. McKinley, editor, Best of PLDI, pages 49--57. ACM, 1982. ISBN 1-58113-623-4."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.391375"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc.","author":"Hall R. J.","year":"1993","unstructured":"R. J. Hall and A. J. Goldberg . Call path profiling of monotonic program resources in UNIX . In Proc. Summer 1993 USENIX Technical Conference, pages 1--19. USENIX Association , 1993. R. J. Hall and A. J. Goldberg. Call path profiling of monotonic program resources in UNIX. In Proc. Summer 1993 USENIX Technical Conference, pages 1--19. USENIX Association, 1993."},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. 4th ACM Workshop on Feedback-Directed and Dynamic Optimization","author":"Hirzel M.","year":"2001","unstructured":"M. Hirzel and T. Chilimbi . Bursty tracing: A framework for low-overhead temporal profiling . In Proc. 4th ACM Workshop on Feedback-Directed and Dynamic Optimization , 2001 . M. Hirzel and T. Chilimbi. Bursty tracing: A framework for low-overhead temporal profiling. In Proc. 4th ACM Workshop on Feedback-Directed and Dynamic Optimization, 2001."},{"key":"e_1_3_2_1_21_1","volume-title":"CGO, page 239","author":"Joshi R.","year":"2004","unstructured":"R. Joshi , M. D. Bond , and C. Zilles . Targeted path profiling: Lower overhead path profiling for staged dynamic optimization systems . In CGO, page 239 . IEEE Computer Society , 2004 . R. Joshi, M. D. Bond, and C. Zilles. Targeted path profiling: Lower overhead path profiling for staged dynamic optimization systems. In CGO, page 239. IEEE Computer Society, 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/301631.301678"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781148"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065034"},{"key":"e_1_3_2_1_25_1","first-page":"346","volume-title":"VLDB","author":"Manku G. S.","year":"2002","unstructured":"G. S. Manku and R. Motwani . Approximate frequency counts over data streams . In VLDB , pages 346 -- 357 . Morgan Kaufmann , 2002 . G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB, pages 346--357. Morgan Kaufmann, 2002."},{"key":"e_1_3_2_1_26_1","unstructured":"D.\n      Melski\n     and \n      T. W.\n      Reps\n  . \n  Interprocedural path profiling\n  . In S. J\u00e4hnichen editor CC volume \n  1575\n   of \n  Lecture Notes in Computer Science pages \n  47\n  --\n  62\n  . \n  Springer 1999\n  . ISBN 3--540--65717--7.   D. Melski and T. W. Reps. Interprocedural path profiling. In S. J\u00e4hnichen editor CC volume 1575 of Lecture Notes in Computer Science pages 47--62. Springer 1999. ISBN 3--540--65717--7."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166084"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250746"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/302405.302637"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380180506"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.11"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.12"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.562"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190268"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337483"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134012"}],"event":{"name":"PLDI '11: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"San Jose California USA","acronym":"PLDI '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993498.1993559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:04Z","timestamp":1750230004000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993498.1993559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":36,"alternative-id":["10.1145\/1993498.1993559","10.1145\/1993498"],"URL":"https:\/\/doi.org\/10.1145\/1993498.1993559","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1993316.1993559","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}