{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:40:28Z","timestamp":1737290428528,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540713142"},{"type":"electronic","value":"9783540713166"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71316-6_20","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:58:28Z","timestamp":1184605108000},"page":"284-299","source":"Crossref","is-referenced-by-count":2,"title":["Interprocedurally Analysing Linear Inequality Relations"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Seidl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Flexeder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Petter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44898-5_19","volume-title":"Static Analysis","author":"R. Bagnara","year":"2003","unstructured":"Bagnara, R., et al.: Precise widening operators for convex polyhedra. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 337\u2013354. Springer, Heidelberg (2003)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/781131.781153","volume-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)","author":"B. Blanchet","year":"2003","unstructured":"Blanchet, B., et al.: A static analyzer for large safety-critical software. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 196\u2013207. ACM Press, New York (2003)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/b98283","volume-title":"Static Analysis","author":"J. Cortadella","year":"2004","unstructured":"Cortadella, J., Claris\u00f3, R.: The Octahedron Abstract Domain. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 312\u2013327. Springer, Heidelberg (2004)"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation\u00a02(4), 511\u2013547 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/512760.512770","volume-title":"5th Ann. ACM Symposium on Principles of Programming Languages (POPL)","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: 5th Ann. ACM Symposium on Principles of Programming Languages (POPL), pp. 84\u201397. ACM Press, New York (1978)"},{"key":"20_CR6","first-page":"27","volume-title":"Machine Intelligence, vol. 5","author":"Z. Manna","year":"1970","unstructured":"Manna, Z., McCarthy, J.: Properties of programs and partial function logic. In: Machine Intelligence, vol. 5, pp. 27\u201337. Edinburgh University Press,, Edinburgh (1970)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: The Octagon abstract domain. In: Analysis, Slicing, and Transformation (AST), pp. 310\u2013319 (2001)","DOI":"10.1109\/WCRE.2001.957836"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Program analysis through linear algebra. In: 31th Ann. ACM Symposium on Principles of Programming Languages (POPL) (2004)","DOI":"10.1145\/964001.964029"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11547662_17","volume-title":"Static Analysis","author":"M. M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., Seidl, H.: A generic framework for interprocedural analysis of numerical properties. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 235\u2013250. Springer, Heidelberg (2005)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"Z. Manna","year":"2005","unstructured":"Manna, Z., et al.: 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":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-540-27864-1_7","volume-title":"Static Analysis","author":"S. Sankaranarayanan","year":"2004","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Constraint-Based Linear-Relations Analysis. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 53\u201368. Springer, Heidelberg (2004)"},{"key":"20_CR12","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., New York (1986)"},{"key":"20_CR13","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)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71316-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:09:41Z","timestamp":1737288581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71316-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540713142","9783540713166"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71316-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}