{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:58Z","timestamp":1740099058637,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319906850"},{"type":"electronic","value":"9783319906867"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90686-7_14","type":"book-chapter","created":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T13:49:55Z","timestamp":1524491395000},"page":"214-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Automated Amortised Resource Analysis for Term Rewrite Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9240-6128","authenticated-orcid":false,"given":"Georg","family":"Moser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4812-4665","authenticated-orcid":false,"given":"Manuel","family":"Schneckenreither","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,24]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Sleator, D., Tarjan, R.: Self-adjusting binary trees. In: Proceedings of the 15th STOC, pp. 235\u2013245. ACM (1983)","DOI":"10.1145\/800061.808752"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R Tarjan","year":"1985","unstructured":"Tarjan, R.: Amortized computational complexity. SIAM J. Alg. Disc. Methods 6(2), 306\u2013318 (1985)","journal-title":"SIAM J. Alg. Disc. Methods"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/3093333.3009842","volume":"52","author":"Jan Hoffmann","year":"2017","unstructured":"Hoffmann, J., Das, A., Weng, S.: Towards automatic resource bound analysis for OCaml. In: Proceedings of the 44th POPL, pp. 359\u2013373. ACM (2017)","journal-title":"ACM SIGPLAN Notices"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10817-010-9174-1","volume":"46","author":"E Albert","year":"2011","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-form upper bounds in static cost analysis. JAR 46(2), 161\u2013203 (2011)","journal-title":"JAR"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-48989-6_16","volume-title":"FM 2016: Formal Methods","author":"A Flores-Montoya","year":"2016","unstructured":"Flores-Montoya, A.: Upper and lower amortized cost bounds of programs expressed as cost relations. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 254\u2013273. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48989-6_16"},{"key":"14_CR6","unstructured":"Sinn, M., Zuleger, F., Veith, H.: A simple and scalable static analysis for bound analysis and amortized complexity analysis. In: Proceedings of the Software Engineering. LNI, vol. 252, pp. 101\u2013102 (2016)"},{"key":"14_CR7","volume-title":"Purely Functional Data Structures","author":"C Okasaki","year":"1999","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-08918-8_19","volume-title":"Rewriting and Typed Lambda Calculi","author":"M Hofmann","year":"2014","unstructured":"Hofmann, M., Moser, G.: Amortised resource analysis and typed polynomial interpretations. In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 272\u2013286. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08918-8_19"},{"key":"14_CR9","unstructured":"Hofmann, M., Moser, G.: Multivariate amortised resource analysis for term rewrite systems. In: Proceedings of the 13th TLCA. LIPIcs, vol. 38, pp. 241\u2013256 (2015)"},{"issue":"ICFP","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3110287","volume":"1","author":"Martin Avanzini","year":"2017","unstructured":"Avanzini, M., Lago, U.D.: Automating sized-type inference for complexity analysis. In: PACMPL, vol. 1, pp. 43:1\u201343:29 (2017)","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-662-49674-9_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Avanzini","year":"2016","unstructured":"Avanzini, M., Moser, G., Schaper, M.: TcT: tyrolean complexity tool. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 407\u2013423. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49674-9_24"},{"key":"14_CR12","unstructured":"Moser, G., Schneckenreither, M.: Amortised analysis for bestcase lowerbounds (2018, submitted)"},{"key":"14_CR13","unstructured":"Schneckenreither, M.: Amortized resource analysis for term rewrite systems. Master\u2019s thesis, University of Innsbruck (2018). \nhttps:\/\/www.uibk.ac.at\/wipl\/team\/team\/docs\/masterthesis_schneckenreither.pdf"},{"key":"14_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"14_CR15","unstructured":"TeReSe: Term Rewriting Systems. Cambridge Tracks in Theoretical Computer Science, vol. 55. Cambridge University Press (2003)"},{"key":"14_CR16","unstructured":"Thiemann, R.: The DP framework for proving termination of term rewriting. Ph.D. thesis, University of Aachen, Department of Computer Science (2007)"},{"key":"14_CR17","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Technical report, Department of Computer Science, The University of Iowa (2017). \nwww.SMT-LIB.org"},{"key":"14_CR18","first-page":"1","volume":"124","author":"J Farkas","year":"1902","unstructured":"Farkas, J.: Theorie der einfachen ungleichungen. Journal f\u00fcr die reine und angewandte Mathematik 124, 1\u201327 (1902)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"14_CR19","unstructured":"Hoffmann, J.: Types with potential: polynomial resource bounds via automatic amortized analysis. Ph.D. thesis, Ludwig-Maximilians-Universi\u00e4t M\u00fcnchen (2011)"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2362389.2362393","volume":"34","author":"J Hoffmann","year":"2012","unstructured":"Hoffmann, J., Aehlig, K., Hofmann, M.: Multivariate amortized resource analysis. TOPLAS 34(3), 14 (2012)","journal-title":"TOPLAS"},{"key":"14_CR21","unstructured":"Glenstrup, A.: Terminator II: stopping partial evaluation of fully recursive programs. Master\u2019s thesis, Technical report DIKU-TR-99\/8, DIKU (1999)"},{"key":"14_CR22","unstructured":"Frederiksen, C.: Automatic runtime analysis for first order functional programs. Master\u2019s thesis, DIKU TOPPS D-470, DIKU (2002)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Lago, U.D., Moser, G.: Analysing the complexity of functional programs: higher-order meets first-order. In: Proceedings of the 20th ICFP, pp. 152\u2013164. ACM (2015)","DOI":"10.1145\/2784731.2784753"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-66167-4_8","volume-title":"Frontiers of Combining Systems","author":"M Naaf","year":"2017","unstructured":"Naaf, M., Frohn, F., Brockschmidt, M., Fuhs, C., Giesl, J.: Complexity analysis for term rewriting by integer transition systems. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS (LNAI), vol. 10483, pp. 132\u2013150. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66167-4_8"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10817-016-9388-y","volume":"58","author":"J Giesl","year":"2017","unstructured":"Giesl, J., Aschermann, C., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Hensel, J., Otto, C., Pl\u00fccker, M., Schneider-Kamp, P., Str\u00f6der, T., Swiderski, S., Thiemann, R.: Analyzing program termination and complexity automatically with aprove. JAR 58(1), 3\u201331 (2017)","journal-title":"JAR"},{"key":"14_CR26","unstructured":"Flores-Montoya, A.: CoFloCo: system description. In: 15th International Workshop on Termination, vol. 20 (2016)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-22102-1_21","volume-title":"Interactive Theorem Proving","author":"T Nipkow","year":"2015","unstructured":"Nipkow, T.: Amortized complexity verified. In: Urban, C., Zhang, X. (eds.) ITP 2015. LNCS, vol. 9236, pp. 310\u2013324. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-22102-1_21"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90686-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T13:54:43Z","timestamp":1524491683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90686-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319906850","9783319906867"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90686-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}