{"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":1775145303011,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540254355","type":"print"},{"value":"9783540319870","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31987-0_5","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T13:42:00Z","timestamp":1292852520000},"page":"46-60","source":"Crossref","is-referenced-by-count":34,"title":["Analysis of Modular Arithmetic"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints among Variables of a Program. In: 5th ACM Symp. on Principles of Programming Languages (POPL), pp. 84\u201397 (1978)","DOI":"10.1145\/512760.512770"},{"key":"5_CR2","volume-title":"The Java Language Specification","author":"J. Gosling","year":"1996","unstructured":"Gosling, J., Joy, B., Steele, G.: The Java Language Specification. Addison-Wesley, Reading (1996)"},{"key":"5_CR3","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":"5_CR4","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"},{"issue":"6","key":"5_CR5","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":"5_CR6","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":"5_CR7","unstructured":"Leroux, J.: Algorithmique de la V\u00e9rification des Syst\u00e8mes \u00e0 Compteurs: Approximation et Acc\u00e9l\u00e9ration. PhD thesis, Ecole Normale Sup\u00e9rieure de Cachan (2003)"},{"key":"5_CR8","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":"5_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":"5_CR10","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Interprocedural Analysis of Modular Arithmetic. Technical Report 789, Fachbereich Informatik, Universit\u00e4t Dortmund (2004)"},{"key":"5_CR11","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":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44898-5_11","volume-title":"Static Analysis","author":"T. Reps","year":"2003","unstructured":"Reps, T., Schwoon, S., Jha, S.: Weighted Pushdown Systems and their Application to Interprocedural Dataflow Analysis. In: Cousot, R. (ed.) SAS 2003. LNCS, vol.\u00a02694, pp. 189\u2013213. Springer, Heidelberg (2003)"},{"key":"5_CR13","unstructured":"Storjohann, A.: Algorithms for Matrix Canonical Forms. PhD thesis, ETH Z\u00fcrich, Diss. ETH No. 13922 (2000)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31987-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:33:22Z","timestamp":1605742402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31987-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540254355","9783540319870"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31987-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}