{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:02:48Z","timestamp":1761976968872,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412011"},{"type":"electronic","value":"9783642412028"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41202-8_27","type":"book-chapter","created":{"date-parts":[[2013,10,21]],"date-time":"2013-10-21T05:11:19Z","timestamp":1382332279000},"page":"415-430","source":"Crossref","is-referenced-by-count":5,"title":["Path-Sensitive Data Flow Analysis Simplified"],"prefix":"10.1007","author":[{"given":"Kirsten","family":"Winter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian J.","family":"Hayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Keynes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina","family":"Cifuentes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Bod\u00edk, R., Gupta, R., Soffa, M.L.: Refining data flow information using infeasible paths. In: Proc. of ESEC\/FSE, pp. 361\u2013377. ACM (1997)","DOI":"10.1007\/3-540-63531-9_25"},{"key":"27_CR2","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: Proc. of POPL, pp. 238\u2013252. ACM (1977)","DOI":"10.1145\/512950.512973"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Cifuentes, C., Scholz, B.: Parfait \u2013 designing a scalable bug checker. In: Proc. of the Static Analysis Workshop, pp. 4\u201311. ACM (2008)","DOI":"10.1145\/1394504.1394505"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/11823230_27","volume-title":"Static Analysis","author":"D. Dhurjati","year":"2006","unstructured":"Dhurjati, D., Das, M., Yang, Y.: Path-sensitive dataflow analysis with iterative refinement. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 425\u2013442. Springer, Heidelberg (2006)"},{"key":"27_CR5","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall (1976)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: Path-sensitive program verification in polynomial time. In: Proc. of PLDI, pp. 57\u201368. ACM (2002)","DOI":"10.1145\/543552.512538"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Fisher, J., Jhala, R., Majumdar, R.: Joining dataflow with predicates. In: Proc. of ESEC\/FSE, pp. 227\u2013236. ACM (2005)","DOI":"10.1145\/1095430.1081742"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1111\/j.1467-8640.1988.tb00280.x","volume":"4","author":"M. Ginsberg","year":"1988","unstructured":"Ginsberg, M.: Multivalued logics: A uniform approach to inference in artificial intelligence. Computational Intelligence\u00a04, 265\u2013316 (1988)","journal-title":"Computational Intelligence"},{"issue":"6","key":"27_CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1049\/ip-sen:20010834","volume":"148","author":"I.J. Hayes","year":"2001","unstructured":"Hayes, I.J., Fidge, C.J., Lermer, K.: Semantic characterisation of dead control-flow paths. IEE Proceedings\u2014Software\u00a0148(6), 175\u2013186 (2001)","journal-title":"IEE Proceedings\u2014Software"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Proc. of POPL, pp. 58\u201370. ACM (2002)","DOI":"10.1145\/565816.503279"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Holley, L.H., Rosen, B.K.: Qualified data flow problems. In: Proc. of POPL, pp. 68\u201382. ACM (1980)","DOI":"10.1145\/567446.567454"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Hampapuram, H., Yang, Y., Das, M.: Symbolic path simulation in path-sensitive dataflow analysis. In: Proc. of PASTE, pp. 52\u201358. ACM (2005)","DOI":"10.1145\/1108768.1108808"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A unified approach to global program optimization. In: Proc. of POPL, pp. 194\u2013206. ACM (1973)","DOI":"10.1145\/512927.512945"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation. In: Proc. of the International Symposium on Code Generation and Optimization (CGO 2004), pp. 75\u201386 (2004)","DOI":"10.1109\/CGO.2004.1281665"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of program analysis. Springer (1999)","DOI":"10.1007\/978-3-662-03811-6"},{"key":"27_CR16","unstructured":"Rival, X., Mauborgne, L.: The trace partitioning abstract domain. In: ACM TOPLAS (August 29, 2007)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: ACM TOPLAS, vol.\u00a024(3), pp. 217\u2013298 (2002)","DOI":"10.1145\/514188.514190"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41202-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T17:42:46Z","timestamp":1746034966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41202-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412011","9783642412028"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41202-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}