{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T22:43:07Z","timestamp":1774219387342,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319037790","type":"print"},{"value":"9783319037806","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_12","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"129-140","source":"Crossref","is-referenced-by-count":3,"title":["Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm"],"prefix":"10.1007","author":[{"given":"W\u0142odzimierz","family":"Bielecki","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Kraska","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Klimek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","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":"12_CR2","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)"},{"issue":"8","key":"12_CR3","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., Palkowski, M., Siedlecki, K.: Coarse\u2013grained loop parallelization: Iteration space slicing vs affine transformations. Parallel Computing\u00a037(8), 479\u2013497 (2011)","journal-title":"Parallel Computing"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bielecki, W., Palkowski, M., Klimek, T.: Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Computing\u00a0(38), 518\u2013532 (2012), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.parco.2012.06.001","DOI":"10.1016\/j.parco.2012.06.001"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-39958-9_4","volume-title":"Parallel Computing Technologies","author":"W. Bielecki","year":"2013","unstructured":"Bielecki, W., Kraska, K., Klimek, T.: Transitive closure of a union of dependence relations for parameterized perfectly-nested loops. In: Malyshkin, V. (ed.) PaCT 2013. LNCS, vol.\u00a07979, pp. 37\u201350. Springer, Heidelberg (2013)"},{"key":"12_CR6","unstructured":"Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. Ph.D. thesis, Universit\u00e9 de Li\u00e8ge (1998)"},{"key":"12_CR7","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":"12_CR8","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn., 451 pages. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00271339","volume":"8","author":"J. Eve","year":"1977","unstructured":"Eve, J., Kurki\u2013Suonio, R.: On computing the transitive closure of a relation. Acta Informatica 25. X\u00a08(4), 303\u2013314 (1977)","journal-title":"Acta Informatica 25. X"},{"key":"12_CR10","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: New User Interface for Petit and Other Extensions. User Guide (1996)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0014196","volume-title":"Languages and Compilers for Parallel Computing","author":"W. Kelly","year":"1996","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)"},{"key":"12_CR12","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Series in Discrete Mathematics (1999)"},{"key":"12_CR13","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-23702-7_18"},{"key":"12_CR14","unstructured":"Verdoolaege, S.: Integer set library \u2013 manual, Tech. rep, Version: isl-0.11 (2012), \n                    \n                      http:\/\/www.kotnet.org\/skimo\/isl\/manual.pdf"},{"key":"12_CR15","unstructured":"NASA Advanced Supercomputing Division, \n                    \n                      http:\/\/www.nas.nasa.gov"},{"key":"12_CR16","unstructured":"Integer Set Library, \n                    \n                      http:\/\/www.kotnet.org\/~skimo\/isl\/"},{"key":"12_CR17","unstructured":"Omega Library, \n                    \n                      http:\/\/www.cs.umd.edu\/projects\/omega\/"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:48:48Z","timestamp":1558687728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}