{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:04:38Z","timestamp":1742911478702,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819983100"},{"type":"electronic","value":"9789819983117"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-8311-7_14","type":"book-chapter","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T07:02:17Z","timestamp":1700636537000},"page":"290-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["m-CFA Exhibits Perfect Stack Precision"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4903-5645","authenticated-orcid":false,"given":"Kimball","family":"Germane","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"14_CR1","volume-title":"Compiling with Continuations","author":"AW Appel","year":"1992","unstructured":"Appel, A.W.: Compiling with Continuations. Cambridge University Press, Cambridge (1992)"},{"key":"14_CR2","unstructured":"Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine, and the $$\\lambda $$-calculus. In: Wirsing, M. (ed.) Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2\/WG 2.2 Working Conference on Formal Description of Programming Concepts - III, Ebberup, Denmark, 25\u201328 August 1986, pp. 193\u2013222. North-Holland (1987)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Fischer, M.J.: Lambda calculus schemata. In: Proceedings of ACM Conference on Proving Assertions About Programs, 6\u20137 January 1972, Las Cruces, New Mexico, USA, pp. 104\u2013109. ACM (1972)","DOI":"10.1145\/942578.807077"},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/173262.155113","volume":"28","author":"C Flanagan","year":"1993","unstructured":"Flanagan, C., Sabry, A., Duba, B.F., Felleisen, M.: The essence of compiling with continuations. SIGPLAN Not. 28(6), 237\u2013247 (1993)","journal-title":"SIGPLAN Not."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-030-11245-5_10","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K Germane","year":"2019","unstructured":"Germane, K., Might, M.: Relatively complete pushdown analysis of escape continuations. In: Enea, C., Piskac, R. (eds.) VMCAI 2019. LNCS, vol. 11388, pp. 205\u2013225. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11245-5_10"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Gilray, T., Lyde, S., Adams, M.D., Might, M., Van Horn, D.: Pushdown control-flow analysis for free. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201916, pp. 691\u2013704. ACM, New York (2016)","DOI":"10.1145\/2837614.2837631"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Johnson, J.I., Van Horn, D.: Abstracting abstract control. In: Proceedings of the 10th ACM Symposium on Dynamic Languages, DLS \u201914, pp. 11\u201322. ACM, New York (2014)","DOI":"10.1145\/2661088.2661098"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Kennedy, A.: Compiling with continuations, continued. In: Hinze, R., Ramsey, N. (eds.) Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, 1\u20133 October 2007, Freiburg, Germany, pp. 177\u2013190. ACM (2007)","DOI":"10.1145\/1291220.1291179"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Kranz, D.A., Kelsey, R., Rees, J., Hudak, P., Philbin, J.: ORBIT: an optimizing compiler for scheme. In: Wexelblat, R.L. (ed.) Proceedings of the 1986 SIGPLAN Symposium on Compiler Construction, 25\u201327 June 1986, Palo Alto, California, USA, pp. 219\u2013233. ACM (1986)","DOI":"10.1145\/13310.13333"},{"key":"14_CR10","unstructured":"Might, C.E.M., Horn, D.V.: Pushdown control-flow analysis of higher-order programs: precise, polyvariant and polynomial-time. In: Scheme Workshop (2010)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Might, M., Shivers, O.: Environment analysis via delta CFA. In: Morrisett, J.G., Jones, S.L.P. (eds.) Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, 11\u201313 January 2006, Charleston, South Carolina, USA, pp. 127\u2013140. ACM (2006)","DOI":"10.1145\/1111037.1111049"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Might, M., Shivers, O.: Improving flow analyses via gammaCFA: abstract garbage collection and counting. In: Proceedings of the Eleventh ACM SIGPLAN International Conference on Functional Programming, ICFP \u201906, pp. 13\u201325. ACM, New York (2006)","DOI":"10.1145\/1160074.1159807"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Might, M., Smaragdakis, Y., Van Horn, D.: Resolving and exploiting the k-CFA paradox: illuminating functional vs. object-oriented program analysis. In: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI \u201910, pp. 305\u2013315. ACM, New York (2010)","DOI":"10.1145\/1809028.1806631"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/200994.201001","volume":"17","author":"J Palsberg","year":"1995","unstructured":"Palsberg, J.: Closure analysis in constraint form. ACM Trans. Program. Lang. Syst. 17(1), 47\u201362 (1995)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Sabry, A., Felleisen, M.: Is continuation-passing useful for data flow analysis? In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation, PLDI \u201994, pp. 1\u201312. Association for Computing Machinery, New York (1994)","DOI":"10.1145\/178243.178244"},{"key":"14_CR16","unstructured":"Shivers, O.: Control-Flow Analysis of Higher-Order Languages. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1991)"},{"key":"14_CR17","volume-title":"RABBIT: A Compiler for Scheme","author":"GL Steele Jr","year":"1978","unstructured":"Steele, G.L., Jr.: RABBIT: A Compiler for Scheme. Massachusetts Institute of Technology, Cambridge (1978)"},{"issue":"2\u20133","key":"14_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1020887011500","volume":"15","author":"H Thielecke","year":"2002","unstructured":"Thielecke, H.: Comparing control constructs by double-barrelled CPS. High. Order Symb. Comput. 15(2\u20133), 141\u2013160 (2002)","journal-title":"High. Order Symb. Comput."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Van Horn, D., Might, M.: Abstracting abstract machines. In: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP \u201910, pp. 51\u201362. ACM, New York (2010)","DOI":"10.1145\/1863543.1863553"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-642-11957-6_30","volume-title":"Programming Languages and Systems","author":"D Vardoulakis","year":"2010","unstructured":"Vardoulakis, D., Shivers, O.: CFA2: a context-free approach to control-flow analysis. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 570\u2013589. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11957-6_30"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Vardoulakis, D., Shivers, O.: Ordering multiple continuations on the stack. In: Khoo, S., Siek, J.G. (eds.) Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2011, 24\u201325 January 2011, Austin, TX, USA, pp. 13\u201322. ACM (2011)","DOI":"10.1145\/1929501.1929504"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Vardoulakis, D., Shivers, O.: Pushdown flow analysis of first-class control. In: Chakravarty, M.M.T., Hu, Z., Danvy, O. (eds.) Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, 19\u201321 September 2011, Tokyo, Japan, pp. 69\u201380. ACM (2011)","DOI":"10.1145\/2034773.2034785"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8311-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T16:26:08Z","timestamp":1730564768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8311-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819983100","9789819983117"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8311-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}