{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:43:34Z","timestamp":1773193414436,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"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":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837619","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"678-690","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Casper: an efficient approach to call trace collection"],"prefix":"10.1145","author":[{"given":"Rongxin","family":"Wu","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, China"}]},{"given":"Xiao","family":"Xiao","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, China"}]},{"given":"Shing-Chi","family":"Cheung","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, China"}]},{"given":"Hongyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research, China"}]},{"given":"Charles","family":"Zhang","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, China"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Compilers: Principles, Techniques, and Tools (2Nd Edition)","author":"Aho A. V.","year":"2006","unstructured":"A. V. Aho , M. S. Lam , R. Sethi , and J. D. Ullman . Compilers: Principles, Techniques, and Tools (2Nd Edition) . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 2006 . A. V. Aho, M. S. Lam, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools (2Nd Edition). Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2006."},{"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.1007\/978-3-540-24851-4_8"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/183432.183527"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/243846.243857"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167488"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1297105.1297035"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806599"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287628"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/106972.107001"},{"key":"e_1_3_2_1_11_1","volume-title":"Introduction to algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , C. Stein , Introduction to algorithms , volume 2 . MIT press Cambridge , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, et al. Introduction to algorithms, volume 2. MIT press Cambridge, 2001."},{"key":"e_1_3_2_1_12_1","volume-title":"deflate compressed data format specification","author":"Deutsch P.","year":"1996","unstructured":"P. Deutsch . Rfc1951 , deflate compressed data format specification , 1996 . P. Deutsch. Rfc1951, deflate compressed data format specification, 1996."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502949.502878"},{"key":"e_1_3_2_1_14_1","volume-title":"Refactoring: Improving the design of existing code","author":"Fowler M.","year":"1997","unstructured":"M. Fowler . Refactoring: Improving the design of existing code , 1997 . M. Fowler. Refactoring: Improving the design of existing code, 1997."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453150"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639949.1640101"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2337223.2337241"},{"key":"e_1_3_2_1_18_1","author":"Hofmeyr S. A.","year":"1998","unstructured":"S. A. Hofmeyr , S. Forrest , and A. Somayaji . Intrusion detection using sequences of system calls. Journal of computer security , 1998 . S. A. Hofmeyr, S. Forrest, and A. Somayaji. Intrusion detection using sequences of system calls. Journal of computer security, 1998.","journal-title":"Journal of computer security"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/253228.253356"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321660"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2337223.2337279"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247660.1247669"},{"key":"e_1_3_2_1_23_1","volume-title":"Soot: a java optimization framework. See http:\/\/www. sable. mcgill. ca\/soot","author":"Lam P.","year":"2002","unstructured":"P. Lam , F. Qian , O. Lhotak , and E. Bodden . Soot: a java optimization framework. See http:\/\/www. sable. mcgill. ca\/soot , 2002 . P. Lam, F. Qian, O. Lhotak, and E. Bodden. Soot: a java optimization framework. See http:\/\/www. sable. mcgill. ca\/soot, 2002."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380201205"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301678"},{"key":"e_1_3_2_1_26_1","volume-title":"Usenix Security","author":"Lee W.","year":"1998","unstructured":"W. Lee and S. J. Stolfo . Data mining approaches for intrusion detection . In Usenix Security , 1998 . W. Lee and S. J. Stolfo. Data mining approaches for intrusion detection. In Usenix Security, 1998."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/780822.781148"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064978.1065014"},{"key":"e_1_3_2_1_29_1","volume-title":"On a test of whether one of two random variables is stochastically larger than the other. The annals of mathematical statistics","author":"Mann H. B.","year":"1947","unstructured":"H. B. Mann and D. R. Whitney . On a test of whether one of two random variables is stochastically larger than the other. The annals of mathematical statistics , 1947 . H. B. Mann and D. R. Whitney. On a test of whether one of two random variables is stochastically larger than the other. The annals of mathematical statistics, 1947."},{"key":"e_1_3_2_1_30_1","volume-title":"CC","author":"Melski D.","year":"1999","unstructured":"D. Melski and T. Reps . Interprocedural path profiling . In CC , 1999 . D. Melski and T. Reps. Interprocedural path profiling. In CC, 1999."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.21"},{"key":"e_1_3_2_1_32_1","volume-title":"ACM","author":"Miller B. P.","year":"1988","unstructured":"B. P. Miller and J.-D. Choi . A mechanism for efficient debugging of parallel programs . ACM , 1988 . B. P. Miller and J.-D. Choi. A mechanism for efficient debugging of parallel programs. ACM, 1988."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640102"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2610410"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693096"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168841"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.60"},{"key":"e_1_3_2_1_38_1","first-page":"298","volume-title":"ICSE \u201912","author":"Pradel M.","year":"2012","unstructured":"M. Pradel and T. R. Gross . Leveraging test generation and specification mining for automated bug detection without false positives . In ICSE \u201912 , pages 288\u2013 298 , Piscataway, NJ , USA, 2012 . IEEE Press . M. Pradel and T. R. Gross. Leveraging test generation and specification mining for automated bug detection without false positives. In ICSE \u201912, pages 288\u2013298, Piscataway, NJ, USA, 2012. IEEE Press."},{"key":"e_1_3_2_1_39_1","volume-title":"S&P","author":"Sekar R.","year":"2001","unstructured":"R. Sekar , M. Bendre , D. Dhurjati , and P. Bollineni . A fast automatonbased method for detecting anomalous program behaviors . In S&P , 2001 . R. Sekar, M. Bendre, D. Dhurjati, and P. Bollineni. A fast automatonbased method for detecting anomalous program behaviors. In S&P, 2001."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.12"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.70"},{"key":"e_1_3_2_1_42_1","volume-title":"Approximation Algorithms","author":"Vazirani V. V.","year":"2001","unstructured":"V. V. Vazirani . Approximation Algorithms . Springer-Verlag New York, Inc. , New York, NY, USA , 2001 . ISBN 3-540-65367-8. V. V. Vazirani. Approximation Algorithms. Springer-Verlag New York, Inc., New York, NY, USA, 2001. ISBN 3-540-65367-8."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2610386"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541940.2541968"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1218063.1217972"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2581122.2544150"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880037.1880038"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134012"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837619","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:37Z","timestamp":1750211017000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":48,"alternative-id":["10.1145\/2837614.2837619","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837619","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837619","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}