{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:13:45Z","timestamp":1774988025543,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540285847","type":"print"},{"value":"9783540319719","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547662_16","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:36:20Z","timestamp":1127817380000},"page":"218-234","source":"Crossref","is-referenced-by-count":43,"title":["Banshee: A Scalable Constraint-Based Analysis Toolkit"],"prefix":"10.1007","author":[{"given":"John","family":"Kodumal","sequence":"first","affiliation":[]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8598-9","volume-title":"A Theory of Objects","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Cardelli, L.: A Theory of Objects. Springer, New York (1996)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0055513","volume-title":"Types in Compilation","author":"A. Aiken","year":"1998","unstructured":"Aiken, A., F\u00e4hndrich, M., Foster, J., Su, Z.: A toolkit for constructing type- and constraint-based program analyses. In: Leroy, X., Ohori, A. (eds.) TIC 1998. LNCS, vol.\u00a01473, pp. 78\u201396. Springer, Heidelberg (1998)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Beyer, D., Noack, A., Lewerentz, C.: Simple and efficient relational querying of software structures. In: Proceedings of the 10th Working Conference on Reverse Engineering, p. 216. IEEE Computer Society, Los Alamitos (2003)","DOI":"10.1109\/WCRE.2003.1287252"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/69.43410","volume":"1","author":"S. Ceri","year":"1989","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: What you always wanted to know about datalog (and never dared to ask). IEEE Transactions on Knowledge and Data Engineering\u00a01(1), 146\u2013166 (1989)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Das, M.: Unification-based pointer analysis with directional assignments. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 35\u201346 (2000)","DOI":"10.1145\/349299.349309"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.F.: Fully dynamic transitive closure: Breaking through the O(n 2) barrier. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p. 381. IEEE Computer Society, Los Alamitos (2000)","DOI":"10.1109\/SFCS.2000.892126"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 109\u2013121 (1986)","DOI":"10.1145\/12130.12142"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/BFb0032737","volume-title":"Static Analysis","author":"M. F\u00e4hndrich","year":"1997","unstructured":"F\u00e4hndrich, M., Aiken, A.: Program analysis using mixed term and set constraints. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 114\u2013126. Springer, Heidelberg (1997)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"F\u00e4hndrich, M., Foster, J.S., Su, Z., Aiken, A.: Partial online cycle elimination in inclusion constraint graphs. In: Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998, pp. 85\u201396 (1998)","DOI":"10.1145\/277650.277667"},{"issue":"6","key":"16_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0020-0190(91)90151-7","volume":"37","author":"Z. Galil","year":"1991","unstructured":"Galil, Z., Italiano, G.F.: A note on set union with arbitrary deunions. Information Processing Letters\u00a037(6), 331\u2013335 (1991)","journal-title":"Information Processing Letters"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Gay, D., Aiken, A.: Language support for regions. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 70\u201380 (2001)","DOI":"10.1145\/378795.378815"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast aliasing analysis using CLA: A million lines of c code in a second. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 254\u2013263 (2001)","DOI":"10.1145\/378795.378855"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/222124.222146","volume-title":"Proceedings of the 3rd ACM SIGSOFT Symposium on Foundations of Software Engineering","author":"S. Horwitz","year":"1995","unstructured":"Horwitz, S., Reps, T., Sagiv, M.: Demand interprocedural dataflow analysis. In: Proceedings of the 3rd ACM SIGSOFT Symposium on Foundations of Software Engineering, pp. 104\u2013115. ACM Press, New York (1995)"},{"key":"16_CR14","unstructured":"Kodumal, J., Aiken, A.: Banshee: A toolkit for constructing constraint-based analyses (2005), http:\/\/banshee.sourceforge.net"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/996841.996867","volume-title":"Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation","author":"J. Kodumal","year":"2004","unstructured":"Kodumal, J., Aiken, A.: The set constraint\/CFL reachability connection in practice. In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, pp. 207\u2013218. ACM Press, New York (2004)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O., Hendren, L.: Jedd: A BDD-based relational extension of Java. In: Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation. ACM Press, New York (2004)","DOI":"10.1145\/996841.996861"},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1145\/581771.581774","volume":"49","author":"D. McAllester","year":"2002","unstructured":"McAllester, D.: On the complexity analysis of static analyses. Journal of the ACM\u00a049(4), 512\u2013537 (2002)","journal-title":"Journal of the ACM"},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/258993.259006","volume-title":"Proceedings of the 1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation","author":"D. Melski","year":"1997","unstructured":"Melski, D., Reps, T.: Interconvertbility of set constraints and context-free language reachability. In: Proceedings of the 1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, pp. 74\u201389. ACM Press, New York (1997)"},{"key":"16_CR19","unstructured":"Ragan-Kelley, J.: Personal communication (November 2004)"},{"key":"16_CR20","unstructured":"Ragan-Kelley, J.: Practical Interactive Lighting Design for RenderMan Scenes. Undergraduate thesis, Stanford University, Department of Computer Science (2004)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, M.: Precise interprocedural dataflow analysis via graph reachability. In: Proceedings of the 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, January 1995, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"16_CR22","unstructured":"Roditty, L.: A faster and simpler fully dynamic transitive closure. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 404\u2013412. Society for Industrial and Applied Mathematics (2003)"},{"key":"16_CR23","unstructured":"Sayeed, A.: Proshee (2005), http:\/\/proshee.sourceforge.net"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Shapiro, M., Horwitz, S.: Fast and accurate flow-insensitive points-to analysis. In: Proceedings of the 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (January 1997)","DOI":"10.1145\/263699.263703"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Steensgaard, B.: Points-to analysis in almost linear time. In: Proceedings of the 23th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1996, pp. 32\u201341 (1996)","DOI":"10.1145\/237721.237727"},{"issue":"2","key":"16_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0167-6423(93)90003-8","volume":"21","author":"B. Steffen","year":"1993","unstructured":"Steffen, B.: Generating data flow analysis algorithms from modal specifications. Science of Computer Programming\u00a021(2), 115\u2013139 (1993)","journal-title":"Science of Computer Programming"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Stoyle, G., Hicks, M., Bierman, G., Sewell, P., Neamtiu, I.: Mutatis mutandis: Safe and predictable dynamic software updating. In: POPL 2005: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 183\u2013194 (2005)","DOI":"10.1145\/1040305.1040321"},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/325694.325706","volume-title":"Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"Z. Su","year":"2000","unstructured":"Su, Z., F\u00e4hndrich, M., Aiken, A.: Projection merging: Reducing redundancies in inclusion constraint graphs. In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 81\u201395. ACM Press, New York (2000)"},{"issue":"1","key":"16_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0218001","volume":"18","author":"J. Westbrook","year":"1989","unstructured":"Westbrook, J., Tarjan, R.E.: Amortized analysis of algorithms for set union with backtracking. SIAM Journal on Computing\u00a018(1), 1\u201311 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: Proceedings of the Conference on Programming Language Design and Implementation. ACM Press, New York (2004)","DOI":"10.1145\/996841.996859"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/298514.298576","volume-title":"Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"M. Yannakakis","year":"1990","unstructured":"Yannakakis, M.: Graph-theoretic methods in database theory. In: Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 230\u2013242. ACM Press, New York (1990)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547662_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:57:51Z","timestamp":1619492271000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547662_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285847","9783540319719"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11547662_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}