{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:20:27Z","timestamp":1765887627706,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T00:00:00Z","timestamp":1398816000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10878-014-9740-2","type":"journal-article","created":{"date-parts":[[2014,4,29]],"date-time":"2014-04-29T04:22:35Z","timestamp":1398745355000},"page":"253-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Using basis dependence distance vectors in the modified Floyd\u2013Warshall algorithm"],"prefix":"10.1007","volume":"30","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","published-online":{"date-parts":[[2014,4,30]]},"reference":[{"key":"9740_CR1","doi-asserted-by":"crossref","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 (2010) A modular static analysis approach to affine loop invariants detection. Electron Notes Theor Comput Sci 267:3\u201316","journal-title":"Electron Notes Theor Comput Sci"},{"key":"9740_CR2","doi-asserted-by":"crossref","unstructured":"Beletska A, Barthou D, Bielecki W, Cohen A (2009) Computing the transitive closure of a union of affine integer tuple relations. In: COCOA09. Springer, Berlin, pp. 98\u2013109","DOI":"10.1007\/978-3-642-02026-1_9"},{"issue":"8","key":"9740_CR3","doi-asserted-by":"crossref","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 (2011) Coarse-grained loop parallelization: iteration space slicing vs affine transformations. Parallel Comput 37(8):479\u2013497","journal-title":"Parallel Comput"},{"key":"9740_CR4","doi-asserted-by":"crossref","unstructured":"Bielecki W, Kraska K, Klimek T (2013) Transitive closure of a union of dependence relations for parameterized perfectly-nested loops. In: Malyshkin V et al. (eds) PaCT-2013, LNCS, vol 7979. Springer, Heidelberg, pp 37\u201350","DOI":"10.1007\/978-3-642-39958-9_4"},{"key":"9740_CR5","doi-asserted-by":"crossref","unstructured":"Bielecki W, Palkowski M, Klimek T (2012) Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Comput 38:518\u2013532. http:\/\/dx.doi.org\/10.1016\/j.parco.2012.06.001","DOI":"10.1016\/j.parco.2012.06.001"},{"key":"9740_CR6","unstructured":"Boigelot B (1998) Symbolic methods for exploring infinite state spaces. Ph.D. thesis, Universit\u00e9 de Li\u00e8ge"},{"key":"9740_CR7","doi-asserted-by":"crossref","unstructured":"Bozga M, Girlea C, Iosif R (2009) Iterating octagons. ETAPS 2009, TACAS\u201909. Springer, New York, pp 337\u2013351","DOI":"10.1007\/978-3-642-00768-2_29"},{"key":"9740_CR8","unstructured":"Cohen E, Megiddo N (1991) Recognizing properties of periodic graphs, DIMACS series in discrete mathematics and theoretical computer science, vol 4. American Mathematical Society, pp 135\u2013146"},{"key":"9740_CR9","doi-asserted-by":"crossref","unstructured":"Deng X, Dymond P (1998) On multiprocessor system scheduling. J Comb Optim 1(4):377\u2013392","DOI":"10.1023\/A:1009790611712"},{"key":"9740_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory","author":"R Diestel","year":"2010","unstructured":"Diestel R (2010) Graph theory, 4th edn. Springer, New York","edition":"4"},{"issue":"4","key":"9740_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00271339","volume":"8","author":"J Eve","year":"1977","unstructured":"Eve J, Kurki-Suonio R (1977) On computing the transitive closure of a relation. Acta Informatica 25. X 8(4):303\u2013314","journal-title":"Acta Informatica 25. X"},{"key":"9740_CR12","unstructured":"Feautrier P (2012) Approximating the transitive closure of a Boolean-Affine relation, IMPACT 2012 second international workshop on polyhedral compilation techniques, Paris, France, http:\/\/impact.gforge.inria.fr\/impact2012\/"},{"key":"9740_CR13","unstructured":"Griebl M (2004) Automatic parallelization of loop programs for distributed memory achitectures. Fakult\u00e4t f\u00fcr Mathematik und Informatik Universit\u00e4t Passau, Habilitation"},{"issue":"2","key":"9740_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1009799631608","volume":"1","author":"L Hollermann","year":"1997","unstructured":"Hollermann L, Tsan-sheng H, Lopez D, Vertanen K (1997) Scheduling problems in a practical allocation model. J Comb Optim 1(2):129\u2013149","journal-title":"J Comb Optim"},{"key":"9740_CR15","unstructured":"Integer Set Library, http:\/\/www.kotnet.org\/skimo\/isl\/"},{"key":"9740_CR16","unstructured":"Kelly W, Maslov V, Pugh W, Rosser E, Shpeisman T, Wonnacott D (1996) New User Interface for Petit and Other Extensions. User Guide"},{"key":"9740_CR17","doi-asserted-by":"crossref","unstructured":"Kelly W, Pugh W, Rosser E, Shpeisman T (1996) Transitive closure of infinite graphs and its applications. LCPC\u201995, Columbus, Ohio, vol 1033. Springer, New York, pp 126\u2013140","DOI":"10.1007\/BFb0014196"},{"key":"9740_CR18","unstructured":"NASA Advanced Supercomputing Division, http:\/\/www.nas.nasa.gov"},{"key":"9740_CR19","unstructured":"Omega Library, http:\/\/www.cs.umd.edu\/projects\/omega\/"},{"key":"9740_CR20","unstructured":"Presburger M (1927) \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, 395, Warsaw, pp 92\u2013101"},{"key":"9740_CR21","unstructured":"Rotman J (2003) Advanced modern algebra, 2nd edn. Prentice Hall, Upper Saddle River"},{"key":"9740_CR22","unstructured":"Schrijver A (1999) Theory of linear and integer programming. Series in Discrete Mathematics"},{"key":"9740_CR23","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139165464","volume-title":"A computational Introduction to number theory","author":"V Shoup","year":"2005","unstructured":"Shoup V (2005) A computational Introduction to number theory. Cambridge University Press, New York"},{"key":"9740_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-070-4","volume-title":"The algorithm design manual","author":"S Skiena","year":"2008","unstructured":"Skiena S (2008) The algorithm design manual, 2nd edn. Springer, Berlin","edition":"2"},{"key":"9740_CR25","unstructured":"Verdoolaege S (2012) Integer set library\u2014manual, Tech. rep. 2012, Version: isl-0.11 www.kotnet.org\/skimo\/isl\/manual"},{"key":"9740_CR26","doi-asserted-by":"crossref","unstructured":"Verdoolaege S, Cohen A, Beletska A (2011) Transitive closures of affine integer tuple relations and their overapproximations. SAS, pp 216\u2013232","DOI":"10.1007\/978-3-642-23702-7_18"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9740-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9740-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9740-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T19:49:13Z","timestamp":1565380153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9740-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,30]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9740"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9740-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2014,4,30]]}}}