{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:27:54Z","timestamp":1725506874377},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781402081569"},{"type":"electronic","value":"9781402081576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-1-4020-8157-6_28","type":"book-chapter","created":{"date-parts":[[2008,4,7]],"date-time":"2008-04-07T12:54:40Z","timestamp":1207572880000},"page":"367-375","source":"Crossref","is-referenced-by-count":10,"title":["TVLA: A System for Generating Abstract Interpreters"],"prefix":"10.1007","author":[{"given":"Tal","family":"Lev-Ami","sequence":"first","affiliation":[]},{"given":"Roman","family":"Manevich","sequence":"additional","affiliation":[]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","volume-title":"Diplomarbeit","author":"R. Bieber","year":"2001","unstructured":"Bieber, R. (2001). Alexsa\u2014algorithm explanation by shape analysis\u2014extensions to the TVLA system. Diplomarbeit, Universitat des Saarlandes, Saarbrucken, Germany."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Cousot, P. (1997). Abstract interpretation based static analysis parameterized by semantics. In Static Analysis Symp., pages 388\u2013394.","DOI":"10.1007\/BFb0032759"},{"key":"28_CR3","first-page":"269","volume-title":"Symp. on Princ. of Prog. Lang.","author":"P. Cousot","year":"1979","unstructured":"Cousot, P. and Cousot, R. (1979). Systematic design of program analysis frameworks. In Symp. on Princ. of Prog. Lang., pages 269\u2013282, New York, NY. ACM Press."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Gopan, D., DiMaio, F., Dor, N., Reps, T., and Sagiv, M. (2004). Numeric domains with summarized dimensions. In Int. Conf. on Tools and Algs. for the Construction and Analysis of Systems, pages 512\u2013529.","DOI":"10.1007\/978-3-540-24730-2_38"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T. and Sagiv, M. (2000). TVLA: A system for implementing static analyses. In Static Analysis Symp., pages 280\u2013301.","DOI":"10.1007\/978-3-540-45099-3_15"},{"key":"28_CR6","unstructured":"Loginov, A., Reps, T., and Sagiv, M. (2004). Abstraction refinement for 3-valued-logic analysis. Tech. Rep. 1504, Comp. Sci. Dept, Univ. of Wisconsin."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Manevich, R., Ramalingam, G, Field, J., Goyal, D., and Sagiv, M. (2002), Compactly representing first-order structures for static analysis. In Static Analysis Symp., pages 196\u2013212.","DOI":"10.1007\/3-540-45789-5_16"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Manevich, R., Sagiv, M., G. Ramalingam, and J. Field (2004). Partially disjunctive heap abstraction. In Static Analysis Symp. To appear.","DOI":"10.1007\/978-3-540-27864-1_20"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Ramalingam, G, Warshavsky, A., Field, J., Goyal, D., and Sagiv, M. (2002). Deriving specialized program analyses for certifying component-client conformance. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 83\u201394.","DOI":"10.1145\/512529.512540"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Reps, T., Sagiv, M., and Loginov, A. (2003). Finite differencing of logical formulas for static analysis. In European Symp. on Programming, pages 380\u2013398.","DOI":"10.1007\/3-540-36575-3_26"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Rinetzky, N. and Sagiv, M. (2001). Interprocedural shape analysis for recursive programs. In Wilhelm, R., editor, Proc. of CC 2001, volume 2027 of LNCS, pages 133\u2013149. Springer.","DOI":"10.1007\/3-540-45306-7_10"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/271510.271517","volume":"20","author":"M. Sagiv","year":"1998","unstructured":"Sagiv, M., Reps, T., and Wilhelm, R. (1998). Solving shape-analysis problems in languages with destructive updating. Trans. on Prog. Lang. and Syst., 20(1):1\u201350.","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Sagiv, M., Reps, T., and Wilhelm, R. (2002). Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. andSyst.","DOI":"10.1145\/514188.514190"},{"key":"28_CR14","first-page":"483","volume":"2694","author":"R. Shaham","year":"2003","unstructured":"Shaham, R., Yahav, E., Kolodner, E., and Sagiv, M. (2003). Establishing local temporal heap safety properties with applications to compile-time memory management. In Proc. of SAS\u201903, volume 2694 of LNCS, pages 483\u2013503.","journal-title":"Proc. of SAS\u201903"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Yahav, E. (2001). Verifying safety properties of concurrent Java programs using 3-valued logic. In Symp. on Princ. of Prog. Lang., pages 27\u201340.","DOI":"10.1145\/360204.360206"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Yahav, E. and Ramalingam, G. (2004). Verifying safety properties using separation and heterogeneous abstractions. In SIGPLAN Conf. on Prog. Lang. Design and Impl. To appear.","DOI":"10.1145\/996841.996846"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Yahav, E., Reps, T., Sagiv, M., and Wilhelm, R. (2003). Verifying temporal heap properties specified via evolution logic. In European Symp. on Programming, volume 2618 of LNCS.","DOI":"10.1007\/3-540-36575-3_15"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Yahav, E. and Sagiv, M. (2003). Automatically verifying concurrent queue algorithms. In Workshop on Software Model Checking.","DOI":"10.1016\/S1571-0661(05)80006-4"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Reps, T., and Sagiv, M. (2004). Symbolically computing most-precise abstract operations for shape analysis. In Int. Conf. on Tools and Algs. for the Construction and Analysis of Systems, pages 530\u2013545.","DOI":"10.1007\/978-3-540-24730-2_39"}],"container-title":["IFIP International Federation for Information Processing","Building the Information Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-8157-6_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T01:08:08Z","timestamp":1619658488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-8157-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9781402081569","9781402081576"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-8157-6_28","relation":{},"subject":[]}}