{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:39:26Z","timestamp":1742927966621,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_9","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"98-109","source":"Crossref","is-referenced-by-count":9,"title":["Computing the Transitive Closure of a Union of Affine Integer Tuple Relations"],"prefix":"10.1007","author":[{"given":"Anna","family":"Beletska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Barthou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wlodzimierz","family":"Bielecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11561347_6","volume-title":"Generative Programming and Component Engineering","author":"C. Alias","year":"2005","unstructured":"Alias, C., Barthou, D.: On domain specific languages re-engineering. In: Gl\u00fcck, R., Lowry, M. (eds.) GPCE 2005. LNCS, vol.\u00a03676, pp. 63\u201377. Springer, Heidelberg (2005)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-45706-2_40","volume-title":"Euro-Par 2002. Parallel Processing","author":"D. Barthou","year":"2002","unstructured":"Barthou, D., Feautrier, P., Redon, X.: On the equivalence of two systems of affine recurrence equations. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol.\u00a02400, pp. 309\u2013313. Springer, Heidelberg (2002)"},{"key":"9_CR3","first-page":"29","volume-title":"ISPDC 2007: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing","author":"A. Beletska","year":"2007","unstructured":"Beletska, A., Bielecki, W., San Pietro, P.: Extracting coarse-grained parallelism in program loops with the slicing framework. In: ISPDC 2007: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing, p. 29. IEEE Computer Society Press, Washington (2007)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bielecki, W., Klimek, T., Trifunovic, K.: Calculating exact transitive closure for a normalized affine integer tuple relation. Journal of Electronic Notes in Discrete Mathematics\u00a033, 7\u201314 (2009)","DOI":"10.1016\/j.endm.2009.03.002"},{"key":"9_CR5","unstructured":"Boigelot, B.: Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Universit\u00e9 de Li\u00e8ge (1998)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-58179-0_43","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"1994","unstructured":"Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 55\u201367. Springer, Heidelberg (1994)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"H. Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and presburger arithmetic. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 268\u2013279. Springer, Heidelberg (1998)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Darte, A., Robert, Y., Vivien, F.: Scheduling and Automatic Parallelization. Birkha\u00fcser (2000)","DOI":"10.1007\/978-1-4612-1362-8"},{"issue":"6","key":"9_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF03356760","volume":"24","author":"W. Kelly","year":"1996","unstructured":"Kelly, W., Pugh, W., Rosser, E., Shpeisman, T.: Transitive closure of infinite graphs and its applications. Int. J. Parallel Programming\u00a024(6), 579\u2013598 (1996)","journal-title":"Int. J. Parallel Programming"},{"issue":"3","key":"9_CR10","first-page":"248","volume":"9","author":"K.C. Shashidhar","year":"2003","unstructured":"Shashidhar, K.C., Bruynooghe, M., Catthoor, F., Janssens, G.: An automatic verification technique for loop and data reuse transformations based on geometric modeling of programs. Journal of Universal Computer Science\u00a09(3), 248\u2013269 (2003)","journal-title":"Journal of Universal Computer Science"},{"key":"9_CR11","unstructured":"The Omega project, \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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:54:26Z","timestamp":1714622066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}