{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T13:15:52Z","timestamp":1791206152881,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540584308","type":"print"},{"value":"9783540487890","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:04:24Z","timestamp":1330254264000},"page":"737-748","source":"Crossref","is-referenced-by-count":12,"title":["Simplifying polynomial constraints over integers to make dependence analysis more precise"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Maslov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Pugh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"4","key":"64_CR1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/29873.29875","volume":"9","author":"J. R. Allen","year":"1987","unstructured":"J. R. Allen and K. Kennedy. Automatic translation of Fortran programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491\u2013542, October 1987.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"64_CR2","unstructured":"J. H. Davenport, Y. Siret, and E. Tournier. Computer Algebra, Systems and Algorithms for Algebraic Computation. Academic Press, 1988."},{"key":"64_CR3","unstructured":"M. Haghighat and C. Polychronopoulos. Symbolic dependence analysis for high-performance parallelizing compilers. In Advances In Languages And Compilers for Parallel Processing, August 1991."},{"key":"64_CR4","doi-asserted-by":"crossref","unstructured":"M. Haghighat and C. Polychronopoulos. Symbolic analysis: A basis for parallelization, optimization and scheduling of programs. In Utpal Banerjee et al., editor, Languages and Compilers for Parallel Computing. Springer-Verlag, August 1993. LNCS vol. 768; proceedings of the Sixth Annual Workshop on Programming Languages and Compilers for Parallel Computing.","DOI":"10.1007\/3-540-57502-2_69"},{"key":"64_CR5","unstructured":"Deepak Kapur and Yagiti Lakshman. Elimination methods: an introduction. In Bruce Donald, Deepak Kapur, and Joseph Mundy, editors, Symbolic and Numerical Computation for Artificial Intelligence. Academic Press, 1992."},{"key":"64_CR6","doi-asserted-by":"crossref","unstructured":"Vadim Maslov. Delinearization: an efficient way to break multiloop dependence equations. In ACM SIGPLAN '92 Conf. on Programming Language Design and Implementation, San Francisco, California, June 1992.","DOI":"10.1145\/143095.143130"},{"key":"64_CR7","volume-title":"Technical Report CS-TR-3109.1","author":"V. Maslov","year":"1994","unstructured":"Vadim Maslov and William Pugh. Simplifying polynomial constraints over integers to make dependence analysis more precise. Technical Report CS-TR-3109.1, Dept. of Computer Science, University of Maryland, College Park, February 1994."},{"key":"64_CR8","unstructured":"Gilles Pesant and Michel Boyer. Linear approximations of quadratic constraints. In Principles and Practice of Constraint Programming Workshop, May 1994."},{"key":"64_CR9","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/135226.135233","volume":"8","author":"W. Pugh","year":"1992","unstructured":"William Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102\u2013114, August 1992.","journal-title":"Communications of the ACM"},{"key":"64_CR10","volume-title":"Technical Report CS-TR-3191","author":"W. Pugh","year":"1992","unstructured":"William Pugh and David Wonnacott. Going beyond integer programming with the Omega test to eliminate false data dependences. Technical Report CS-TR-3191, Dept. of Computer Science, University of Maryland, College Park, December 1992. An earlier version of this paper appeared at the SIG-PLAN PLDI'92 conference."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:15:42Z","timestamp":1619558142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}