{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:09Z","timestamp":1761596949480},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_3","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"50-67","source":"Crossref","is-referenced-by-count":12,"title":["Interprocedurally Analyzing Polynomial Identities"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[]},{"given":"Michael","family":"Petter","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases","author":"T. Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases. Springer, Heidelberg (1993)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61474-5_80","volume-title":"Computer Aided Verification","author":"S. Bensalem","year":"1996","unstructured":"Bensalem, S., Lakhnech, Y., Saidi, H.: Powerful Techniques for the Automatic Generation of Invariants. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, Springer, Heidelberg (1996)"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0304-3975(96)00191-0","volume":"173","author":"N. Bj\u00f8rner","year":"1997","unstructured":"Bj\u00f8rner, N., Browne, A., Manna, Z.: Automatic Generation of Invariants and Intermediate Assertions. Theoretical Computer Science\u00a0173(1), 49\u201387 (1997)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-27864-1_22","volume-title":"Static Analysis","author":"M.A. Col\u00f3n","year":"2004","unstructured":"Col\u00f3n, M.A.: Approximating the Algebraic Relational Semantics of Imperative Programs. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 296\u2013311. Springer, Heidelberg (2004)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30579-8_1","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Cousot","year":"2005","unstructured":"Cousot, P.: Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"3_CR6","first-page":"237","volume-title":"IFIP Conf. on Formal Description of Programming Concepts","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Recursive Procedures. In: Neuhold, E. (ed.) IFIP Conf. on Formal Description of Programming Concepts, pp. 237\u2013277. North-Holland, Amsterdam (1977)"},{"key":"3_CR7","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":"3_CR8","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"},{"key":"3_CR9","unstructured":"Hecht, M.S.: Flow Analysis of Computer Programs. Elsevier North-Holland (1977)"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J. Kam","year":"1976","unstructured":"Kam, J., Ullman, J.: Global Data Flow Analysis and Iterative Algorithms. Journal of the ACM (JACM)\u00a023(1), 158\u2013171 (1976)","journal-title":"Journal of the ACM (JACM)"},{"key":"3_CR11","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":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/3-540-45789-5_4","volume-title":"Static Analysis","author":"M. M\u00fcller-Olm","year":"2002","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Polynomial Constants are Decidable. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 4\u201319. Springer, Heidelberg (2002)"},{"key":"3_CR13","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)"},{"issue":"5","key":"3_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.ipl.2004.05.004","volume":"91","author":"M. M\u00fcller-Olm","year":"2004","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Computing Polynomial Program Invariants. Information Processing Letters (IPL)\u00a091(5), 233\u2013244 (2004)","journal-title":"Information Processing Letters (IPL)"},{"key":"3_CR15","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\/982962.964029"},{"key":"3_CR16","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":"3_CR17","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":"3_CR18","unstructured":"Petter, M.: Berechnung von polynomiellen Invarianten, Diploma Thesis (2004)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Reif, J.R., Lewis, H.R.: Symbolic Evaluation and the Global Value Graph. In: 4th\u00a0ACM Symp. on Principles of Programming Languages\u00a0POPL 1977, pp. 104\u2013118 (1977)","DOI":"10.1145\/512950.512961"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-27864-1_21","volume-title":"Static Analysis","author":"E. Rodriguez-Carbonell","year":"2004","unstructured":"Rodriguez-Carbonell, E., Kapur, D.: An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 280\u2013295. Springer, Heidelberg (2004)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Rodriguez-Carbonell, E., Kapur, D.: Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations. In: Int. ACM Symposium on Symbolic and Algebraic Computation 2004 (ISSAC 2004), pp. 266\u2013273 (2004)","DOI":"10.1145\/1005285.1005324"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Non-linear Loop Invariant Generation using Gr\u00f6bner Bases. In: ACM Symp. on Principles of Programming Languages (POPL), pp. 318\u2013329 (2004)","DOI":"10.1145\/982962.964028"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:31:26Z","timestamp":1555471886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11672142_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}