{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:06:22Z","timestamp":1740096382008,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399572"},{"type":"electronic","value":"9783642399589"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39958-9_4","type":"book-chapter","created":{"date-parts":[[2013,9,22]],"date-time":"2013-09-22T21:23:35Z","timestamp":1379885015000},"page":"37-50","source":"Crossref","is-referenced-by-count":2,"title":["Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops"],"prefix":"10.1007","author":[{"given":"W\u0142odzimierz","family":"Bielecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Kraska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Klimek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Kelly, W., Pugh, W., Rosser, E., Shpeisman, T.: Transitive closure of infinite graphs and its applications. In: Huang, C.-H., Sadayappan, P., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1995. LNCS, vol.\u00a01033, pp. 126\u2013140. Springer, Heidelberg (1996)","DOI":"10.1007\/BFb0014196"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.parco.2010.12.005","volume":"37","author":"A. Beletska","year":"2011","unstructured":"Beletska, A., Bielecki, W., Cohen, A., Pa\u0142kowski, M., Siedlecki, K.: Coarse-grained loop parallelization: Iteration space slicing vs affine transformations. Parallel Computing\u00a037, 479\u2013497 (2011)","journal-title":"Parallel Computing"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.parco.2012.06.001","volume":"38","author":"W. Bielecki","year":"2012","unstructured":"Bielecki, W., Pa\u0142kowski, M., Klimek, T.: Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Computing\u00a038, 518\u2013532 (2012), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.parco.2012.06.001","journal-title":"Parallel Computing"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-23702-7_18","volume-title":"Static Analysis","author":"S. Verdoolaege","year":"2011","unstructured":"Verdoolaege, S., Cohen, A., Beletska, A.: Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations. In: Yahav, E. (ed.) SAS 2011. LNCS, vol.\u00a06887, pp. 216\u2013232. Springer, Heidelberg (2011)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-02026-1_9","volume-title":"Combinatorial Optimization and Applications","author":"A. Beletska","year":"2009","unstructured":"Beletska, A., Barthou, D., Bielecki, W., Cohen, A.: Computing the transitive closure of a union of affine integer tuple relations. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol.\u00a05573, pp. 98\u2013109. Springer, Heidelberg (2009)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.endm.2009.03.002","volume":"33","author":"W. Bielecki","year":"2009","unstructured":"Bielecki, W., Klimek, T., Trifunovic, K.: Calculating exact transitive closure for a normalized affine integer tuple relation. Electronic Notes in Discrete Mathematics\u00a033, 7\u201314 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-17458-2_10","volume-title":"Combinatorial Optimization and Applications","author":"B. Wlodzimierz","year":"2010","unstructured":"Wlodzimierz, B., Tomasz, K., Marek, P., Beletska, A.: An iterative algorithm of computing the transitive closure of a union of parameterized affine integer tuple relations. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol.\u00a06508, pp. 104\u2013113. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2004.07.007","volume":"328","author":"S. Lombardy","year":"2004","unstructured":"Lombardy, S., Regis-Ginas, Y., Sakarovitch, J.: Introducing VAUCANSON. Theoretical Computer Science\u00a0328(1-2), 77\u201396 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10009-008-0064-3","volume":"10","author":"S. Bardin","year":"2008","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: Fast: acceleration from theory to practice. STTT\u00a010(5), 401\u2013424 (2008)","journal-title":"STTT"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-00768-2_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Bozga","year":"2009","unstructured":"Bozga, M., G\u00eerlea, C., Iosif, R.: Iterating octagons. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol.\u00a05505, pp. 337\u2013351. Springer, Heidelberg (2009)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2010.09.014","volume":"267","author":"P. Feautrier","year":"2010","unstructured":"Feautrier, P., Gonnord, L.: Accelerated invariant generation for c programs with aspic and c2fsm. Electronic Notes in Theoretical Computer Science\u00a0267, 3\u201313 (2010)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2010.09.002","volume":"267","author":"C. Ancourt","year":"2010","unstructured":"Ancourt, C., Coelho, F., Irigoin, F.: A modular static analysis approach to affine loop invariants detection. Electronic Notes in Theoretical Computer Science\u00a0267, 3\u201316 (2010)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"4_CR13","unstructured":"NASA Advanced Supercomputing Division, \n                    \n                      http:\/\/www.nas.nasa.gov"},{"key":"4_CR14","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Series in Discrete Mathematics (1999)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Shoup, V.: A Computational Introduction to Number Theory. Cambridge University Press (2005)","DOI":"10.1017\/CBO9781139165464"},{"key":"4_CR16","unstructured":"Rotman, J.: Advanced Modern Algebra, 2nd edn. Prentice Hall (2003)"},{"key":"4_CR17","unstructured":"Presburger, M.: \u00dcber de vollst\u00e4ndigkeit eines gewissen systems der arithmetik ganzer zahlen, in welchen, die addition als einzige operation hervortritt. In: Comptes Rendus du Premier Congr\u00e8s des Math\u00e9maticienes des Pays Slaves, Warsaw, vol.\u00a0395, pp. 92\u2013101 (1927)"},{"key":"4_CR18","unstructured":"Griebl, M.: Automatic Parallelization of Loop Programs for Distributed Memory Achitectures. Habilitation. Fakult\u00e4t f\u00fcr Mathematik und Informatik Universit\u00e4t Passau (2004)"},{"key":"4_CR19","unstructured":"Bondhugula, U.K.R.: Effective Automatic Parallelization and Locality Optimization Using the Polyhedral Model. Dissertation. The Ohio State University (2010)"},{"key":"4_CR20","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The Omega Library Interface Guide. Technical Report CS\u2013TR\u20133445, Dept. of Computer Science, University of Maryland College Park (1995)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Skiena, S.: The Algorithm Design Manual, 2nd edn. Springer (2008)","DOI":"10.1007\/978-1-84800-070-4"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01206273","volume":"9","author":"J. Ramanujam","year":"1995","unstructured":"Ramanujam, J.: Beyond Unimodular Transformations. Journal of Supercomputing\u00a09, 365\u2013389 (1995)","journal-title":"Journal of Supercomputing"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Cohen, E., Megiddo, N.: Recognizing Properties of Periodic Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a04, pp. 135\u2013146. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/004\/10"},{"key":"4_CR24","unstructured":"Loechner, V.: PolyLib - A library for manipulating parameterized polyhedra. Technical report, ICPS, Universit\u00e9 Louis Pasteur de Strasbourg (1999)"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39958-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T09:17:43Z","timestamp":1558084663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39958-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399572","9783642399589"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39958-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}