{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:12Z","timestamp":1725456012780},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053010X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024190","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:49:34Z","timestamp":1132393774000},"page":"277-292","source":"Crossref","is-referenced-by-count":5,"title":["A logic-based approach to data flow analysis problems"],"prefix":"10.1007","author":[{"given":"S.","family":"Sagiv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Francez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Rodeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Wilhelm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"A.V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1985."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"J.P. Banning. An efficient way to find the side effects of procedure calls and the aliases of variables. In ACM Symposium on Principles of Programming Languages, pages 29\u201341, 1979.","DOI":"10.1145\/567752.567756"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixed points. In ACM Symposium on Principles of Programming Languages, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In ACM Symposium on Principles of Programming Languages, pages 269\u2013282, 1979.","DOI":"10.1145\/567752.567778"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"K.D. Cooper and K. Kennedy. Fast interprocedural alias analysis. In ACM Symposium on Principles of Programming Languages, pages 49\u201359, 1989.","DOI":"10.1145\/75277.75282"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"K.D. Cooper. Analyzing aliases of reference formal parameters. In ACM Symposium on Principles of Programming Languages, pages 281\u2013290, 1985.","DOI":"10.1145\/318593.318658"},{"key":"19_CR7","first-page":"1","volume":"3","author":"R. Fagin","year":"1986","unstructured":"R. Fagin, J.D. Ullman, G.M. Kuper, and M.Y. Vardi. Updating logical databases. Advances in Computing Research, 3:1\u201318, 1986.","journal-title":"Advances in Computing Research"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"R. Fagin, J.D. Ullman, and M.Y. Vardi. On the semantics of updates in databases. In ACM Symposium on Principles of Database Systems, pages 352\u2013365, 1983.","DOI":"10.1145\/588058.588100"},{"issue":"1","key":"19_CR9","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321921.321939","volume":"23","author":"S.L. Graham","year":"1976","unstructured":"S.L. Graham and M. Wegman. A fast and usually linear algorithm for data flow analysis. Journal of the ACM, 23(1):172\u2013202, 1976.","journal-title":"Journal of the ACM"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"G.A. Kildall. A unified approach to global program optimization. In ACM Symposium on Principles of Programming Languages, pages 194\u2013206, 1973.","DOI":"10.1145\/512927.512945"},{"issue":"1","key":"19_CR11","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J.B. Kam","year":"1976","unstructured":"J.B. Kam and J.D. Ullman. Global data flow analysis and iterative algorithms. Journal of the ACM, 23(1):158\u2013171, 1976.","journal-title":"Journal of the ACM"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"E.W. Myers. A precise inter-procedural data flow algorithm. In ACM Symposium on Principles of Programming Languages, pages 219\u2013230, 1981.","DOI":"10.1145\/567532.567556"},{"key":"19_CR14","unstructured":"NIL3 Reference Manual. IBM T.J. Waston Research Center, 1987."},{"issue":"3","key":"19_CR15","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/27632.27649","volume":"18","author":"B.G. Ryder","year":"1986","unstructured":"B.G. Ryder and M.C. Paul. Elimination algorithms for data flow analysis. ACM Computing Surveys, 18(3):277\u2013316, 1986.","journal-title":"ACM Computing Surveys"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"R. Sch\u00e4tz. Delete operations and horn formulas. In LNCS 385, 2nd Workshop on Computer Science Logic, pages 329\u2013343, Springer-Verlag, 1988.","DOI":"10.1007\/BFb0026311"},{"key":"19_CR17","unstructured":"M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S.S. Muchnick and N.D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 6, pages 189\u2013233, Prentice-Hall, 1981."},{"key":"19_CR18","unstructured":"S. Sagiv,, M. Rodeh, and R. Wilhelm. A note on pointer equalities vs. interprocedural aliases. 1990. In preparation."},{"issue":"1","key":"19_CR19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TSE.1986.6312929","volume":"12","author":"R.E. Strom","year":"1986","unstructured":"R.E. Strom and S. Yemini. Typestate: a programming language concept for enhancing software reliability. IEEE Transactions on Software Engineering, SE-12(1):157\u2013171, 1986.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"M.N Wegman and F.K. Zadeck. Constant propagation with conditional branches. In ACM Symposium on Principles of Programming Languages, 1985.","DOI":"10.1145\/318593.318659"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024190.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:52:17Z","timestamp":1607550737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053010X"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0024190","relation":{},"subject":[]}}