{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:54:43Z","timestamp":1747810483728},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285847"},{"type":"electronic","value":"9783540319719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547662_17","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:36:20Z","timestamp":1127831780000},"page":"235-250","source":"Crossref","is-referenced-by-count":8,"title":["A Generic Framework for Interprocedural Analysis of Numerical Properties"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-24723-4_2","volume-title":"Compiler Construction","author":"G. Balakrishnan","year":"2004","unstructured":"Balakrishnan, G., Reps, T.W.: Analyzing Memory Accesses in x86 Executables. In: Duesterwald, E. (ed.) CC 2004. LNCS, vol.\u00a02985, pp. 5\u201323. Springer, Heidelberg (2004)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgue, C., Mormiaux, D., Rival, X.: A Static Analyzer for Large Safety-Critical Software. In: Int. ACM Conf. on Programming Language Design and Implementation (PLDI), pp. 196\u2013207 (2003)","DOI":"10.1145\/781131.781153"},{"key":"17_CR3","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":"17_CR4","doi-asserted-by":"crossref","unstructured":"Granger, P.: Static Analysis of Arithmetical Congruences. Int. J. of Computer Math., 165\u2013190 (1989)","DOI":"10.1080\/00207168908803778"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-53982-4_10","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991","author":"P. Granger","year":"1991","unstructured":"Granger, P.: Static Analysis of Linear Congruence Equalities among Variables of a Program. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol.\u00a0493, pp. 169\u2013192. Springer, Heidelberg (1991)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.: Discovering Affine Equalities Using Random Interpretation. In: 30th ACM Symp. on Principles of Programming Languages (POPL), pp. 74\u201384 (2003)","DOI":"10.1145\/604131.604138"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.: Precise Interprocedural Analysis Using Random Interpretation. In: 32th Ann. ACM Symp. on Principles of Programming Languages (POPL), pp. 324\u2013337 (2005)","DOI":"10.1145\/1040305.1040332"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1137\/0220067","volume":"20","author":"J. Hafner","year":"1991","unstructured":"Hafner, J., McCurley, K.: Asymptotically Fast Triangularization of Matrices over Rings. SIAM J. of Computing\u00a020(6), 1068\u20131083 (1991)","journal-title":"SIAM J. of Computing"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"Karr, M.: Affine Relationships Among Variables of a Program. Acta Informatica\u00a06, 133\u2013151 (1976)","journal-title":"Acta Informatica"},{"key":"17_CR10","volume-title":"Algebra","author":"S. Lang","year":"1993","unstructured":"Lang, S.: Algebra, 3rd edn. Pearson Education, Inc., London (1993)","edition":"3"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-24725-8_2","volume-title":"Programming Languages and Systems","author":"A. Min\u00e9","year":"2004","unstructured":"Min\u00e9, A.: Relational abstract domains for the detection of floating-point run-time errors. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 3\u201317. Springer, Heidelberg (2004)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1007\/978-3-540-27836-8_85","volume-title":"Automata, Languages and Programming","author":"M. M\u00fcller-Olm","year":"2004","unstructured":"M\u00fcller-Olm, M., Seidl, H.: A note on karr\u2019s algorithm. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1016\u20131028. Springer, Heidelberg (2004)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise Interprocedural Analysis through Linear Algebra. In: 31st ACM Symp. on Principles of Programming Languages (POPL), pp. 330\u2013341 (2004)","DOI":"10.1145\/964001.964029"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-31987-0_5","volume-title":"Programming Languages and Systems","author":"M. M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Analysis of modular arithmetic. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 46\u201360. Springer, Heidelberg (2005)"},{"key":"17_CR15","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":"17_CR16","unstructured":"Storjohann, A.: Algorithms for Matrix Canonical Forms. PhD thesis, ETH Z\u00fcrich, Diss. ETH No. 13922 (2000)"},{"key":"17_CR17","unstructured":"Storjohann, A.: A Fast, Practical, and Deterministic Algorithm for Triangularizing Integer Matrices. Tech. Rep. 255, ETH Z\u00fcrich (1996)"},{"key":"17_CR18","unstructured":"Zariski, O., Samuel, P.: Commutative Algebra, Nostrand, Princeton, NJ, vol.\u00a0I (1958)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547662_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:26Z","timestamp":1605642026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547662_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285847","9783540319719"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11547662_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}