{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:44:22Z","timestamp":1725565462895},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157684"},{"type":"electronic","value":"9783642157691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15769-1_26","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T06:09:40Z","timestamp":1284358180000},"page":"422-438","source":"Crossref","is-referenced-by-count":1,"title":["Points-to Analysis as a System of Linear Equations"],"prefix":"10.1007","author":[{"given":"Rupesh","family":"Nasre","sequence":"first","affiliation":[]},{"given":"Ramaswamy","family":"Govindarajan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Andersen, L.O.: Program analysis and specialization for the C programming language. PhD Thesis, DIKU, University of Copenhagen (1994)","key":"26_CR1"},{"doi-asserted-by":"crossref","unstructured":"Berndl, M., Lhot\u00e1k, O., Qian, F., Hendren, L., Umanee, N.: Points-to analysis using BDDs. In: PLDI, pp. 103\u2013114 (2003)","key":"26_CR2","DOI":"10.1145\/780822.781144"},{"unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. McGraw Hill, New York","key":"26_CR3"},{"doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL, pp. 84\u201396 (1978)","key":"26_CR4","DOI":"10.1145\/512760.512770"},{"doi-asserted-by":"crossref","unstructured":"Das, M.: Unification-based pointer analysis with directional assignments. In: PLDI, pp. 35\u201346 (2000)","key":"26_CR5","DOI":"10.1145\/349299.349309"},{"doi-asserted-by":"crossref","unstructured":"Dor, N., Rodeh, M., Sagiv, M.: Cssv: towards a realistic tool for statically detecting all buffer overflows in c. In: PLDI (2003)","key":"26_CR6","DOI":"10.1145\/781131.781149"},{"doi-asserted-by":"crossref","unstructured":"Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: PLDI, pp. 242\u2013256 (1994)","key":"26_CR7","DOI":"10.1145\/178243.178264"},{"unstructured":"Esparza, J., Kiefer, S., Michael, L.: Newtonian program analysis. In: ICALP (2008)","key":"26_CR8"},{"doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Foster, J.S., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: PLDI (1998)","key":"26_CR9","DOI":"10.1145\/277650.277667"},{"doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Rehof, J., Das, M.: Scalable context-sensitive flow analysis using instantiation constraints. In: PLDI (2000)","key":"26_CR10","DOI":"10.1145\/349299.349332"},{"doi-asserted-by":"crossref","unstructured":"Fecht, C., Seidl, H.: An even faster solver for general systems of equations. In: SAS, pp. 189\u2013204 (1996)","key":"26_CR11","DOI":"10.1007\/3-540-61739-6_42"},{"doi-asserted-by":"crossref","unstructured":"Ganapathy, V., Jha, S., Chandler, D., Melski, D., Vitek, D.: Buffer overrun detection using linear programming and static analysis. In: CCS, pp. 345\u2013354 (2003)","key":"26_CR12","DOI":"10.1145\/948109.948155"},{"unstructured":"GNU-MP-Integer-Library, http:\/\/gmplib.org\/","key":"26_CR13"},{"doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. In: PLDI, pp. 290\u2013299 (2007)","key":"26_CR14","DOI":"10.1145\/1250734.1250767"},{"doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using CLA: a million lines of C code in a second. In: PLDI, pp. 254\u2013263 (2001)","key":"26_CR15","DOI":"10.1145\/378795.378855"},{"doi-asserted-by":"crossref","unstructured":"Hind, M., Pioli, A.: Which pointer analysis should i use? In: ISSTA, pp. 113\u2013123 (2000)","key":"26_CR16","DOI":"10.1145\/347324.348916"},{"unstructured":"ILOG-Toolkit, http:\/\/www.ilog.com\/","key":"26_CR17"},{"doi-asserted-by":"crossref","unstructured":"Kahlon, V.: Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis. In: PLDI, pp. 249\u2013259 (2008)","key":"26_CR18","DOI":"10.1145\/1375581.1375613"},{"key":"26_CR19","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: The Art of Computer Programming. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley, Reading (1997)"},{"doi-asserted-by":"crossref","unstructured":"Lattner, C., Lenharth, A., Adve, V.: Making context-sensitive points-to analysis with heap cloning practical for the real world. In: PLDI, pp. 278\u2013289 (2007)","key":"26_CR20","DOI":"10.1145\/1250734.1250766"},{"doi-asserted-by":"crossref","unstructured":"Lhotak, O., Hendren, L.: Scaling Java points-to analysis using spark. In: CC (2003)","key":"26_CR21","DOI":"10.1007\/3-540-36579-6_12"},{"doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: POPL, pp. 330\u2013341 (2004)","key":"26_CR22","DOI":"10.1145\/982962.964029"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-10672-9_6","volume-title":"Programming Languages and Systems","author":"R. Nasre","year":"2009","unstructured":"Nasre, R., Rajan, K., Ramaswamy, G., Khedker, U.P.: Scalable context-sensitive points-to analysis using multi-dimensional bloom filters. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol.\u00a05904, pp. 47\u201362. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Rountev, A., Chandra, S.: Off-line variable substitution for scaling points-to analysis. In: PLDI, pp. 47\u201356 (2000)","key":"26_CR24","DOI":"10.1145\/349299.349310"},{"doi-asserted-by":"crossref","unstructured":"Rugina, R., Rinard, M.: Pointer analysis for multithreaded programs. In: PLDI, pp. 77\u201390 (1999)","key":"26_CR25","DOI":"10.1145\/301618.301645"},{"doi-asserted-by":"crossref","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: POPL, pp. 32\u201341 (1996)","key":"26_CR26","DOI":"10.1145\/237721.237727"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-45789-5_15","volume-title":"Static Analysis","author":"J. Whaley","year":"2002","unstructured":"Whaley, J., Lam, M.S.: An efficient inclusion-based points-to analysis for strictly-typed languages. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, p. 180. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15769-1_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:19Z","timestamp":1606185619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15769-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157684","9783642157691"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15769-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}