{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:55:03Z","timestamp":1775145303066,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540489375","type":"print"},{"value":"9783540489382","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11924661_11","type":"book-chapter","created":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T09:42:39Z","timestamp":1161942159000},"page":"166-182","source":"Crossref","is-referenced-by-count":20,"title":["Widening Polyhedra with Landmarks"],"prefix":"10.1007","author":[{"given":"Axel","family":"Simon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.scico.2005.02.003","volume":"58","author":"R. Bagnara","year":"2005","unstructured":"Bagnara, R., Hill, P., Ricci, E., Zaffanella, E.: Precise Widening Operators for Convex Polyhedra. Science of Computer Programming\u00a058(1-2), 28\u201356 (2005)","journal-title":"Science of Computer Programming"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/s00165-005-0061-1","volume":"17","author":"R. Bagnara","year":"2005","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Not necessarily closed convex polyhedra and the double desciption method. Formal Asp. Comput.\u00a017(2), 222\u2013257 (2005)","journal-title":"Formal Asp. Comput."},{"key":"11_CR3","unstructured":"Benoy, P.M.: Polyhedral Domains for Abstract Interpretation in Logic Programming. PhD thesis, Computing Lab., Univ. of Kent, Canterbury, UK (January 2002)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-48294-6_4","volume-title":"Static Analysis","author":"F. Besson","year":"1999","unstructured":"Besson, F., Jensen, T., Talpin, J.-P.: Polyhedral analysis for synchronous languages. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 51\u201368. Springer, Heidelberg (1999)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-36377-7_5","volume-title":"The Essence of Computation","author":"B. Blanchet","year":"2002","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. In: Mogensen, T.\u00c6., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol.\u00a02566, pp. 85\u2013108. Springer, Heidelberg (2002)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/BFb0039704","volume-title":"Formal Methods in Programming and Their Applications","author":"F. Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Efficient Chaotic Iteration Strategies with Widenings. In: Pottosin, I.V., Bjorner, D., Broy, M. (eds.) FMP&TA 1993. LNCS, vol.\u00a0735, pp. 128\u2013141. Springer, Heidelberg (1993)"},{"key":"11_CR7","unstructured":"Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Programs. In: Second International Symposium on Programming, Dunod, Paris, France, pp. 106\u2013130 (1976)"},{"issue":"2-3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation and Application to Logic Programs. Journal of Logic Programming\u00a013(2-3), 103\u2013179 (1992)","journal-title":"Journal of Logic Programming"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Programming Language Implementation and Logic Programming","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois Connection and Widening\/Narrowing Approaches to Abstract Interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, pp. 269\u2013295. Springer, Heidelberg (1992)"},{"key":"11_CR10","first-page":"84","volume-title":"Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Constraints among Variables of a Program. In: Symposium on Principles of Programming Languages, Tucson, Arizona, pp. 84\u201397. ACM Press, New York (1978)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-47764-0_12","volume-title":"Static Analysis","author":"N. Dor","year":"2001","unstructured":"Dor, N., Rodeh, M., Sagiv, M.: Cleanness checking of string manipulations in C programs via integer analysis. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 194\u2013212. Springer, Heidelberg (2001)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/11817963_41","volume-title":"Computer Aided Verification","author":"D. Gopan","year":"2006","unstructured":"Gopan, D., Reps, T.: Lookahead widening. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 452\u2013466. Springer, Heidelberg (2006)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11691372_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B.S. Gulavani","year":"2006","unstructured":"Gulavani, B.S., Rajamani, S.K.: Counterexample driven refinement for abstract interpretation. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 474\u2013488. Springer, Heidelberg (2006)"},{"key":"11_CR14","unstructured":"Halbwachs, N.: D\u00e9termination Automatique de Relations Lin\u00e9aires V\u00e9rifi\u00e9es par les Variables d\u2019un Programme. Th\u00e8se de 3\u00e8me icle d\u2019informatique, Universit\u00e9 scientifique et m\u00e9dicale de Grenoble, Grenoble, France (March 1979)"},{"issue":"2","key":"11_CR15","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":"6","key":"11_CR16","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1137\/S009753979528977X","volume":"28","author":"W. Harvey","year":"1999","unstructured":"Harvey, W.: Computing Two-Dimensional Integer Hulls. SIAM Journal on Computing\u00a028(6), 2285\u20132299 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Heintze, N., Tardieu, O.: Ultra-fast Aliasing Analysis using CLA: A Million Lines of C Code in a Second. In: SIGPLAN Conference on Programming Language Design and Implementation, pp. 254\u2013263 (2001)","DOI":"10.1145\/378795.378855"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/WCRE.2001.957836","volume-title":"Eighth Working Conference on Reverse Engineering","author":"A. Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: The Octagon Abstract Domain. In: Eighth Working Conference on Reverse Engineering, pp. 310\u2013319. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11609773_8","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Col\u00f3n, M., Sipma, H.B., Manna, Z.: Efficient strongly relational polyhedral analysis. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 111\u2013125. Springer, Heidelberg (2005)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/3-540-45719-4_25","volume-title":"Algebraic Methodology and Software Technology","author":"A. Simon","year":"2002","unstructured":"Simon, A., King, A.: Analyzing string buffers in C. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 365\u2013379. Springer, Heidelberg (2002)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/11547662_23","volume-title":"Static Analysis","author":"A. Simon","year":"2005","unstructured":"Simon, A., King, A.: Exploiting sparsity in polyhedral analysis. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 336\u2013351. Springer, Heidelberg (2005)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-45013-0_7","volume-title":"Logic Based Program Synthesis and Transformation","author":"A. Simon","year":"2003","unstructured":"Simon, A., King, A., Howe, J.M.: Two Variables per Linear Inequality as an Abstract Domain. In: Leuschel, M.A. (ed.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 71\u201389. Springer, Heidelberg (2003)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Steensgaard, B.: Points-to Analysis in Almost Linear Time. In: Symposium on the Principles of Progamming Languages, pp. 32\u201341 (1996)","DOI":"10.1145\/237721.237727"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2005.07.035","volume":"345","author":"Z. Su","year":"2005","unstructured":"Su, Z., Wagner, D.: A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings. Theor. Comput. Sci.\u00a0345(1), 122\u2013138 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Wagner, D.: Static analysis and computer security: New techniques for software assurance. PhD thesis, University of California at Berkeley (December 2000)","DOI":"10.1007\/3-540-47764-0_25"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11924661_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:59:36Z","timestamp":1605625176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11924661_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540489375","9783540489382"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11924661_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}