{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:27:42Z","timestamp":1767929262538,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280057","type":"print"},{"value":"9783540318644","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532231_8","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T18:56:52Z","timestamp":1279738612000},"page":"99-115","source":"Crossref","is-referenced-by-count":43,"title":["Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures"],"prefix":"10.1007","author":[{"given":"T.","family":"Lev-Ami","sequence":"first","affiliation":[]},{"given":"N.","family":"Immerman","sequence":"additional","affiliation":[]},{"given":"T.","family":"Reps","sequence":"additional","affiliation":[]},{"given":"M.","family":"Sagiv","sequence":"additional","affiliation":[]},{"given":"S.","family":"Srivastava","sequence":"additional","affiliation":[]},{"given":"G.","family":"Yorsh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00976239","volume":"4","author":"C. Hoare","year":"1975","unstructured":"Hoare, C.: Recursive data structures. Int. J. of Comp. and Inf. Sci.\u00a04, 105\u2013132 (1975)","journal-title":"Int. J. of Comp. and Inf. Sci."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s001530050130","volume":"38","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E., Otto, M., Rosen, E.: Undecidability results on two-variable logics. Archive of Math. Logic\u00a038, 313\u2013354 (1999)","journal-title":"Archive of Math. Logic"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-30124-0_15","volume-title":"Computer Science Logic","author":"N. Immerman","year":"2004","unstructured":"Immerman, N., Rabinovich, A., Reps, T., Sagiv, M., Yorsh, G.: The boundary between decidability and undecidability for transitive-closure logics. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 160\u2013174. Springer, Heidelberg (2004)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T., Sagiv, M.: TVLA: A system for implementing static analyses. In: Static Analysis Symp., pp. 280\u2013301 (2000)","DOI":"10.1007\/978-3-540-45099-3_15"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. In: Trans. on Prog. Lang. and Syst. (2002)","DOI":"10.1145\/514188.514190"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-27813-9_2","volume-title":"Computer Aided Verification","author":"T. Reps","year":"2004","unstructured":"Reps, T., Sagiv, M., 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":"8_CR7","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Leino, K., Lillibridge, M., Nelson, G., Saxe, J., Stata, R.: Extended static checking for java. In: SIGPLAN Conf. on Prog. Lang. Design and Impl. (2002)","DOI":"10.1145\/512529.512558"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"M\u00f8ller, A., Schwartzbach, M.I.: The pointer assertion logic engine. In: SIGPLAN Conf. on Prog. Lang. Design and Impl., pp. 221\u2013231 (2001)","DOI":"10.1145\/378795.378851"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-61511-3_75","volume-title":"CADE-13: Proceedings of the 13th International Conference on Automated Deduction","author":"C. Weidenbach","year":"1996","unstructured":"Weidenbach, C., Gaede, B., Rock, G.: Spass & flotter version 0.42. In: CADE-13: Proceedings of the 13th International Conference on Automated Deduction, pp. 141\u2013145. Springer, Heidelberg (1996)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Nelson, G.: Verifying reachability invariants of linked structures. In: Symp. on Princ. of Prog. Lang., pp. 38\u201347 (1983)","DOI":"10.1145\/567067.567073"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-94-017-0253-9_7","volume-title":"Thirty Five Years of Automating Mathematics","author":"A. Avron","year":"2003","unstructured":"Avron, A.: Transitive closure and the mechanization of mathematics. In: Thirty Five Years of Automating Mathematics, pp. 149\u2013171. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T., Immerman, N., Reps, T., Sagiv, M., Srivastava, S., Yorsh, G.: Simulating reachability using first-order logic with applications to verification of linked data structures. Available at (2005), http:\/\/www.cs.tau.ac.il\/~tla\/2005\/papers\/cade05full.pdf","DOI":"10.1007\/11532231_8"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/512950.512973","volume-title":"POPL \u201977: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL \u201977: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, Los Angeles, California, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Loginov, A., Reps, T., Sagiv, M.: Abstraction refinement via inductive learning. In: Proc. Computer-Aided Verif. (2005)","DOI":"10.1007\/11513988_50"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Elgaard, J., M\u00f8ller, A., Schwartzbach, M.I.: Compile-time debugging of C programs working on trees. In: European Symp. On Programming, pp. 119\u2013134 (2000)","DOI":"10.1007\/3-540-46425-5_8"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Reps, T., Sagiv, M.: A decidable logic for describing linked data structures. In: European Symp. On Programming, pp. 2\u201319 (1999)","DOI":"10.1007\/3-540-49099-X_2"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/271510.271517","volume":"20","author":"M. Sagiv","year":"1998","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. Trans. on Prog. Lang. and Syst.\u00a020, 1\u201350 (1998)","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Hendren, L.: Parallelizing Programs with Recursive Data Structures. PhD thesis, Cornell Univ., Ithaca, NY (1990)","DOI":"10.1145\/318789.318812"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Immerman, N., Rabinovich, A., Reps, T., Sagiv, M., Yorsh, G.: Verification via structure simulation. In: Proc. Computer-Aided Verif, pp. 281\u2013294 (2004)","DOI":"10.1007\/978-3-540-27813-9_22"},{"key":"8_CR20","first-page":"330","volume":"5","author":"R. Leino","year":"1998","unstructured":"Leino, R.: Recursive object types in a logic of object-oriented programs. Nordic J. of Computing\u00a05, 330\u2013360 (1998)","journal-title":"Nordic J. of Computing"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/inco.1995.1102","volume":"120","author":"G. Dong","year":"1995","unstructured":"Dong, G., Su, J.: Incremental and decremental evaluation of transitive closure by first-order queries. Inf. & Comput.\u00a0120, 101\u2013106 (1995)","journal-title":"Inf. & Comput."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1006\/jcss.1997.1520","volume":"55","author":"S. Patnaik","year":"1997","unstructured":"Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. Journal of Computer and System Sciences\u00a055, 199\u2013209 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR23","unstructured":"Hesse, W.: Dynamic Computational Complexity. PhD thesis, Department of Computer Science, UMass, Amherst (2003)"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Reps, T., Sagiv, M., Loginov, A.: Finite differencing of logical formulas for static analysis. In: European Symp. On Programming, pp. 380\u2013398 (2003)","DOI":"10.1007\/3-540-36575-3_26"},{"key":"8_CR25","first-page":"249","volume-title":"SIGPLAN Conf. on Prog. Lang. Design and Impl.","author":"L. Hendren","year":"1992","unstructured":"Hendren, L., Hummel, J., Nicolau, A.: Abstractions for recursive pointer data structures: Improving the analysis and the transformation of imperative programs. In: SIGPLAN Conf. on Prog. Lang. Design and Impl., New York, NY, pp. 249\u2013260. ACM Press, New York (1992)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-20"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532231_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:17Z","timestamp":1605643757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532231_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280057","9783540318644"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11532231_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}