{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T11:59:51Z","timestamp":1724327991581},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. VLSI Syst."],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1109\/tvlsi.2008.2002049","type":"journal-article","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T19:35:06Z","timestamp":1241465706000},"page":"983-996","source":"Crossref","is-referenced-by-count":18,"title":["Symbolic Polynomial Maximization Over Convex Sets and Its Application to Memory Requirement Estimation"],"prefix":"10.1109","volume":"17","author":[{"given":"P.","family":"Clauss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.J.","family":"Fernandez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Garbervetsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Verdoolaege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"clauss","year":"2006","journal-title":"Symbolic polynomial maximization over convex sets and its application to memory requirement estimation"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1155\/2007\/75947"},{"key":"ref33","author":"verdoolaege","year":"2007","journal-title":"Barvinok A library for counting the number of integer points in parametrized and non-parametrized polytopes"},{"key":"ref32","author":"haible","year":"2006","journal-title":"CLN Class library for numbers"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0494"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","author":"ziegler","year":"1995","journal-title":"Lectures on Polytopes"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2004.1342537"},{"key":"ref36","author":"zhu","year":"2006","journal-title":"Computation of memory requirements for multi-dimensional signal processing applications"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.1261"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407931"},{"key":"ref28","author":"farin","year":"1993","journal-title":"Curves and Surfaces in Computer Aided Geometric Design"},{"key":"ref27","author":"ratschek","year":"1984","journal-title":"Computer Methods for the Range of Functions"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/9.661615"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/HSC.1998.666252"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/196244.196313","article-title":"memory estimation for high level synthesis","author":"verbauwhede","year":"1994","journal-title":"31st Design Automation Conference"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1231-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1176760.1176771"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31985-6_7"},{"key":"ref24","author":"meister","year":"2004","journal-title":"Stating and manipulating periodicity in the polytope model Applications to program analysis and optimization"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008069920230"},{"key":"ref26","author":"rabl","year":"2006","journal-title":"Volume calculation and estimation of parameterized integer polytopes"},{"key":"ref25","author":"loechner","year":"1999","journal-title":"Polylib A library for manipulating parameterized polyhedra"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604148"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/317636.317785"},{"key":"ref53","first-page":"70","article-title":"memory usage verification for oo programs","volume":"3672","author":"chin","year":"2005","journal-title":"Proc 12th Int Symp Static Analysis (SAS 2005)"},{"key":"ref52","first-page":"70","article-title":"optimized live heap bound analysis","volume":"2575","author":"unnikrishnan","year":"2003","journal-title":"Proc VMCAI '03"},{"key":"ref10","volume":"1","author":"bernstein","year":"1952","journal-title":"Collected Works"},{"key":"ref11","volume":"2","author":"bernstein","year":"1954","journal-title":"Collected Works"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2004.09.004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4485(00)00056-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8396(87)90012-4"},{"key":"ref14","first-page":"421","article-title":"application of bernstein expansion to the solution of control problems","author":"garloff","year":"1999","journal-title":"Proc MISC 99 Workshop on Applications of Interval Analysis to Systems and Control"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1049\/PBCE056E_ch14","author":"garloff","year":"1999","journal-title":"Symbolic Methods in Control Systems Analysis and Design"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8396(02)00146-2"},{"key":"ref17","article-title":"graphite: loop optimizations based on the polyhedral model for gcc","author":"pop","year":"2006","journal-title":"4th GCC Developer's Summit"},{"key":"ref18","article-title":"r-stream: a parametric high level compiler","author":"schweitz","year":"2006","journal-title":"Proc 10th High Performance Embedded Computing Workshop (HPEC 2006)"},{"key":"ref19","article-title":"the suif compiler for scalable parallel machines","author":"amarasinghe","year":"1995","journal-title":"Proc SIAM Conf Parallel Processing for Scientific Computing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.2001.156166"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/92.894155"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1118299.1118483"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/989995.989996"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24723-4_9"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-61736-1_44","volume":"lncs 1132","author":"feautrier","year":"1996","journal-title":"The Data Parallel Programming Model"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.167"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1050.0169"},{"key":"ref46","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58430-7_64","article-title":"simplifying polynomial constraints over integers to make dependence analysis more precise","author":"maslov","year":"1994","journal-title":"CONPAR 94VAPP VI Int Conf Parallel and Vector Processing"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1375634.1375655"},{"key":"ref48","first-page":"1434","article-title":"parametric timing estimation with the newton-gregory formulae","volume":"18","author":"engelen","year":"2006","journal-title":"J Concurrency and Computation Practice and Experience"},{"key":"ref47","author":"blume","year":"1994","journal-title":"Symbolic range propagation"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.5381\/jot.2006.5.5.a2"},{"key":"ref41","article-title":"algorithms for weighted counting over parametric polytopes: a survey and a practical comparison","author":"verdoolaege","year":"2008","journal-title":"2008 Int Conf Information Theory and Statistical Learning"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/379539.379553","article-title":"pointer and escape analysis for multithreaded programs","author":"salcianu","year":"2001","journal-title":"Proc 8th ACM SIGPLAN Symp Principles and Practices of Parallel Programming (PPoPP'01)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1029873.1029884"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/92\/5170177\/04907216.pdf?arnumber=4907216","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T03:47:31Z","timestamp":1710301651000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4907216\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":53,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2008.2002049","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"value":"1063-8210","type":"print"},{"value":"1557-9999","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}