{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:24:32Z","timestamp":1770269072124,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030644369","type":"print"},{"value":"9783030644376","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64437-6_1","type":"book-chapter","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T13:02:45Z","timestamp":1606395765000},"page":"3-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Set-Based Context Model for Program Analysis"],"prefix":"10.1007","author":[{"given":"Leandro","family":"Fachinetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Palmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayaka","family":"Yorihiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Agesen, O.: The Cartesian product algorithm: simple and precise type inference of parametric polymorphism. In: ECOOP (1995)","DOI":"10.1007\/3-540-58485-4_34"},{"key":"1_CR2","unstructured":"Besson, F.: CPA beats $$\\infty $$-CFA. In: Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs (2009)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bravenboer, M., Smaragdakis, Y.: Strictly declarative specification of sophisticated points-to analyses. In: OOPSLA (2009)","DOI":"10.1145\/1640089.1640108"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Darais, D., Labich, N., Nguyen, P.C., Horn, D.V.: Abstracting definitional interpreters. CoRR (2017)","DOI":"10.1145\/3110256"},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1145\/267959.269970","volume":"19","author":"E Duesterwald","year":"1997","unstructured":"Duesterwald, E., Gupta, R., Soffa, M.L.: A practical framework for demand-driven interprocedural data flow analysis. TOPLAS 19(6), 992\u20131030 (1997)","journal-title":"TOPLAS"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3310340","volume":"41","author":"L Facchinetti","year":"2019","unstructured":"Facchinetti, L., Palmer, Z., Smith, S.: Higher-order demand-driven program analysis. TOPLAS 41, 1\u201353 (2019)","journal-title":"TOPLAS"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Facchinetti, L., Palmer, Z., Smith, S.F.: Relative store fragments for singleton abstraction. In: Static Analysis (2017)","DOI":"10.1007\/978-3-319-66706-5_6"},{"key":"1_CR8","unstructured":"Fachinetti, L., Palmer, Z., Smith, S.F., Wu, K., Yorihiro, A.: Appendices to a set-based context model for program analysis (2020). https:\/\/www.cs.swarthmore.edu\/~zpalmer\/publications\/supplemental\/aplas2020-supplement.pdf"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Rehof, J., Das, M.: Scalable context-sensitive flow analysis using instantiation constraints. In: PLDI (2000)","DOI":"10.1145\/349299.349332"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-030-11245-5_11","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K Germane","year":"2019","unstructured":"Germane, K., McCarthy, J., Adams, M.D., Might, M.: Demand control-flow analysis. In: Enea, C., Piskac, R. (eds.) VMCAI 2019. LNCS, vol. 11388, pp. 226\u2013246. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11245-5_11"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Gilray, T., Adams, M.D., Might, M.: Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysis. In: ICFP (2016)","DOI":"10.1145\/2951913.2951936"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Gilray, T., Lyde, S., Adams, M.D., Might, M., Van Horn, D.: Pushdown control-flow analysis for free. In: POPL (2016)","DOI":"10.1145\/2837614.2837631"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Demand-driven pointer analysis. In: PLDI (2001)","DOI":"10.1145\/378795.378802"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F Henglein","year":"1993","unstructured":"Henglein, F.: Type inference with polymorphic recursion. TOPLAS 15(2), 253\u2013289 (1993)","journal-title":"TOPLAS"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T., Sagiv, M.: Demand interprocedural dataflow analysis. In: SIGSOFT (1995)","DOI":"10.1145\/222124.222146"},{"issue":"OOPSLA","key":"1_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/3276510","volume":"2","author":"M Jeon","year":"2018","unstructured":"Jeon, M., Jeong, S., Oh, H.: Precise and scalable points-to analysis via data-driven context tunneling. Proc. ACM Program. Lang. 2(OOPSLA), 29 (2018)","journal-title":"Proc. ACM Program. Lang."},{"issue":"OOPSLA","key":"1_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3133924","volume":"1","author":"S Jeong","year":"2017","unstructured":"Jeong, S., Jeon, M., Cha, S., Oh, H.: Data-driven context-sensitivity for points-to analysis. Proc. ACM Program. Lang. 1(OOPSLA), 1\u201328 (2017)","journal-title":"Proc. ACM Program. Lang."},{"issue":"2\u20133","key":"1_CR18","first-page":"218","volume":"24","author":"JI Johnson","year":"2014","unstructured":"Johnson, J.I., Sergey, I., Earl, C., Might, M., Van Horn, D.: Pushdown flow analysis with abstract garbage collection. JFP 24(2\u20133), 218\u2013283 (2014)","journal-title":"JFP"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Johnson, J.I., Van Horn, D.: Abstracting abstract control. In: DLS (2014)","DOI":"10.1145\/2661088.2661098"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1391984.1391987","volume":"18","author":"O Lhot\u00e1k","year":"2008","unstructured":"Lhot\u00e1k, O., Hendren, L.: Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation. TOSEM 18(1), 31\u2013353 (2008)","journal-title":"TOSEM"},{"issue":"OOPSLA","key":"1_CR21","first-page":"141:1","volume":"2","author":"Y Li","year":"2018","unstructured":"Li, Y., Tan, T., M\u00f8ller, A., Smaragdakis, Y.: Precision-guided context sensitivity for pointer analysis. Proc. ACM Program. Lang. 2(OOPSLA), 141:1\u2013141:29 (2018)","journal-title":"Proc. ACM Program. Lang."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Li, Y., Tan, T., M\u00f8ller, A., Smaragdakis, Y.: Scalability-first pointer analysis with self-tuning context-sensitivity. In: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/FSE 2018 (2018)","DOI":"10.1145\/3236024.3236041"},{"key":"1_CR23","unstructured":"Might, M.: Environment Analysis of Higher-order Languages. Ph.D. thesis (2007)"},{"key":"1_CR24","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: PLDI (2010)","DOI":"10.1145\/1806596.1806631"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044834.1044835","volume":"14","author":"A Milanova","year":"2005","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Parameterized object sensitivity for points-to analysis for Java. TOSEM 14(1), 1\u201341 (2005)","journal-title":"TOSEM"},{"key":"1_CR26","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. Autom. Lang. Comb. 6, 519\u2013535 (2001)","journal-title":"J. Autom. Lang. Comb."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-base flow analysis: from polymorphic subtyping to CFL-reachability. In: POPL (2001)","DOI":"10.1145\/360204.360208"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Reps, T.: Shape analysis as a generalized path problem. In: PEPM (1995)","DOI":"10.1145\/215465.215466"},{"issue":"1","key":"1_CR29","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/345099.345137","volume":"22","author":"T Reps","year":"2000","unstructured":"Reps, T.: Undecidability of context-sensitive data-dependence analysis. TOPLAS 22(1), 162\u2013186 (2000)","journal-title":"TOPLAS"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: POPL (1995)","DOI":"10.1145\/199448.199462"},{"key":"1_CR31","series-title":"The Springer International Series in Engineering and Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-1-4615-2207-2_8","volume-title":"Applications of Logic Databases","author":"TW Reps","year":"1995","unstructured":"Reps, T.W.: Demand interprocedural program analysis using logic databases. In: Ramakrishnan, R. (ed.) Applications of Logic Databases. SECS, vol. 296, pp. 163\u2013196. Springer, Boston (1995). https:\/\/doi.org\/10.1007\/978-1-4615-2207-2_8"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental and demand-driven points-to analysis using logic programming. In: PPDP (2005)","DOI":"10.1145\/1069774.1069785"},{"key":"1_CR33","unstructured":"Shivers, O.G.: Control-flow Analysis of Higher-order Languages. Ph.D. thesis, uMI Order No. GAX91-26964 (1991)"},{"issue":"POPL","key":"1_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290361","volume":"3","author":"J Sp\u00e4th","year":"2019","unstructured":"Sp\u00e4th, J., Ali, K., Bodden, E.: Context-, flow-, and field-sensitive data-flow analysis using synchronized pushdown systems. Proc. ACM Program. Lang. 3(POPL), 1\u201329 (2019)","journal-title":"Proc. ACM Program. Lang."},{"key":"1_CR35","unstructured":"Sp\u00e4th, J., Do, L.N.Q., Ali, K., Bodden, E.: Boomerang: demand-driven flow- and context-sensitive pointer analysis for Java. In: ECOOP (2016)"},{"issue":"OOPSLA","key":"1_CR36","first-page":"1","volume":"1","author":"J Sp\u00e4th","year":"2017","unstructured":"Sp\u00e4th, J., Ali, K., Bodden, E.: Ideal: efficient and precise alias-aware data-flow analysis. PACMPL 1(OOPSLA), 1\u201327 (2017)","journal-title":"PACMPL"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-662-53413-7_24","volume-title":"Static Analysis","author":"T Tan","year":"2016","unstructured":"Tan, T., Li, Y., Xue, J.: Making k-object-sensitive pointer analysis more precise with still k-limiting. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 489\u2013510. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_24"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Van Horn, D., Might, M.: Abstracting abstract machines. In: ICFP (2010)","DOI":"10.1145\/1863543.1863553"},{"key":"1_CR39","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"},{"issue":"1","key":"1_CR40","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/271510.271523","volume":"20","author":"AK Wright","year":"1998","unstructured":"Wright, A.K., Jagannathan, S.: Polymorphic splitting: an effective polyvariant flow analysis. TOPLAS 20(1), 166\u2013207 (1998)","journal-title":"TOPLAS"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Su, Z.: Context-sensitive data-dependence analysis via linear conjunctive language reachability. In: POPL (2017)","DOI":"10.1145\/3009837.3009848"}],"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-3-030-64437-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:47:47Z","timestamp":1619268467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64437-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030644369","9783030644376"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64437-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 November 2020","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":"Fukuoka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2020\/","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.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","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":"17","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":"2","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":"37% - 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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}