{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:23:20Z","timestamp":1779074600417,"version":"3.51.4"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2008,5]]},"abstract":"<jats:p>We introduce the notion of a<jats:italic>partially<\/jats:italic>-flow-sensitive analysis based on the number of read and write operations that are guaranteed to be analyzed in a sequential manner. We study the complexity of partially-flow-sensitive alias analysis and show that precise alias analysis with a very limited flow-sensitivity is as hard as precise flow-sensitive alias analysis, both when dynamic memory allocation is allowed, as well as in the absence of dynamic memory allocation.<\/jats:p>","DOI":"10.1145\/1353445.1353447","type":"journal-article","created":{"date-parts":[[2008,5,20]],"date-time":"2008-05-20T12:41:26Z","timestamp":1211287286000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["On the complexity of partially-flow-sensitive alias analysis"],"prefix":"10.1145","volume":"30","author":[{"given":"N.","family":"Rinetzky","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Ramalingam","sequence":"additional","affiliation":[{"name":"Microsoft Research India, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sagiv","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Yahav","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,5,21]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604142"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/239912.239913"},{"key":"e_1_2_1_4_1","unstructured":"Kernighan B. W. and Ritchie D. M. 1988. The C programming language. Prentice Hall Upper Saddle River NJ. Kernighan B. W. and Ritchie D. M. 1988. The C programming language. Prentice Hall Upper Saddle River NJ."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/161494.161501"},{"key":"e_1_2_1_7_1","unstructured":"Milne R. and Strachey C. 1977. A Theory of Programming Language Semantics. Halsted Press New York NY. Milne R. and Strachey C. 1977. A Theory of Programming Language Semantics. Halsted Press New York NY."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/325694.325704"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/186025.186041"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Reynolds J. 2002. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science. 55--74. Reynolds J. 2002. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science. 55--74.","DOI":"10.1109\/LICS.2002.1029817"},{"key":"e_1_2_1_11_1","volume-title":"Formal Language Description Languages for Computer Programming","author":"Strachey C.","unstructured":"Strachey , C. 1966. Towards a formal semantics . In Formal Language Description Languages for Computer Programming , T. B. Steel, Ed. North Holland, Amsterdam, The Netherlands , 198--220. Strachey, C. 1966. Towards a formal semantics. In Formal Language Description Languages for Computer Programming, T. B. Steel, Ed. North Holland, Amsterdam, The Netherlands, 198--220."}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1353445.1353447","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1353445.1353447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:13Z","timestamp":1750254973000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1353445.1353447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["10.1145\/1353445.1353447"],"URL":"https:\/\/doi.org\/10.1145\/1353445.1353447","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5]]},"assertion":[{"value":"2006-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}