{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:33:45Z","timestamp":1725489225194},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665380"},{"type":"electronic","value":"9783540481669"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","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":[[1999]]},"DOI":"10.1007\/3-540-48166-4_15","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T00:59:20Z","timestamp":1186621160000},"page":"235-252","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Data-Flow Analysis of Program Fragments"],"prefix":"10.1007","author":[{"given":"Atanas","family":"Rountev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara G.","family":"Ryder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Landi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,8,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"D. Atkinson and W. Griswold. Effective whole-program analysis in the presence of pointers. In Proc. Symp. on the Foundations of Software Engineering, pages 46\u201355, 1998.","key":"15_CR1","DOI":"10.1145\/291252.288217"},{"doi-asserted-by":"crossref","unstructured":"L. Cardelli. Program fragments, linking and modularization. In Proc. Symp. on Principles of Prog. Lang., pages 266\u2013277, 1997.","key":"15_CR2","DOI":"10.1145\/263699.263735"},{"unstructured":"R. Chatterjee and B. G. Ryder. Data-flow-based testing of object-oriented libraries. Technical Report DCS-TR-382, Rutgers University, 1999.","key":"15_CR3"},{"doi-asserted-by":"crossref","unstructured":"R. Chatterjee, B. G. Ryder, and W. Landi. Relevant context inference. In Proc. Symp. on Principles of Prog. Lang., pages 133\u2013146, 1999.","key":"15_CR4","DOI":"10.1145\/292540.292554"},{"doi-asserted-by":"crossref","unstructured":"M. Codish, S. Debray, and R. Giacobazzi. Compositional analysis of modular logic programs. In Proc. Symp. on Principles of Prog. Lang., pages 451\u2013464, 1993.","key":"15_CR5","DOI":"10.1145\/158511.158703"},{"doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixed points. In Proc. Symp. on Principles of Prog. Lang., pages 238\u2013252, 1977.","key":"15_CR6","DOI":"10.1145\/512950.512973"},{"doi-asserted-by":"crossref","unstructured":"M. Emami, R. Ghiya, and L. J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proc. Conf. on Prog. Lang. Design and Implementation, pages 242\u2013257, 1994.","key":"15_CR7","DOI":"10.1145\/773473.178264"},{"issue":"7","key":"15_CR8","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/32.538603","volume":"22","author":"M. J. Harrold","year":"1996","unstructured":"M. J. Harrold and G. Rothermel. Separate computation of alias information for reuse. IEEE Transactions on Software Engineering, 22(7):442\u2013460, July 1996.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"15_CR9","series-title":"Lect Notes Comput Sci","first-page":"381","volume-title":"Proc. Symp. on Compositionality","author":"O. Kupferman","year":"1997","unstructured":"O. Kupferman and M. Y. Vardi. Modular model checking. In Proc. Symp. on Compositionality, LNCS 1536, pages 381\u2013401, 1997."},{"doi-asserted-by":"crossref","unstructured":"W. Landi and B. G. Ryder. A safe approximation algorithm for interprocedural pointer aliasing. In Proc. Conf. on Prog. Lang. Design and Implementation, pages 235\u2013248, 1992.","key":"15_CR10","DOI":"10.1145\/143103.143137"},{"doi-asserted-by":"crossref","unstructured":"T. Marlowe and B. G. Ryder. An efficient hybrid algorithm for incremental data flow analysis. In Proc. Symp. on Principles of Prog. Lang., pages 184\u2013196, 1990.","key":"15_CR11","DOI":"10.1145\/96709.96728"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01237234","volume":"28","author":"T. Marlowe","year":"1990","unstructured":"T. Marlowe and B. G. Ryder. Properties of data flow frameworks: A unified model. Acta Informatica, 28:121\u2013163, 1990.","journal-title":"Acta Informatica"},{"doi-asserted-by":"crossref","unstructured":"T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Proc. Symp. on Principles of Prog. Lang., pages 49\u201361, 1995.","key":"15_CR13","DOI":"10.1145\/199448.199462"},{"doi-asserted-by":"crossref","unstructured":"D. Schmidt. Data flow analysis is model checking of abstract interpretations. In Proc. Symp. on Principles of Prog. Lang., pages 38\u201348, 1998.","key":"15_CR14","DOI":"10.1145\/268946.268950"},{"doi-asserted-by":"crossref","unstructured":"M. Shapiro and S. Horwitz. Fast and accurate flow-insensitive points-to analysis. In Proc. Symp. on Principles of Prog. Lang., pages 1\u201314, 1997.","key":"15_CR15","DOI":"10.1145\/263699.263703"},{"unstructured":"M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, pages 189\u2013234. Prentice Hall, 1981.","key":"15_CR16"},{"doi-asserted-by":"crossref","unstructured":"B. Steensgaard. Points-to analysis in almost linear time. In Proc. Symp. on Principles of Prog. Lang., pages 32\u201341, 1996.","key":"15_CR17","DOI":"10.1145\/237721.237727"},{"doi-asserted-by":"crossref","unstructured":"P. Stocks, B.G. Ryder, W. Landi, and S. Zhang. Comparing flow-and context-sensitivity on the modification side-effects problem. In Proc. International Symposium on Software Testing and Analysis, pages 21\u201331, 1998.","key":"15_CR18","DOI":"10.1145\/271775.271782"},{"unstructured":"R. Wilhelm and D. Maurer. Compiler Design. Addison-Wesley, 1995.","key":"15_CR19"},{"doi-asserted-by":"crossref","unstructured":"R. Wilson and M. Lam. Efficient context-sensitive pointer analysis for C programs. In Proc. Conf. on Prog. Lang. Design and Implementation, pages 1\u201312, 1995.","key":"15_CR20","DOI":"10.1145\/223428.207111"},{"doi-asserted-by":"crossref","unstructured":"S. Zhang, B. G. Ryder, and W. Landi. Program decomposition for pointer aliasing: A step towards practical analyses. In Proc. Symp. on the Foundations of Software Engineering, pages 81\u201392, 1996.","key":"15_CR21","DOI":"10.1145\/250707.239112"}],"container-title":["Lecture Notes in Computer Science","Software Engineering \u2014 ESEC\/FSE \u201999"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48166-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T04:05:12Z","timestamp":1586145912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48166-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665380","9783540481669"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48166-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}