{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:15:41Z","timestamp":1794381341529,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540258773","type":"print"},{"value":"9783540320494","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424529_6","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T14:55:14Z","timestamp":1285426514000},"page":"82-89","source":"Crossref","is-referenced-by-count":7,"title":["Component-Level Dataflow Analysis"],"prefix":"10.1007","author":[{"given":"Atanas","family":"Rountev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications, pp. 189\u2013234. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: ACM Symposium, Principles of Programming Languages, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"M. Sagiv","year":"1996","unstructured":"Sagiv, M., Reps, T., Horwitz, S.: Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science\u00a0167, 131\u2013170 (1996)","journal-title":"Theoretical Computer Science"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/B:AUSE.0000008666.56394.a1","volume":"11","author":"A. Milanova","year":"2004","unstructured":"Milanova, A., Rountev, A., Ryder, B.G.: Precise call graphs for C programs with function pointers. Journal of Automated Software Engineering\u00a011, 7\u201326 (2004)","journal-title":"Journal of Automated Software Engineering"},{"key":"6_CR5","unstructured":"Kuck, F.C.: Class analysis for extensible Java software. Master\u2019s thesis, Ohio State University (2004)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-48166-4_15","volume-title":"Software Engineering - ESEC\/FSE \u201999","author":"A. Rountev","year":"1999","unstructured":"Rountev, A., Ryder, B.G., Landi, W.: Data-flow analysis of program fragments. In: Nierstrasz, O., Lemoine, M. (eds.) ESEC 1999 and ESEC-FSE 1999. LNCS, vol.\u00a01687, pp. 235\u2013252. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Component-Based Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424529_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:05:24Z","timestamp":1619492724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424529_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258773","9783540320494"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11424529_6","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b136248","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}