{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:25Z","timestamp":1740098965082,"version":"3.37.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319667058"},{"type":"electronic","value":"9783319667065"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66706-5_6","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T00:13:26Z","timestamp":1503015206000},"page":"106-127","source":"Crossref","is-referenced-by-count":2,"title":["Relative Store Fragments for Singleton Abstraction"],"prefix":"10.1007","author":[{"given":"Leandro","family":"Facchinetti","sequence":"first","affiliation":[]},{"given":"Zachary","family":"Palmer","sequence":"additional","affiliation":[]},{"given":"Scott F.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-49538-X_2","volume-title":"ECOOP 1995 \u2014 Object-Oriented Programming, 9th European Conference, \u00c5arhus, Denmark, August 7\u201311, 1995","author":"O Agesen","year":"1995","unstructured":"Agesen, O.: The cartesian product algorithm. In: Tokoro, M., Pareschi, R. (eds.) ECOOP 1995. LNCS, vol. 952, pp. 2\u201326. Springer, Heidelberg (1995). doi: 10.1007\/3-540-49538-X_2"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bod\u00edk, R., Anik, S.: Path-sensitive value-flow analysis. In: POPL (1998)","DOI":"10.1145\/268946.268966"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR \u201997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997). doi: 10.1007\/3-540-63141-0_10"},{"key":"6_CR4","unstructured":"Besson, F.: CPA beats $$\\infty $$ -CFA. In: Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs (2009)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Bergstrom, L., Fluet, M., Le, M., Reppy, J., Sandler, N.: Practical and effective higher-order optimizations. In: ICFP (2014)","DOI":"10.1145\/2628136.2628153"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1017\/S0956796800000496","volume":"2","author":"F Bourdoncle","year":"1992","unstructured":"Bourdoncle, F.: Abstract interpretation by dynamic partitioning. J. Funct. Program 2, 407\u2013423 (1992)","journal-title":"J. Funct. Program"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL (1977)","DOI":"10.1145\/512950.512973"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chase, D.R., Wegman, M., Zadeck, F.K.: Analysis of pointers and structures. In: PLDI (1990)","DOI":"10.1145\/93542.93585"},{"issue":"6","key":"6_CR9","doi-asserted-by":"crossref","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. ACM Trans. Program. Lang. Syst. 19(6), 992\u20131030 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR10","unstructured":"Das, M., Lerner, S., Mark Seigle, E.S.P.: Path-sensitive program verification in polynomial time. In: PLDI (2002)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Darais, D., Might, M., Van Horn, D.: Galois transformers and modular abstract interpreters. In: OOPSLA (2015)","DOI":"10.1145\/2814270.2814308"},{"key":"6_CR12","unstructured":"Earl, C., Might, M., Van Horn, D.: Pushdown control-flow analysis of higher-order programs. In: Workshop on Scheme and Functional Programming (2010)"},{"key":"6_CR13","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":"6_CR14","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Sabry, A., Duba, B.F., Felleisen, M.: The essence of compiling with continuations. In: PLDI (1993)","DOI":"10.1145\/155090.155113"},{"key":"6_CR15","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":"6_CR16","doi-asserted-by":"crossref","unstructured":"Germane, K., Might, M.: A posteriori environment analysis with pushdown Delta CFA. In: POPL (2017)","DOI":"10.1145\/3009837.3009899"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Handjieva, M., Tzolovski, S.: Refining static analyses by trace-based partitioning using control flow. In: Static Analysis Symposium (1998)","DOI":"10.1007\/3-540-49727-7_12"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Demand-driven pointer analysis. In: PLDI (2001)","DOI":"10.1145\/378795.378802"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Johnson, J.I., Labich, N., Might, M., Van Horn, D.: Optimizing abstract abstract machines. In: ICFP (2013)","DOI":"10.1145\/2500365.2500604"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Johnson, J.I., Sergey, I., Earl, C., Might, M., Van Horn, D.: Pushdown flow analysis with abstract garbage collection. In: JFP (2014)","DOI":"10.1017\/S0956796814000100"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Jagannathan, S., Thiemann, P., Weeks, S., Wright, A.K.: Single and loving it: must-alias analysis for higher-order languages. In: POPL (1998)","DOI":"10.1145\/268946.268973"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Midtgaard, J.: Control-flow analysis of functional programs. ACM Comput. Surv. 44, 10:1\u201310:33 (2012)","DOI":"10.1145\/2187671.2187672"},{"key":"6_CR23","unstructured":"Might, M.: Environment analysis of higher-order languages. PhD thesis, Georgia Institute of Technology (2007)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Might, M.: Abstract interpreters for free. In: Proceedings of the 17th International Conference on Static Analysis (2010)","DOI":"10.1007\/978-3-642-15769-1_25"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-11319-2_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M Might","year":"2010","unstructured":"Might, M.: Shape analysis in the absence of pointers and structure. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 263\u2013278. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-11319-2_20"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Might, M., Shivers, O.: Environment analysis via $$\\Delta $$ CFA. In: POPL (2006)","DOI":"10.1145\/1111037.1111049"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Might, M., Shivers, O.: Improving flow analyses via $$\\Gamma $$ CFA: abstract garbage collection and counting. In: ICFP, Portland, Oregon (2006)","DOI":"10.1145\/1159803.1159807"},{"key":"6_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, New York (1999)"},{"key":"6_CR29","unstructured":"Palmer, Z., Facchinetti, L.: DDPA implementation. https:\/\/github.com\/JHU-PL-Lab\/odefa\/tree\/sas2017-ddpa (2016)"},{"key":"6_CR30","unstructured":"Palmer, Z., Smith, S.: Higher-order demand-driven program analysis. In: ECOOP (2016)"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Reps, T.: Demand interprocedural program analysis using logic databases. In: Application of Logic Databases (1994)","DOI":"10.1007\/978-1-4615-2207-2_8"},{"key":"6_CR32","unstructured":"Reynolds, J.: Separation logic: a logic for shared mutable data structures. In: LICS (2002)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Rehof, J., F\u00e4hndrich, M.: Type-base flow analysis: from polymorphic subtyping to CFL-reachability. In: POPL. Springer, New York (2001)","DOI":"10.1145\/360204.360208"},{"key":"6_CR34","unstructured":"Sp\u00e4th, J., Do, L.N.Q., Ali, K., Bodden, E.: Demand-driven flow- and context-sensitive pointer analysis for Java. In: ECOOP, Boomerang (2016)"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Sergey, I., Devriese, D., Might, M., Midtgaard, J., Darais, D., Clarke, D., Piessens, F.: Monadic abstract interpreters. In: PLDI (2013)","DOI":"10.1145\/2491956.2491979"},{"key":"6_CR36","unstructured":"Shivers, O.: Control-flow analysis of higher-order languages. PhD thesis, Carnegie-Mellon University (1991). TR CMU-CS-91-145"},{"key":"6_CR37","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":"6_CR38","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/239912.239915","volume":"19","author":"PA Steckler","year":"1997","unstructured":"Steckler, P.A., Wand, M.: Lightweight closure conversion. ACM Trans. Program. Lang. Syst. 19, 48\u201386 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Tobin-Hochstadt, S., Felleisen, M.: Logical types for untyped languages. In: ICFP (2010)","DOI":"10.1145\/1863543.1863561"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Van Horn, D. Might, M.: Abstracting abstract machines. In: ICFP (2010)","DOI":"10.1145\/1863543.1863553"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Vardoulakis, D., Shivers, O.: CFA2: a context-free approach to control-flow analysis. In: European Symposium on Programming (2010)","DOI":"10.1007\/978-3-642-11957-6_30"},{"key":"6_CR42","unstructured":"Xie, Y., Chou, A., Engler, D.: Using symbolic, path-sensitive analysis to detect memory access errors. In: ESEC\/FSE, Archer (2003)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66706-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T10:40:03Z","timestamp":1570012803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66706-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319667058","9783319667065"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66706-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}