{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T05:42:21Z","timestamp":1751780541831,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,1,19]],"date-time":"2009-01-19T00:00:00Z","timestamp":1232323200000},"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":[[2009,1,19]]},"DOI":"10.1145\/1480945.1480967","type":"proceedings-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T14:41:38Z","timestamp":1232462498000},"page":"151-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["CCCP"],"prefix":"10.1145","author":[{"given":"Philippe","family":"Moret","sequence":"first","affiliation":[{"name":"University of Lugano, Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Binder","sequence":"additional","affiliation":[{"name":"University of Lugano, Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Villazon","sequence":"additional","affiliation":[{"name":"University of Lugano, Lugano, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,1,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.391.0211"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/258915.258924"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378832"},{"key":"e_1_3_2_1_4_1","volume-title":"IBM","author":"Arnold M.","year":"2000","unstructured":"M. Arnold and P. F. Sweeney . Approximating the calling context tree via sampling. Research report , IBM , July 2000 . M. Arnold and P. F. Sweeney. Approximating the calling context tree via sampling. Research report, IBM, July 2000."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294325.1294344"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.v39:1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1450095.1450116"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297027.1297035"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646157.679856"},{"key":"e_1_3_2_1_11_1","first-page":"167","volume-title":"1998 USENIX Annual Technical Symposium","author":"Cohen G.","year":"1998","unstructured":"G. Cohen , J. Chase , and D. Kaminsky . Automatic program transformation with JOIE . In 1998 USENIX Annual Technical Symposium , pages 167 -- 178 , 1998 . G. Cohen, J. Chase, and D. Kaminsky. Automatic program transformation with JOIE. In 1998 USENIX Annual Technical Symposium, pages 167--178, 1998."},{"key":"e_1_3_2_1_12_1","first-page":"31","article-title":"The efficient simulation of parallel computer systems","volume":"1","author":"Covington R.","year":"1991","unstructured":"R. Covington , S. Dwarkadas , J. Jump , J. Sinclair , and S. Madala . The efficient simulation of parallel computer systems . International Journal in Computer Simulation , 1 : 31 -- 58 , 1991 . R. Covington, S. Dwarkadas, J. Jump, J. Sinclair, and S. Madala. The efficient simulation of parallel computer systems. International Journal in Computer Simulation, 1:31--58, 1991.","journal-title":"International Journal in Computer Simulation"},{"key":"e_1_3_2_1_13_1","volume-title":"Java-Information-Tage 1999 (JIT'99)","author":"Dahm M.","year":"1999","unstructured":"M. Dahm . Byte code engineering . In Java-Information-Tage 1999 (JIT'99) , Sept. 1999 . http:\/\/jakarta.apache.org\/bcel\/ M. Dahm. Byte code engineering. In Java-Information-Tage 1999 (JIT'99), Sept. 1999. http:\/\/jakarta.apache.org\/bcel\/"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/949343.949320"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/974043.974085"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028976.1029000"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.v17:7\/8"},{"key":"e_1_3_2_1_18_1","unstructured":"ObjectWeb. ASM. Web pages at http:\/\/asm.objectweb.org\/  ObjectWeb. ASM. Web pages at http:\/\/asm.objectweb.org\/"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2007.06.001"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.562"},{"key":"e_1_3_2_1_21_1","unstructured":"Sun Microsystems Inc. Java Virtual Machine Profiler Interface (JVMPI). Web pages at http:\/\/java.sun.com\/j2se\/1.4.2\/docs\/guide\/jvmpi\/ 2000.  Sun Microsystems Inc. Java Virtual Machine Profiler Interface (JVMPI). Web pages at http:\/\/java.sun.com\/j2se\/1.4.2\/docs\/guide\/jvmpi\/ 2000."},{"key":"e_1_3_2_1_22_1","volume-title":"SPEC JVM98 Benchmarks. Web","author":"The Standard Performance Evaluation Corporation","year":"1998","unstructured":"The Standard Performance Evaluation Corporation . SPEC JVM98 Benchmarks. Web pages at http:\/\/www.spec.org\/osg\/jvm98\/, 1998 . The Standard Performance Evaluation Corporation. SPEC JVM98 Benchmarks. Web pages at http:\/\/www.spec.org\/osg\/jvm98\/, 1998."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1173706.1173720"},{"key":"e_1_3_2_1_24_1","first-page":"18","volume-title":"9th International Conference (CC 2000","author":"Vallee-Rai R.","year":"2000","unstructured":"R. Vallee-Rai , E. Gagnon , L. J. Hendren , P. Lam , P. Pominville , and V. Sundaresan . Optimizing Java bytecode using the Soot framework: Is it feasible? In Compiler Construction , 9th International Conference (CC 2000 ), pages 18 -- 34 , 2000 . R. Vallee-Rai, E. Gagnon, L. J. Hendren, P. Lam, P. Pominville, and V. Sundaresan. Optimizing Java bytecode using the Soot framework: Is it feasible? In Compiler Construction, 9th International Conference (CC 2000), pages 18--34, 2000."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/337449.337483"},{"key":"e_1_3_2_1_26_1","unstructured":"T. Wilkinson. Kaffe -- a Java virtual machine. Web pages at http:\/\/www.kaffe.org\/  T. Wilkinson. Kaffe -- a Java virtual machine. Web pages at http:\/\/www.kaffe.org\/"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134012"}],"event":{"name":"PEPM '09: Partial Evaluation and Program Manipulation","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Savannah GA USA","acronym":"PEPM '09"},"container-title":["Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480945.1480967","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1480945.1480967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:09Z","timestamp":1750253409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1480945.1480967"}},"subtitle":["complete calling context profiling in virtual execution environments"],"short-title":[],"issued":{"date-parts":[[2009,1,19]]},"references-count":27,"alternative-id":["10.1145\/1480945.1480967","10.1145\/1480945"],"URL":"https:\/\/doi.org\/10.1145\/1480945.1480967","relation":{},"subject":[],"published":{"date-parts":[[2009,1,19]]},"assertion":[{"value":"2009-01-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}