{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T11:48:04Z","timestamp":1763466484323},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026577"},{"type":"electronic","value":"9783642026584"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02658-4_44","type":"book-chapter","created":{"date-parts":[[2009,6,22]],"date-time":"2009-06-22T11:00:16Z","timestamp":1245668416000},"page":"599-613","source":"Crossref","is-referenced-by-count":25,"title":["Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences"],"prefix":"10.1007","author":[{"given":"Sven","family":"Verdoolaege","sequence":"first","affiliation":[]},{"given":"Gerda","family":"Janssens","sequence":"additional","affiliation":[]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","series-title":"ENTCS","first-page":"395","volume-title":"Int. Workshop on Compilers Optimization Meets Compiler Verification","author":"C. Alias","year":"2003","unstructured":"Alias, C., Barthou, D.: On the recognition of algorithm templates. In: Int. Workshop on Compilers Optimization Meets Compiler Verification, Warsaw, April 2003. ENTCS, vol.\u00a082, pp. 395\u2013409. Elsevier Science, Amsterdam (2003)"},{"key":"44_CR2","first-page":"177","volume-title":"POPL 1983","author":"J.R. Allen","year":"1983","unstructured":"Allen, J.R., Kennedy, K., Porterfield, C., Warren, J.D.: Conversion of control dependence to data dependence. In: POPL 1983, pp. 177\u2013189. ACM, New York (1983)"},{"doi-asserted-by":"crossref","unstructured":"Amarasinghe, S., Anderson, J., Lam, M.S., Tseng, C.-W.: An overview of the SUIF compiler for scalable parallel machines. In: Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing (1995)","key":"44_CR3","DOI":"10.1007\/3-540-57659-2_15"},{"key":"44_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-73368-3_34","volume-title":"Computer Aided Verification","author":"C. Barrett","year":"2007","unstructured":"Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 298\u2013302. Springer, Heidelberg (2007)"},{"issue":"2","key":"44_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jpdc.1996.1261","volume":"40","author":"D. Barthou","year":"1997","unstructured":"Barthou, D., Collard, J.-F., Feautrier, P.: Fuzzy array dataflow analysis. J. Parallel Distrib. Comput.\u00a040(2), 210\u2013226 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"key":"44_CR6","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":"44_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1109\/PACT.2004.1342537","volume-title":"PACT 2004: Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques","author":"C. Bastoul","year":"2004","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: PACT 2004: Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques, Washington, DC, USA, 2004, pp. 7\u201316. IEEE Computer Society, Los Alamitos (2004)"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-55844-6_142","volume-title":"Proceedings of the Fourth International Symposium on Programming Language Implementation and Logic Programming","author":"P. Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Comparing the Galois connection and widening\/narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol.\u00a0631, pp. 269\u2013295. Springer, Heidelberg (1992)"},{"key":"44_CR9","first-page":"429","volume-title":"ICS 1988: Proceedings of the 2nd international conference on Supercomputing","author":"P. Feautrier","year":"1988","unstructured":"Feautrier, P.: Array expansion. In: ICS 1988: Proceedings of the 2nd international conference on Supercomputing, pp. 429\u2013441. ACM Press, New York (1988)"},{"issue":"1","key":"44_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of array and scalar references. International Journal of Parallel Programming\u00a020(1), 23\u201353 (1991)","journal-title":"International Journal of Parallel Programming"},{"unstructured":"Feautrier, P., Collard, J., Bastoul, C.: Solving systems of affine (in)equalities. Technical report, PRiSM, Versailles University (2002)","key":"44_CR11"},{"key":"44_CR12","volume-title":"Computer-Aided Reasoning: An Approach","author":"M. Kaufmann","year":"2000","unstructured":"Kaufmann, M., Moore, J.S., Manolios, P.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Norwell (2000)"},{"unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The Omega library. Technical report, University of Maryland (November 1996)","key":"44_CR13"},{"issue":"6","key":"44_CR14","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 Program.\u00a024(6), 579\u2013598 (1996)","journal-title":"Int. J. Parallel Program."},{"key":"44_CR15","first-page":"205","volume-title":"ICPP 2002, Proceedings","author":"M. Manjunathaiah","year":"2001","unstructured":"Manjunathaiah, M., Megson, G.M., Rajopadhye, S.V., Risset, T.: Uniformization of affine dependance programs for parallel embedded system design. In: Ni, L.M., Valero, M. (eds.) ICPP 2002, Proceedings, pp. 205\u2013213. IEEE Computer Society, Los Alamitos (2001)"},{"key":"44_CR16","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/377792.377804","volume-title":"ICS 2001: Proceedings of the 15th international conference on Supercomputing","author":"N. Mateev","year":"2001","unstructured":"Mateev, N., Menon, V., Pingali, K.: Fractal symbolic analysis. In: ICS 2001: Proceedings of the 15th international conference on Supercomputing, pp. 38\u201349. ACM, New York (2001)"},{"unstructured":"Matsumoto, T., Seto, K., Fujita, M.: Formal equivalence checking for loop optimization in C programs without unrolling. In: IASTED Proc. ACST 2007: Advances in Computer Science and Technology, Anaheim, CA, USA, pp. 43\u201348. ACTA Press (2007)","key":"44_CR17"},{"doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise interprocedural analysis through linear algebra. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, pp. 330\u2013341 (2004)","key":"44_CR18","DOI":"10.1145\/964001.964029"},{"issue":"5","key":"44_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/358438.349314","volume":"35","author":"G.C. Necula","year":"2000","unstructured":"Necula, G.C.: Translation validation for an optimizing compiler. SIGPLAN Not.\u00a035(5), 83\u201394 (2000)","journal-title":"SIGPLAN Not."},{"unstructured":"Shashidhar, K.C.: Efficient automatic verification of loop and data-flow transformations by functional equivalence checking. Ph.D thesis, Katholieke Universiteit Leuven, Belgium (May 2008)","key":"44_CR20"},{"key":"44_CR21","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-31985-6_15","volume-title":"Compiler Construction","author":"K.C. Shashidhar","year":"2005","unstructured":"Shashidhar, K.C., Bruynooghe, M., Catthoor, F., Janssens, G.: Verification of source code transformations by program equivalence checking. In: Bodik, R. (ed.) CC 2005. LNCS (LNAI), vol.\u00a03443, pp. 221\u2013236. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02658-4_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T19:18:52Z","timestamp":1685042332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02658-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026577","9783642026584"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02658-4_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}