{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:49Z","timestamp":1763468029412,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237010"},{"type":"electronic","value":"9783642237027"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23702-7_17","type":"book-chapter","created":{"date-parts":[[2011,9,9]],"date-time":"2011-09-09T17:31:31Z","timestamp":1315589491000},"page":"198-215","source":"Crossref","is-referenced-by-count":6,"title":["Abstract Domains of Affine Relations"],"prefix":"10.1007","author":[{"given":"Matt","family":"Elder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junghee","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tushar","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tycho","family":"Andersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Bach, E.: Linear algebra modulo n. Unpublished manuscript (December 1992)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL (2003)","DOI":"10.1145\/604131.604137"},{"key":"17_CR3","unstructured":"Dutertre, B., de Moura, L.: Yices: An SMT solver (2006), http:\/\/yices.csl.sri.com\/"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Elder, M., Lim, J., Sharma, T., Andersen, T., Reps, T.: Abstract domains of affine relations. Tech. Rep. TR-1691, Comp. Sci. Dept., Univ. of Wisconsin, Madison, WI (June 2011)","DOI":"10.1007\/978-3-642-23702-7_17"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.: Discovering affine equalities using random interpretation. In: POPL (2003)","DOI":"10.1145\/604131.604138"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.: Precise interprocedural analysis using random interpretation. In: POPL (2005)","DOI":"10.1145\/1040305.1040332"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Hafner, J., McCurley, K.: Asymptotically fast triangularization of matrices over rings. SIAM J. Comput.\u00a020(6) (1991)","DOI":"10.1137\/0220067"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Howell, J.: Spans in the module (\u2124 m ) s . Linear and Multilinear Algebra\u00a019 (1986)","DOI":"10.1080\/03081088608817705"},{"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 relationship among variables of a program. Acta Inf.\u00a06, 133\u2013151 (1976)","journal-title":"Acta Inf."},{"key":"17_CR10","unstructured":"Kidd, N., Lal, A., Reps, T.: WALi: The Weighted Automaton Library (2007), http:\/\/www.cs.wisc.edu\/wpis\/wpds\/download.php"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-70545-1_26","volume-title":"Computer Aided Verification","author":"A. King","year":"2008","unstructured":"King, A., S\u00f8ndergaard, H.: Inferring congruence equations using SAT. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 281\u2013293. Springer, Heidelberg (2008)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-11319-2_16","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. King","year":"2010","unstructured":"King, A., S\u00f8ndergaard, H.: Automatic abstraction for congruences. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol.\u00a05944, pp. 197\u2013213. Springer, Heidelberg (2010)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55984-1_13","volume-title":"Compiler Construction","author":"J. Knoop","year":"1992","unstructured":"Knoop, J., Steffen, B.: The interprocedural coincidence theorem. In: Pfahler, P., Kastens, U. (eds.) CC 1992. LNCS, vol.\u00a0641. Springer, Heidelberg (1992)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/11817963_32","volume-title":"Computer Aided Verification","author":"A. Lal","year":"2006","unstructured":"Lal, A., Reps, T.: Improving pushdown system model checking. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 343\u2013357. Springer, Heidelberg (2006)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/11513988_44","volume-title":"Computer Aided Verification","author":"A. Lal","year":"2005","unstructured":"Lal, A., Reps, T., Balakrishnan, G.: Extended weighted pushdown systems. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 434\u2013448. Springer, Heidelberg (2005)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Lim, J., Reps, T.: A system for generating static analyzers for machine instructions. In: Hendren, L. (ed.) CC 2008. LNCS, vol.\u00a04959, pp. 36\u201352. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78791-4_3"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Meyer, C.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)","DOI":"10.1137\/1.9780898719512"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: POPL (2004)","DOI":"10.1145\/964001.964029"},{"key":"17_CR19","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_CR20","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Personal communication (April 2005)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Analysis of modular arithmetic. TOPLAS\u00a029(5) (2007)","DOI":"10.1145\/1275497.1275504"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-24622-0_21","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"T. Reps","year":"2004","unstructured":"Reps, T., Sagiv, M., Yorsh, G.: Symbolic implementation of the best transformer. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 252\u2013266. Springer, Heidelberg (2004)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Reps, T., Schwoon, S., Jha, S., Melski, D.: Weighted pushdown systems and their application to interprocedural dataflow analysis. SCP\u00a058(1-2) (October 2005)","DOI":"10.1016\/j.scico.2005.02.009"},{"key":"17_CR24","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural data flow analysis. In: Program Flow Analysis: Theory and Applications. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"17_CR25","unstructured":"Storjohann, A.: Algorithms for Matrix Canonical Forms. PhD thesis, ETH Zurich, Zurich, Switzerland, Diss. ETH No. 13922 (2000)"},{"key":"17_CR26","volume-title":"Hacker\u2019s Delight","author":"H. Warren Jr.","year":"2003","unstructured":"Warren Jr., H.: Hacker\u2019s Delight. Addison-Wesley, Reading (2003)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23702-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T03:03:26Z","timestamp":1560567806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23702-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237010","9783642237027"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23702-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}