{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:51:46Z","timestamp":1768283506990,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212997","type":"print"},{"value":"9783540247302","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24730-2_38","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:00:15Z","timestamp":1280746815000},"page":"512-529","source":"Crossref","is-referenced-by-count":53,"title":["Numeric Domains with Summarized Dimensions"],"prefix":"10.1007","author":[{"given":"Denis","family":"Gopan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"DiMaio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nurit","family":"Dor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mooly","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-45789-5_17","volume-title":"Static Analysis","author":"R. Bagnara","year":"2002","unstructured":"Bagnara, R., Ricci, E., Zaffanella, E., Hill, P.M.: Possibly not closed convex polyhedra and the parma polyhedra library. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 213\u2013229. Springer, Heidelberg (2002)"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear constraints among variables of a program. In: Symp. on Princ. of Prog. Lang. (1978)","DOI":"10.1145\/512760.512770"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","volume":"14","author":"G.B. Dantzig","year":"1973","unstructured":"Dantzig, G.B., Eaves, B.C.: Fourier-motzkin elimination and its dual. Journal of Combinatorial Theory (A)\u00a014, 288\u2013297 (1973)","journal-title":"Journal of Combinatorial Theory (A)"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Automatic Verification Methods for Finite State Systems, pp. 197\u2013212 (1989)","DOI":"10.1007\/3-540-52148-8_17"},{"key":"38_CR5","unstructured":"Granger, P.: Analyses Semantiques de Congruence. PhD thesis, Ecole Polytechnique (1991)"},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1008678014487","volume":"11","author":"N. Halbwachs","year":"1997","unstructured":"Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in System Design\u00a011(2), 157\u2013185 (1997)","journal-title":"Formal Methods in System Design"},{"issue":"3","key":"38_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TSE.1977.231133","volume":"3","author":"W.H. Harrison","year":"1977","unstructured":"Harrison, W.H.: Compiler analysis of the value ranges for variables. Trans. on Softw. Eng.\u00a03(3), 243\u2013250 (1977)","journal-title":"Trans. on Softw. Eng."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T., Reps, T., Sagiv, M., Wilhelm, R.: Putting static analysis to work for verification: A case study. In: Int. Symp. on Software Testing and Analysis, pp. 26\u201338 (2000)","DOI":"10.1145\/347324.348031"},{"key":"38_CR9","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":"38_CR10","unstructured":"Masdupuy, F.: Array Indices Relational Semantic Analysis using Rational Cosets and Trapezoids. PhD thesis, Ecole Polytechnique (1993)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Mine, A.: The octagon abstract domain. In: Proc. Eighth Working Conf. on Rev. Eng., pp. 310\u2013322 (2001)","DOI":"10.1109\/WCRE.2001.957836"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Mine, A.: A few graph-based relational numerical abstract domains. In: Static Analysis Symp., pp. 117\u2013132 (2002)","DOI":"10.1007\/3-540-45789-5_11"},{"key":"38_CR13","unstructured":"Saad, Y.: Sparsekit: A basic tool kit for sparse matrix computations, version 2. Tech. rep., Comp. Sci. Dept. Univ. of Minnesota (June 1994)"},{"issue":"3","key":"38_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"M. Sagiv","year":"2002","unstructured":"Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. Trans. on Prog. Lang. and Syst.\u00a024(3), 217\u2013298 (2002)","journal-title":"Trans. on Prog. Lang. and Syst."},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-61053-7_54","volume-title":"Compiler Construction","author":"C. Verbrugge","year":"1996","unstructured":"Verbrugge, C., Co, P., Hendren, L.J.: Generalized constant propagation: A study in C. In: Gyim\u00f3thy, T. (ed.) CC 1996. LNCS, vol.\u00a01060, pp. 74\u201390. Springer, Heidelberg (1996)"},{"key":"38_CR16","unstructured":"Wagner, D., Foster, J., Brewer, E., Aiken, A.: A first step towards automated detection of buffer overrun vulnerabilities. In: Symp. on Network and Distributed Systems Security (NDSS) (February 2000)"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Yavuz-Kahveci, T., Bultan, T.: Automated verification of concurrent linked lists with counters. In: Static Analysis Symp., pp. 69\u201384 (2002)","DOI":"10.1007\/3-540-45789-5_8"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24730-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:18:05Z","timestamp":1559344685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24730-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212997","9783540247302"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24730-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}