{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T08:07:31Z","timestamp":1790496451596,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540272311","type":"print"},{"value":"9783540316862","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11513988_45","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:33:28Z","timestamp":1268400808000},"page":"449-461","source":"Crossref","is-referenced-by-count":39,"title":["Incremental Algorithms for Inter-procedural Analysis of Safety Properties"],"prefix":"10.1007","author":[{"given":"Christopher L.","family":"Conway","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kedar S.","family":"Namjoshi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dennis","family":"Dams","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen A.","family":"Edwards","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Hallem, S., Chelf, B., Xie, Y., Engler, D.: A system and language for building system-specific, static analyses. In: PLDI, Berlin, Germany, pp. 69\u201382 (2002)","DOI":"10.21236\/ADA419593"},{"key":"45_CR2","unstructured":"Holzmann, G.: Static source code checking for user-defined properties. In: Integrated Design and Process Technology (IDPT), Pasadena, CA (2002)"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44585-4_25","volume-title":"Computer Aided Verification","author":"T. Ball","year":"2001","unstructured":"Ball, T., Rajamani, S.K.: The SLAM toolkit. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 260\u2013264. Springer, Heidelberg (2001)"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Reps, T., Horwitz, S., Sagiv, S.: Precise interprocedural dataflow analysis via graph reachability. In: POPL, San Francisco, CA, pp. 49\u201361 (1995)","DOI":"10.1145\/199448.199462"},{"key":"45_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-44585-4_30","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"2001","unstructured":"Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 324\u2013336. Springer, Heidelberg (2001)"},{"key":"45_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44585-4_18","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2001","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 207\u2013220. Springer, Heidelberg (2001)"},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/3-540-48224-5_54","volume-title":"Automata, Languages and Programming","author":"M. Benedikt","year":"2001","unstructured":"Benedikt, M., Godefroid, P., Reps, T.: Model checking of unrestricted hierarchical state machines. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 652\u2013666. Springer, Heidelberg (2001)"},{"key":"45_CR8","unstructured":"Dams, D., Namjoshi, K.S.: Orion: High-precision static error analysis for C and C++ programs. Technical report, Bell Labs (2003)"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Saff, D., Ernst, M.D.: An experimental evaluation of continuous testing during development. In: ISSTA, Boston, MA, pp. 76\u201385 (2004)","DOI":"10.1145\/1007512.1007523"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.: Guarded commands, nondeterminacy, and formal derivation of programs. Communications of the ACM\u00a018 (1975)","DOI":"10.1145\/360933.360975"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Conway, C.L., Namjoshi, K.S., Dams, D., Edwards, S.A.: Incremental algorithms for inter-procedural analysis of safety properties. Technical Report CUCS-018-05, Columbia University, New York, NY (2005)","DOI":"10.1007\/11513988_45"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Reps, T.: Optimal-time incremental semantic analysis for syntax-directed editors. In: POPL, Albuquerque, NM, pp. 169\u2013176 (1982)","DOI":"10.1145\/582153.582172"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoretical Computer Science\u00a0158, 233\u2013277 (1996)","journal-title":"Theoretical Computer Science"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(02)00740-5","volume":"3","author":"W. Hesse","year":"2003","unstructured":"Hesse, W.: The dynamic complexity of transitive closure is in DynTC0. Theoretical Computer Science\u00a03, 473\u2013485 (2003)","journal-title":"Theoretical Computer Science"},{"key":"45_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-49727-7_22","volume-title":"Static Analysis","author":"D. Schmidt","year":"1998","unstructured":"Schmidt, D., Steffen, B.: Program analysis as model checking of abstract interpretations. In: Levi, G. (ed.) SAS 1998. LNCS, vol.\u00a01503, pp. 351\u2013380. Springer, Heidelberg (1998)"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM\u00a03, 184\u2013195 (1960)","journal-title":"Communications of the ACM"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Wilson, P.: Uniprocessor garbage collection techniques. In: International Workshop on Memory Management (IWMM), Saint-Malo, France, pp. 1\u201342 (1992)","DOI":"10.1007\/BFb0017182"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Yur, J.S., Ryder, B., Landi, W., Stocks, P.: Incremental analysis of side effects for C software systems. In: ICSE, Los Angeles, CA, pp. 422\u2013432 (1997)","DOI":"10.1145\/253228.253369"},{"key":"45_CR19","doi-asserted-by":"crossref","unstructured":"Yur, J.S., Ryder, B., Landi, W.: An incremental flow- and context-sensitive pointer aliasing analysis. In: ICSE, Boston, MA, pp. 442\u2013451 (1999)","DOI":"10.1145\/302405.302676"},{"key":"45_CR20","doi-asserted-by":"crossref","unstructured":"Vivien, F., Rinard, M.: Incrementalized pointer and escape analysis. In: PLDI, Snowbird, Utah, pp. 69\u201382 (2001)","DOI":"10.1145\/378795.378804"},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Ramalingam, G., Reps, T.: A categorized bibliography on incremental computation. In: POPL, Charleston, SC, pp. 502\u2013510 (1993)","DOI":"10.1145\/158511.158710"},{"key":"45_CR22","doi-asserted-by":"crossref","unstructured":"Sittampalam, G., de Moor, O., Larsen, K.: Incremental execution of transformation specifications. In: POPL, Venice, Italy, pp. 26\u201338 (2004)","DOI":"10.1145\/964001.964004"},{"key":"45_CR23","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1145\/291889.291895","volume":"20","author":"Y.A. Liu","year":"1998","unstructured":"Liu, Y.A., Stoller, S.D., Teitelbaum, T.: Static caching for incremental computation. ACM Trans. on Programming Languages and Systems\u00a020, 546\u2013585 (1998)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"45_CR24","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00282621","volume":"24","author":"S. Horwitz","year":"1987","unstructured":"Horwitz, S., Demers, A., Teitelbaum, T.: An efficient general iterative algorithm for dataflow analysis. Acta Informatica\u00a024, 679\u2013694 (1987)","journal-title":"Acta Informatica"},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Ryder, B., Marlowe, T.: An efficient hybrid algorithm for incremental data flow analysis. In: POPL, San Francisco, CA, pp. 184\u2013196 (1990)","DOI":"10.1145\/96709.96728"},{"key":"45_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-540-24599-5_27","volume-title":"Logic Programming","author":"D. Saha","year":"2003","unstructured":"Saha, D., Ramakrishnan, C.: Incremental evaluation of tabled logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 392\u2013406. Springer, Heidelberg (2003)"},{"key":"45_CR27","doi-asserted-by":"crossref","unstructured":"Saha, D., Ramakrishnan, C.: Incremental and demand driven points to analysis using logic programming. Provided by authors (2004)","DOI":"10.1145\/1069774.1069785"},{"key":"45_CR28","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","volume":"12","author":"J. Doyle","year":"1979","unstructured":"Doyle, J.: A truth maintenance system. Artificial Intelligence\u00a012, 231\u2013272 (1979)","journal-title":"Artificial Intelligence"},{"key":"45_CR29","doi-asserted-by":"crossref","unstructured":"Sokolsky, O., Smolka, S.: Incremental model checking in the modal mu-calculus. In: CAV, Stanford, CA, pp. 351\u2013363 (1994)","DOI":"10.1007\/3-540-58179-0_67"},{"key":"45_CR30","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Jhala, R., Majumdar, R., Sanvido, M.: Extreme model checking. In: Verification: Theory and Practice, Sicily, Italy, pp. 332\u2013358 (2003)","DOI":"10.1007\/978-3-540-39910-0_16"},{"key":"45_CR31","doi-asserted-by":"crossref","unstructured":"Chen, H., Wagner, D.: MOPS: an infrastructure for examining security properties of software. In: CCS, Washington, DC, pp. 235\u2013244 (2002)","DOI":"10.1145\/586110.586142"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11513988_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:11Z","timestamp":1605643511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11513988_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540272311","9783540316862"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/11513988_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}