{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:45:55Z","timestamp":1725515155361},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691631"},{"type":"electronic","value":"9783540691662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69166-2_20","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T09:25:03Z","timestamp":1215941103000},"page":"299-314","source":"Crossref","is-referenced-by-count":2,"title":["Analysing All Polynomial Equations in ${\\mathbb Z_{2^w}}$"],"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","volume-title":"Gr\u00f6bner Bases \u2013 a computational approach to commutative algebra","author":"T. Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases \u2013 a computational approach to commutative algebra. Springer, New York (1993)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.scico.2006.03.004","volume":"64","author":"M. Colon","year":"2007","unstructured":"Colon, M.: Polynomial approximations of the relational semantics of imperative programs. Science of Computer Programming\u00a064, 76\u201396 (2007)","journal-title":"Science of Computer Programming"},{"key":"20_CR3","unstructured":"Hungerb\u00fchler, N., Specker, E.: A generalization of the smarandache function to several variables. Integers: Electronic Journal Combinatorial Number Theory\u00a06 (2006)"},{"key":"20_CR4","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":"20_CR5","volume-title":"Commutative Ring Theory","author":"H. Matsumura","year":"1989","unstructured":"Matsumura, H.: Commutative Ring Theory. Cambridge University Press, Cambridge (1989)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"M. M\u00fcller-Olm","year":"2001","unstructured":"M\u00fcller-Olm, M., R\u00fcthing, O.: On the complexity of constant propagation. In: Sands, D. (ed.) ESOP 2001 and ETAPS 2001. LNCS, vol.\u00a02028, Springer, Heidelberg (2001)"},{"key":"20_CR7","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":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11672142_3","volume-title":"STACS 2006","author":"M. M\u00fcller-Olm","year":"2006","unstructured":"M\u00fcller-Olm, M., Petter, M., Seidl, H.: Interprocedurally analyzing polynomial identities. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 50\u201367. Springer, Heidelberg (2006)"},{"issue":"5","key":"20_CR9","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":"20_CR10","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (2005)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Analysis of modular arithmetic. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a029(5) (2007)","DOI":"10.1145\/1275497.1275504"},{"key":"20_CR12","unstructured":"Petter, M.: Berechnung von polynomiellen Invarianten. Master\u2019s thesis, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen (2004)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis","author":"E. Rodr\u00edguez-Carbonell","year":"2004","unstructured":"Rodr\u00edguez-Carbonell, E., Kapur, D.: An abstract interpretation approach for automatic generation of polynomial invariants. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, Springer, Heidelberg (2004)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.scico.2006.03.003","volume":"64","author":"E. Rodr\u00edguez-Carbonell","year":"2007","unstructured":"Rodr\u00edguez-Carbonell, E., Kapur, D.: Automatic generation of polynomial invariants of bounded degree using abstract interpretation. Science of Computer Programming\u00a064, 54\u201375 (2007)","journal-title":"Science of Computer Programming"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, S., Henry, Z.M., Sipma, B.: Non-linear loop invariant generation using gr\u00f6bner bases. In: ACM SIGPLAN Principles of Programming Languages (POPL) (2004)","DOI":"10.1145\/964001.964028"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Shekhar, N., Kalla, P., Enescu, F., Gopalakrishnan, S.: Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. In: International Conference on Computer-Aided Design (ICCAD), pp. 291\u2013296 (2005)","DOI":"10.1109\/ICCAD.2005.1560081"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0022-314X(74)90031-6","volume":"6","author":"D. Singmaster","year":"1974","unstructured":"Singmaster, D.: On polynomial functions (mod m). Journal of Number Theory\u00a06, 345\u2013352 (1974)","journal-title":"Journal of Number Theory"},{"key":"20_CR18","unstructured":"Wienand, O.: The Groebner basis of the ideal of vanishing polynomials. Journal of Symbolic Computation (JSC) (to appear, 2007); Preprint in arxiv math.AC\/0801.1177"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69166-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:30:12Z","timestamp":1620016212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69166-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691631","9783540691662"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69166-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}