{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:27:23Z","timestamp":1760783243160},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119569"},{"type":"electronic","value":"9783642119576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11957-6_14","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T00:55:38Z","timestamp":1268009738000},"page":"246-266","source":"Crossref","is-referenced-by-count":75,"title":["Fluid Updates: Beyond Strong vs. Weak Updates"],"prefix":"10.1007","author":[{"given":"Isil","family":"Dillig","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Dillig","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Aiken","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/93542.93585","volume-title":"PLDI","author":"D.R. Chase","year":"1990","unstructured":"Chase, D.R., Wegman, M., Zadeck, F.K.: Analysis of pointers and structures. In: PLDI, pp. 296\u2013310. ACM, New York (1990)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Monniaux, D., Rival, X.: Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software (2002)","DOI":"10.1007\/3-540-36377-7_5"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-540-27813-9_2","volume-title":"Computer Aided Verification","author":"T.W. Reps","year":"2004","unstructured":"Reps, T.W., Sagiv, S., Wilhelm, R.: Static program analysis via 3-valued logic. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 15\u201330. Springer, Heidelberg (2004)"},{"key":"14_CR4","first-page":"338","volume-title":"POPL","author":"D. Gopan","year":"2005","unstructured":"Gopan, D., Reps, T., Sagiv, M.: A framework for numeric analysis of array operations. In: POPL, pp. 338\u2013350. ACM, New York (2005)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1251535.1251543","volume-title":"PASTE","author":"A. Aiken","year":"2007","unstructured":"Aiken, A., Bugrara, S., Dillig, I., Dillig, T., Hackett, B., Hawkins, P.: An overview of the saturn project. In: PASTE, pp. 43\u201348. ACM, New York (2007)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Ball, T., Rajamani, S.: The slam project: debugging system software via static analysis. In: POPL, NY, USA, pp. 1\u20133 (2002)","DOI":"10.1145\/503272.503274"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1049\/el:20030157","volume":"39","author":"S. Lee","year":"2003","unstructured":"Lee, S., Cho, D.: Packet-scheduling algorithm based on priority of separate buffers for unicast and multicast services. Electronics Letters\u00a039(2), 259\u2013260 (2003)","journal-title":"Electronics Letters"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Nguyen, K., Nguyen, T., Cheung, S.: P2p streaming with hierarchical network coding (July 2007)","DOI":"10.1109\/ICME.2007.4284670"},{"issue":"7","key":"14_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/143103.143137","volume":"27","author":"W. Landi","year":"1992","unstructured":"Landi, W., Ryder, B.G.: A safe approximate algorithm for interprocedural aliasing. SIGPLAN Not.\u00a027(7), 235\u2013248 (1992)","journal-title":"SIGPLAN Not."},{"key":"14_CR10","first-page":"91","volume":"7","author":"D. Cooper","year":"1972","unstructured":"Cooper, D.: Theorem proving in arithmetic without multiplication. Machine Intelligence\u00a07, 91\u2013100 (1972)","journal-title":"Machine Intelligence"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-78739-6_16","volume-title":"Programming Languages and Systems","author":"S. Gulwani","year":"2008","unstructured":"Gulwani, S., Musuvathi, M.: Cover algorithms. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 193\u2013207. Springer, Heidelberg (2008)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Karr, M.: Affine relationships among variables of a program. A.I., 133\u2013151 (1976)","DOI":"10.1007\/BF00268497"},{"key":"14_CR13","first-page":"84","volume-title":"POPL","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL, pp. 84\u201396. ACM, New York (1978)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-02658-4_20","volume-title":"Computer Aided Verification","author":"I. Dillig","year":"2009","unstructured":"Dillig, I., Dillig, T., Aiken, A.: Cuts from proofs: A complete and practical technique for solving linear inequalities over integers. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 233\u2013247. Springer, Heidelberg (2009)"},{"issue":"5","key":"14_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/381788.316183","volume":"24","author":"S. Chandra","year":"1999","unstructured":"Chandra, S., Reps, T.: Physical type checking for c. SIGSOFT\u00a024(5), 66\u201375 (1999)","journal-title":"SIGSOFT"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K., Chilimbi, T.: SPEED: precise and efficient static estimation of program computational complexity. In: POPL, pp. 127\u2013139 (2009)","DOI":"10.1145\/1594834.1480898"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-73368-3_23","volume-title":"Computer Aided Verification","author":"R. Jhala","year":"2007","unstructured":"Jhala, R., Mcmillan, K.L.: Array abstractions from proofs. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 193\u2013206. Springer, Heidelberg (2007)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/1375581.1375623","volume-title":"PLDI","author":"N. Halbwachs","year":"2008","unstructured":"Halbwachs, N., P\u00e9ron, M.: Discovering properties about arrays in simple programs. In: PLDI, pp. 339\u2013348. ACM, New York (2008)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-642-00593-0_33","volume-title":"Fundamental Approaches to Software Engineering","author":"L. Kovacs","year":"2009","unstructured":"Kovacs, L., Voronkov, A.: Finding loop invariants for programs over arrays using a theorem prover. In: Chechik, M., Wirsing, M. (eds.) FASE 2009. LNCS, vol.\u00a05503, pp. 470\u2013485. Springer, Heidelberg (2009)"},{"key":"14_CR20","unstructured":"http:\/\/www.gnu.org\/software\/coreutils\/ Unix coreutils"},{"key":"14_CR21","first-page":"244","volume-title":"POPL","author":"N. Jones","year":"1979","unstructured":"Jones, N., Muchnick, S.: Flow analysis and optimization of LISP-like structures. In: POPL, pp. 244\u2013256. ACM, New York (1979)"},{"key":"14_CR22","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/178243.178263","volume-title":"PLDI","author":"A. Deutsch","year":"1994","unstructured":"Deutsch, A.: Interprocedural may-alias analysis for pointers: Beyond k-limiting. In: PLDI, pp. 230\u2013241. ACM, New York (1994)"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-78739-6_14","volume-title":"Programming Languages and Systems","author":"X. Allamigeon","year":"2008","unstructured":"Allamigeon, X.: Non-disjunctive numerical domain for array predicate abstraction. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 163\u2013177. Springer, Heidelberg (2008)"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/1328438.1328468","volume-title":"POPL","author":"S. Gulwani","year":"2008","unstructured":"Gulwani, S., McCloskey, B., Tiwari, A.: Lifting abstract interpreters to quantified logical domains. In: POPL, pp. 235\u2013246. ACM, New York (2008)"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-03237-0_3","volume-title":"Static Analysis","author":"M. Seghir","year":"2009","unstructured":"Seghir, M., Podelski, A., Wies, T.: Abstraction Refinement for Quantified Array Assertions. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol.\u00a05673, pp. 3\u201318. Springer, Heidelberg (2009)"},{"key":"14_CR26","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/503272.503291","volume-title":"POPL","author":"C. Flanagan","year":"2002","unstructured":"Flanagan, C., Qadeer, S.: Predicate abstraction for software verification. In: POPL, pp. 191\u2013202. ACM, New York (2002)"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.scico.2006.03.008","volume":"64","author":"D.A. Schmidt","year":"2007","unstructured":"Schmidt, D.A.: A calculus of logical relations for over- and underapproximating static analyses. Sci. Comput. Program.\u00a064(1), 29\u201353 (2007)","journal-title":"Sci. Comput. Program."},{"key":"14_CR28","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/1480881.1480917","volume-title":"POPL","author":"C. Calcagno","year":"2009","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P., Yang, H.: Compositional shape analysis by means of bi-abduction. In: POPL, pp. 289\u2013300. ACM, New York (2009)"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","first-page":"243","volume-title":"Verification: Theory and Practice","author":"P. Cousot","year":"2004","unstructured":"Cousot, P.: Verification by abstract interpretation. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.\u00a02772, pp. 243\u2013268. Springer, Heidelberg (2004)"},{"key":"14_CR30","unstructured":"Dillig, I., Dillig, T., Aiken, A.: Fluid updates: Beyond strong vs. weak updates (extended version), http:\/\/www.stanford.edu\/~isil\/esop-extended.pdf"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11957-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T19:56:35Z","timestamp":1685476595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11957-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119569","9783642119576"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11957-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}