{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T16:48:38Z","timestamp":1767372518671},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540254119"},{"type":"electronic","value":"9783540319856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31985-6_7","type":"book-chapter","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T18:53:19Z","timestamp":1278874399000},"page":"91-105","source":"Crossref","is-referenced-by-count":24,"title":["Experiences with Enumeration of Integer Projections of Parametric Polytopes"],"prefix":"10.1007","author":[{"given":"Sven","family":"Verdoolaege","sequence":"first","affiliation":[]},{"given":"Kristof","family":"Beyls","sequence":"additional","affiliation":[]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[]},{"given":"Francky","family":"Catthoor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Anantharaman, S., Pande, S.: Compiler optimizations for real time execution of loops on limited memory embedded systems. In: RTSS (1998)","key":"7_CR1","DOI":"10.1109\/REAL.1998.739740"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/92.386218","volume":"3","author":"F. Balasa","year":"1995","unstructured":"Balasa, F., Catthoor, F., De Man, H.: Background memory area estimation for multidimensional signal processing systems. IEEE Transactions on VLSI\u00a03(2), 157\u2013172 (1995)","journal-title":"IEEE Transactions on VLSI"},{"key":"7_CR3","first-page":"91","volume":"38","author":"A. Barvinok","year":"1999","unstructured":"Barvinok, A., Pommersheim, J.: An algorithmic theory of lattice points in polyhedra. New Perspectives in Algebraic Combinatorics\u00a038, 91\u2013147 (1999)","journal-title":"New Perspectives in Algebraic Combinatorics"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1090\/S0894-0347-03-00428-4","volume":"16","author":"A. Barvinok","year":"2003","unstructured":"Barvinok, A., Woods, K.: Short rational generating functions for lattice point problems. J. Amer. Math. Soc.\u00a016, 957\u2013979 (2003)","journal-title":"J. Amer. Math. Soc."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45874-3_9","volume-title":"Embedded Processor Design Challenges","author":"M. Bednara","year":"2002","unstructured":"Bednara, M., Hannig, F., Teich, J.: Generation of distributed loop control. In: Deprettere, F., Teich, J., Vassiliadis, S. (eds.) SAMOS 2001. LNCS, vol.\u00a02268, pp. 154\u2013170. Springer, Heidelberg (2002)"},{"unstructured":"Beyls, K.: Software Methods to Improve Data Locality and Cache Behavior. PhD thesis, Ghent University (2004)","key":"7_CR6"},{"unstructured":"Bik, A.J.C.: Compiler Support for Sparse Matrix Computations. PhD thesis, University of Leiden, The Netherlands (1996)","key":"7_CR7"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2003.10.002","volume":"313","author":"B. Boigelot","year":"2004","unstructured":"Boigelot, B., Latour, L.: Counting the solutions of Presburger equations without enumerating them. Theoretical Computer Science\u00a0313(1), 17\u201329 (2004)","journal-title":"Theoretical Computer Science"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BFb0057861","volume-title":"Euro-Par\u201998 Parallel Processing","author":"P. Boulet","year":"1998","unstructured":"Boulet, P., Redon, X.: Communication pre-evaluation in HPF. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol.\u00a01470, pp. 263\u2013272. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Boulet, P., Redon, X.: Communication pre-evaluation in HPF. Technical report, Universit\u00e9 des Sciences et Technologies de Lille, AS-182 (1998)","key":"7_CR10","DOI":"10.1007\/BFb0057861"},{"unstructured":"Braberman, V., Garbervetsky, D., Yovine, S.: On synthesizing parametric specifications of dynamic memory utilization. Technical Report TR-2004-03, VERIMAG (October 2003)","key":"7_CR11"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Parker, E., Hanlon, P.J., Lebeck, A.R.: Exact analysis of the cache behavior of nested loops. In: PLDI, pp. 286\u2013297 (2001)","key":"7_CR12","DOI":"10.1145\/378795.378859"},{"doi-asserted-by":"crossref","unstructured":"Clauss, P.: Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs. In: International Conference on Supercomputing, pp. 278\u2013285 (1996)","key":"7_CR13","DOI":"10.1145\/237578.237617"},{"doi-asserted-by":"crossref","unstructured":"Clauss, P.: Handling memory cache policy with integer points counting. In: European Conference on Parallel Processing, pp. 285\u2013293 (1997)","key":"7_CR14","DOI":"10.1007\/BFb0002746"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008069920230","volume":"19","author":"P. Clauss","year":"1998","unstructured":"Clauss, P., Loechner, V.: Parametric analysis of polyhedral iteration spaces. Journal of VLSI Signal Processing\u00a019(2), 179\u2013194 (1998)","journal-title":"Journal of VLSI Signal Processing"},{"unstructured":"D\u2019Alberto, P., Veidembaum, A., Nicolau, A., Gupta, R.: Static analysis of parameterized loop nests for energy efficient use of data caches. In: COLP (2001)","key":"7_CR16"},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"J.A. Loera De","year":"2004","unstructured":"De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. The Journal of Symbolic Computation\u00a038(4), 1273\u20131302 (2004)","journal-title":"The Journal of Symbolic Computation"},{"unstructured":"Derrien, S., Turjan, A., Zissulescu, C., Kienhuis, B., Deprettere, E.: Deriving efficient control in Kahn process network. In: SAMOS (2003)","key":"7_CR18"},{"unstructured":"Ehrhart, E.: Polyn\u00f4mes arithm\u00e9tiques et m\u00e9thode des poly\u00e8dres en combinatoire. International Series of Numerical Mathematics\u00a0vol. 35 (1977)","key":"7_CR19"},{"issue":"3","key":"7_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1051\/ro\/1988220302431","volume":"22","author":"P. Feautrier","year":"1988","unstructured":"Feautrier, P.: Parametric integer programming. Operationnelle\/Operations Research\u00a022(3), 243\u2013268 (1988)","journal-title":"Operationnelle\/Operations Research"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/BFb0038674","volume-title":"Languages and Compilers for Parallel Computing","author":"J. Ferrante","year":"1992","unstructured":"Ferrante, J., Sarkar, V., Thrash, W.: On estimating and enhancing cache effectiveness. In: Banerjee, U., Nicolau, A., Gelernter, D., Padua, D.A. (eds.) LCPC 1991. LNCS, vol.\u00a0589, pp. 328\u2013343. Springer, Heidelberg (1992)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1007\/BFb0057962","volume-title":"Euro-Par\u201998 Parallel Processing","author":"D. Fimmel","year":"1998","unstructured":"Fimmel, D., Merker, R.: Design of processor arrays for real-time applications. In: Pritchard, D., Reeve, J.S. (eds.) Euro-Par 1998. LNCS, vol.\u00a01470, pp. 1018\u20131028. Springer, Heidelberg (1998)"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/643470.643472","volume":"2","author":"B. Franke","year":"2003","unstructured":"Franke, B., O\u2019Boyle, M.: Array recovery and high-level transformations for DSP applications. ACM TECS\u00a02(2), 132\u2013162 (2003)","journal-title":"ACM TECS"},{"issue":"4","key":"7_CR24","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1145\/325478.325479","volume":"21","author":"S. Ghosh","year":"1999","unstructured":"Ghosh, S., Martonosi, M., Malik, S.: Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Transactions on Programming Languages and Systems\u00a021(4), 703\u2013746 (1999)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44743-1_5","volume-title":"Parallel Computing Technologies","author":"F. Hannig","year":"2001","unstructured":"Hannig, F., Teich, J.: Design space exploration for massively parallel processor arrays. In: Malyshkin, V.E. (ed.) PaCT 2001. LNCS, vol.\u00a02127, pp. 51\u201365. Springer, Heidelberg (2001)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-44520-X_53","volume-title":"Euro-Par 2000 Parallel Processing","author":"F. Heine","year":"2000","unstructured":"Heine, F., Slowik, A.: Volume driven data distribution for NUMA-machines. In: Bode, A., Ludwig, T., Karl, W.C., Wism\u00fcller, R. (eds.) Euro-Par 2000. LNCS, vol.\u00a01900, pp. 415\u2013424. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Kjeldsberg, P.G., Catthoor, F., Aas, E.J.: Data dependency size estimation for use in memory optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a022(7) (July 2003)","key":"7_CR27","DOI":"10.1109\/TCAD.2003.814257"},{"unstructured":"Lisper, B.: Fully automatic, parametric worst-case execution time analysis. In: Workshop on Worst-Case Execution Time (WCET) Analysis, pp. 77\u201380 (2003)","key":"7_CR28"},{"issue":"1","key":"7_CR29","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1013535431127","volume":"21","author":"V. Loechner","year":"2002","unstructured":"Loechner, V., Meister, B., Clauss, P.: Precise data locality optimization of nested loops. J. Supercomput.\u00a021(1), 37\u201376 (2002)","journal-title":"J. Supercomput."},{"doi-asserted-by":"crossref","unstructured":"Meister, B.: Projecting periodic polyhedra for loop nest analysis. In: CPC, pp. 13\u201324 (2004)","key":"7_CR30","DOI":"10.1007\/978-3-540-24723-4_10"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-24723-4_8","volume-title":"Compiler Construction","author":"E. Parker","year":"2004","unstructured":"Parker, E., Chatterjee, S.: An automata-theoretic algorithm for counting solutions to presburger formulas. In: Duesterwald, E. (ed.) CC 2004. LNCS, vol.\u00a02985, pp. 104\u2013119. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. In: Conference on Supercomputing, pp. 4\u201313 (1991)","key":"7_CR32","DOI":"10.1145\/125826.125848"},{"doi-asserted-by":"crossref","unstructured":"Pugh, W.: Counting solutions to Presburger formulas: How and why. In: PLDI, pp. 121\u2013134 (1994)","key":"7_CR33","DOI":"10.1145\/773473.178254"},{"key":"7_CR34","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)"},{"unstructured":"Seghir, R.: D\u00e9nombrement des point entiers de l\u2019union et de l\u2019image des poly\u00e9dres param\u00e9tr\u00e9s. Master\u2019s thesis, ICPS, Strasbourg, France (June 2002)","key":"7_CR35"},{"issue":"2","key":"7_CR36","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(95)90067-5","volume":"72","author":"B. Sturmfels","year":"1995","unstructured":"Sturmfels, B.: On vector partition functions. J. Comb. Theory Ser. A\u00a072(2), 302\u2013309 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"doi-asserted-by":"crossref","unstructured":"Su, E., Lain, A., et al.: Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers. In: ICS, pp. 424\u2013433 (1995)","key":"7_CR37","DOI":"10.1145\/224538.224650"},{"doi-asserted-by":"crossref","unstructured":"Turjan, A., Kienhuis, B., Deprettere, E.: A compile time based approach for solving out-of-order communication in Kahn process networks. In: ASAP (2002)","key":"7_CR38","DOI":"10.1109\/ASAP.2002.1030701"},{"doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Beyls, K., Bruynooghe, M., Catthoor, F.: Experiences with enumeration of integer projections of parametric polytopes. In: Report CW 395, Department of Computer Science, K.U. Leuven, Leuven, Belgium (October 2004)","key":"7_CR39","DOI":"10.1007\/978-3-540-31985-6_7"},{"doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Analytical computation of Ehrhart polynomials: Enabling more compiler analyses and optimizations. In: CASES, pp. 248\u2013258 (2004)","key":"7_CR40","DOI":"10.1145\/1023833.1023868"},{"doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Woods, K.M., Bruynooghe, M., Cools, R.: Computation and manipulation of enumerators of integer projections of +parametric polytopes. Report CW 392, Dept. of Computer Science, K.U. Leuven, Leuven, Belgium (2005)","key":"7_CR41","DOI":"10.1007\/978-3-540-31985-6_7"},{"issue":"5","key":"7_CR42","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/92.894155","volume":"8","author":"Y. Zhao","year":"2000","unstructured":"Zhao, Y., Malik, S.: Exact memory size estimation for array computations. IEEE Transactions on VLSI Systems\u00a08(5), 517\u2013521 (2000)","journal-title":"IEEE Transactions on VLSI Systems"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31985-6_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T05:20:08Z","timestamp":1635657608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31985-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540254119","9783540319856"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31985-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}