{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:33:14Z","timestamp":1740547994418,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156397"},{"type":"electronic","value":"9783642156403"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15640-3_1","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T04:11:29Z","timestamp":1284523889000},"page":"1-22","source":"Crossref","is-referenced-by-count":2,"title":["Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode"],"prefix":"10.1007","author":[{"given":"David","family":"Aspinall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Atkey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"MacKenzie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Sannella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","series-title":"International Series in Pure and Applied Mathematics","volume-title":"Complex Analysis","author":"L. Ahlfors","year":"1979","unstructured":"Ahlfors, L.: Complex Analysis. International Series in Pure and Applied Mathematics. McGraw-Hill, New York (1979)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-92188-2_5","volume-title":"Formal Methods for Components and Objects","author":"E. Albert","year":"2008","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: COSTA: Design and implementation of a cost and termination analyzer for Java bytecode. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol.\u00a05382, pp. 113\u2013132. Springer, Heidelberg (2008)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-11957-6_6","volume-title":"Programming Languages and Systems","author":"R. Atkey","year":"2010","unstructured":"Atkey, R.: Amortised resource analysis with separation logic. In: Gordon, A.D. (ed.) Programming Languages and Systems. LNCS, vol.\u00a06012, pp. 85\u2013103. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.scico.2005.02.003","volume":"58","author":"R. Bagnara","year":"2005","unstructured":"Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra. Science of Computer Programming\u00a058(1-2), 28\u201356 (2005)","journal-title":"Science of Computer Programming"},{"issue":"1-2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R. Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming\u00a072(1-2), 3\u201321 (2008)","journal-title":"Science of Computer Programming"},{"issue":"46","key":"1_CR6","doi-asserted-by":"publisher","first-page":"4672","DOI":"10.1016\/j.tcs.2009.07.033","volume":"410","author":"R. Bagnara","year":"2009","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Applications of polyhedral computations to the analysis and verification of hardware and software systems. Theor. Comput. Sci.\u00a0410(46), 4672\u20134691 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-540-75336-0_2","volume-title":"Trustworthy Global Computing","author":"G. Barthe","year":"2007","unstructured":"Barthe, G., Beringer, L., Cr\u00e9gut, P., Gr\u00e9goire, B., Hofmann, M., M\u00fcller, P., Poll, E., Puebla, G., Stark, I., V\u00e9tillard, E.: MOBIUS: Mobility, ubiquity, security \u2014 objectives and progress report. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2006. LNCS, vol.\u00a04661, pp. 10\u201329. Springer, Heidelberg (2007)"},{"key":"1_CR8","series-title":"Math. Sci. Res. Inst. Publ","first-page":"91","volume-title":"New Perspectives in Algebraic Combinatorics (Berkeley, CA, 1996-1997)","author":"A. Barvinok","year":"1999","unstructured":"Barvinok, A., Pommersheim, J.E.: An algorithmic theory of lattice points in polyhedra. In: New Perspectives in Algebraic Combinatorics (Berkeley, CA, 1996-1997). Math. Sci. Res. Inst. Publ, vol.\u00a038, pp. 91\u2013147. Cambridge Univ. Press, Cambridge (1999)"},{"key":"1_CR9","series-title":"Undergraduate Texts in Mathematics","volume-title":"Computing the Continuous Discretely","author":"M. Beck","year":"2007","unstructured":"Beck, M., Robins, S.: Computing the Continuous Discretely. Undergraduate Texts in Mathematics. Springer, Heidelberg (2007)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.jcta.2007.05.009","volume":"115","author":"M. Beck","year":"2008","unstructured":"Beck, M., Sam, S., Woods, K.: Maximal periods of (Ehrhart) quasi-polynomials. J. Combin. Theory Ser. A\u00a0115, 517\u2013525 (2008)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11575467_5","volume-title":"Programming Languages and Systems","author":"J. Berdine","year":"2005","unstructured":"Berdine, J., Calcagno, C., O\u2019Hearn, P.W.: Symbolic execution with separation logic. In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 52\u201368. Springer, Heidelberg (2005)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Braberman, V., Fern\u00e1ndez, F., Garbervetsky, D., Yovine, S.: Symbolic prediction of dynamic memory requirements. In: ISMM 2008 (2008)","DOI":"10.1145\/1375634.1375655"},{"issue":"5","key":"1_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.5381\/jot.2006.5.5.a2","volume":"5","author":"V. Braberman","year":"2006","unstructured":"Braberman, V., Garbervetsky, D., Yovine, S.: A static analysis for synthesizing parametric specifications of dynamic memory consumption. Journal of Object Technology\u00a05(5), 31\u201358 (2006)","journal-title":"Journal of Object Technology"},{"key":"1_CR14","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: ICS 1996: Proceedings of the 10th International Conference on Supercomputing, Philadelphia, Pennsylvania, United States, pp. 278\u2013285 (1996)","DOI":"10.1145\/237578.237617"},{"key":"1_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, 179\u2013194 (1998)","journal-title":"Journal of VLSI Signal Processing"},{"key":"1_CR16","first-page":"84","volume-title":"POPL 1978: Proceedings of the 5th Annual ACM Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL 1978: Proceedings of the 5th Annual ACM Symposium on Principles of Programming Languages, pp. 84\u201397. ACM Press, New York (1978)"},{"key":"1_CR17","first-page":"1","volume":"226","author":"E. Ehrhart","year":"1967","unstructured":"Ehrhart, E.: Sur un probl\u00e8me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. I. Poly\u00e8dres et r\u00e9seaux. J. Reine Angew. Math.\u00a0226, 1\u201329 (1967)","journal-title":"J. Reine Angew. Math."},{"key":"1_CR18","first-page":"25","volume":"227","author":"E. Ehrhart","year":"1967","unstructured":"Ehrhart, E.: Sur un probl\u00e8me de g\u00e9om\u00e9trie diophantienne lin\u00e9aire. II. Syst\u00e8mes diophantiens lin\u00e9aires. J. Reine Angew. Math.\u00a0227, 25\u201349 (1967)","journal-title":"J. Reine Angew. Math."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Mehra, K.K., Chilimbi, T.M.: SPEED: precise and efficient static estimation of program computational complexity. In: POPL 2009: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 127\u2013139 (2009)","DOI":"10.1145\/1594834.1480898"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-11957-6_16","volume-title":"Programming Languages and Systems","author":"J. Hoffmann","year":"2010","unstructured":"Hoffmann, J., Hofmann, M.: Amortized resource analysis with polynomial potential. In: Gordon, A.D. (ed.) Programming Languages and Systems. LNCS, vol.\u00a06012, pp. 287\u2013306. Springer, Heidelberg (2010)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: POPL 2003: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 185\u2013197 (2003)","DOI":"10.1145\/604131.604148"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Ishtiaq, S., O\u2019Hearn, P.W.: BI as an assertion language for mutable data structures. In: POPL 2001: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 14\u201326 (January 2001)","DOI":"10.1145\/373243.375719"},{"key":"1_CR23","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithms for recognizing interval graphs and permutation graphs. In: SODA 2003: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 158\u2013167 (2003)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/3-540-57208-2_28","volume-title":"CONCUR\u201993","author":"C. Lengauer","year":"1993","unstructured":"Lengauer, C.: Loop parallelization in the polytope model. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 398\u2013416. Springer, Heidelberg (1993)"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1025117523902","volume":"25","author":"V. Loechner","year":"1997","unstructured":"Loechner, V., Wilde, D.K.: Parameterized polyhedra and their vertices. Int. J. of Parallel Programming\u00a025, 25\u201326 (1997)","journal-title":"Int. J. of Parallel Programming"},{"key":"1_CR26","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. Journal of Symbolic Computation\u00a038, 1273\u20131302 (2004)","journal-title":"Journal of Symbolic Computation"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Lokuciejewski, P., Cordes, D., Falk, H., Marwedel, P.: A fast and precise static loop analysis based on abstract interpretation, program slicing and polytope models. In: CGO 2009: Proceedings of the 2009 International Symposium on Code Generation and Optimization, pp. 136\u2013146 (2009)","DOI":"10.1109\/CGO.2009.17"},{"key":"1_CR28","unstructured":"McAllister, T.B.: Coefficient functions of the Ehrhart quasi-polynomials of rational polygons. In: ITSL, pp. 114\u2013118. CSREA Press (2008)"},{"key":"1_CR29","unstructured":"Mehlhorn, K., Eigenwillig, A., Kanegossi, K., Kratsch, D., McConnel, R., Meyer, U., Spinrad, J.: Certifying algorithms (a paper under construction) (2005), http:\/\/www.mpi-inf.mpg.de\/~mehlhorn\/ftp\/CertifyingAlgorithms.pdf"},{"key":"1_CR30","unstructured":"Meister, B.: Approximations of polytope enumerators using linear expansions. Technical report, Universite Louis Pasteur (May 2007)"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Necula, G.C.: Proof-carrying code. In: POPL 1997: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 106\u2013119 (1997)","DOI":"10.1145\/263699.263712"},{"issue":"6","key":"1_CR32","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1379022.1375594","volume":"43","author":"L.-N. Pouchet","year":"2008","unstructured":"Pouchet, L.-N., Bastoul, C., Cohen, A., Cavazos, J.: Iterative optimization in the polyhedral model: part II, multidimensional time. SIGPLAN Not.\u00a043(6), 90\u2013100 (2008)","journal-title":"SIGPLAN Not."},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/178243.178254","volume-title":"PLDI 1994: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation","author":"W. Pugh","year":"1994","unstructured":"Pugh, W.: Counting solutions to Presburger formulas: how and why. In: PLDI 1994: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation, pp. 121\u2013134. ACM, New York (1994)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Proceedings of 17th Annual IEEE Symposium on Logic in Computer Science (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"key":"1_CR35","first-page":"211","volume-title":"Trends in Functional Programming","author":"D. Sannella","year":"2007","unstructured":"Sannella, D., Hofmann, M., Aspinall, D., Gilmore, S., Stark, I., Beringer, L., Loidl, H.-W., MacKenzie, K., Momigliano, A., Shkaravska, O.: Mobile resource guarantees. In: Trends in Functional Programming, vol.\u00a06, pp. 211\u2013226. Intellect, Bristol (2007)"},{"issue":"2","key":"1_CR36","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods\u00a06(2), 306\u2013318 (1985)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"1_CR37","unstructured":"Verdoolaege, S., Bruynooghe, M.: Algorithms for weighted counting over parametric polytopes: A survey and a practical comparison. In: The 2008 International Conference on Information Theory and Statistical Learning, pp. 60\u201366 (2008)"},{"key":"1_CR38","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: Proceedings of the 2004 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES), pp. 248\u2013258 (September 2004)","DOI":"10.1145\/1023833.1023868"}],"container-title":["Lecture Notes in Computer Science","Trustworthly Global Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15640-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T20:50:19Z","timestamp":1740516619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15640-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156397","9783642156403"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15640-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}