{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:02:48Z","timestamp":1762459368735},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496732"},{"type":"electronic","value":"9783662496749"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-3-662-49674-9_24","type":"book-chapter","created":{"date-parts":[[2016,4,8]],"date-time":"2016-04-08T14:49:00Z","timestamp":1460126940000},"page":"407-423","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["TcT: Tyrolean Complexity Tool"],"prefix":"10.1007","author":[{"given":"Martin","family":"Avanzini","sequence":"first","affiliation":[]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Schaper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"key":"24_CR1","first-page":"2","volume":"92","author":"E Albert","year":"2014","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G., Rom\u00e1n-D\u00edez, G.: Conditional termination of loops over heap-allocated data. SCP 92, 2\u201324 (2014)","journal-title":"SCP"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.tcs.2007.09.003","volume":"389","author":"D Aspinall","year":"2007","unstructured":"Aspinall, D., Beringer, L., Hofmann, M., Loidl, H.W., Momigliano, A.: A program logic for resources. TCS 389(3), 411\u2013445 (2007)","journal-title":"TCS"},{"issue":"2","key":"24_CR3","first-page":"1","volume":"7","author":"R Atkey","year":"2011","unstructured":"Atkey, R.: Amortised resource analysis with separation logic. LMCS 7(2), 1\u201333 (2011)","journal-title":"LMCS"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Dal Lago, U., Moser, G.: Analysing the complexity of functional programs: higher-order meets first-order. In: Proceeding of the 20th ICFP, pp. 152\u2013164. ACM (2015)","DOI":"10.1145\/2858949.2784753"},{"key":"24_CR5","unstructured":"Avanzini, M., Moser, G.: Tyrolean complexity tool: features and usage. In: Proceeding of the 24th RTA, LIPIcs, vol. 21, pp. 71\u201380 (2013)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Avanzini, M., Moser, G.: A combination framework for complexity. IC (to appear, 2016)","DOI":"10.1016\/j.ic.2015.12.007"},{"key":"24_CR7","unstructured":"Avanzini, M., Sternagel, C., Thiemann, R.: Certification of complexity proofs using CeTA. In: Proceeding of the 26th RTA, LIPIcs, vol. 36, pp. 23\u201339 (2015)"},{"key":"24_CR8","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":"24_CR9","volume-title":"Introduction to Functional Programming using Haskell","author":"R Bird","year":"1998","unstructured":"Bird, R.: Introduction to Functional Programming using Haskell, 2nd edn. Prentice Hall, Upper Saddle River (1998)","edition":"2"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-54862-8_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Brockschmidt","year":"2014","unstructured":"Brockschmidt, M., Emmes, F., Falke, S., Fuhs, C., Giesl, J.: Alternating runtime and size complexity analysis of integer programs. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 140\u2013155. Springer, Heidelberg (2014)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Danner, N., Paykin, J., Royer, J.S.: A static cost analysis for a higher-order language. In: Proceeding of the 7th PLPV, pp. 25\u201334. ACM (2013)","DOI":"10.1145\/2428116.2428123"},{"key":"24_CR12","unstructured":"Gimenez, S., Moser, G.: The complexity of interaction. In: Proceeding of the 40th POPL (to appear, 2016)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-71070-7_32","volume-title":"Automated Reasoning","author":"N Hirokawa","year":"2008","unstructured":"Hirokawa, N., Moser, G.: Automated complexity analysis based on the dependency pair method. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 364\u2013379. Springer, Heidelberg (2008)"},{"issue":"3","key":"24_CR14","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":"24_CR15","unstructured":"Hofmann, M., Moser, G.: Multivariate amortised resource analysis for term rewrite systems. In: Proceeding of the 13th TLCA in LIPIcs Vol. 38, pp. 241\u2013256 (2015)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Jost, S., Hammond, K., Loidl, H.W., Hofmann, M.: Static determination of quantitative resource usage for higher-order programs. In: Proceeding of the 37th POPL, pp. 223\u2013236. ACM (2010)","DOI":"10.1145\/1706299.1706327"},{"issue":"4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/1146809.1146811","volume":"28","author":"G Klein","year":"2006","unstructured":"Klein, G., Nipkow, T.: A machine-checked model for a java-like language, virtual machine, and compiler. TOPLAS 28(4), 619\u2013695 (2006)","journal-title":"TOPLAS"},{"key":"24_CR18","unstructured":"Lankford, D.: On Proving Term Rewriting Systems are Noetherian. Technical Report MTP-3. Louisiana Technical University (1979)"},{"key":"24_CR19","unstructured":"Moser, G.: Proof Theory at Work: Complexity Analysis of Term Rewrite Systems. CoRR abs\/0907.5527, Habilitation Thesis (2009)"},{"key":"24_CR20","unstructured":"Moser, G., Schaper, M.: A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (2012). CoRR, cs\/PL\/1204.1568, last revision: 6 May 2014"},{"issue":"1","key":"24_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10817-013-9277-6","volume":"51","author":"L Noschinski","year":"2013","unstructured":"Noschinski, L., Emmes, F., Giesl, J.: Analyzing innermost runtime complexity of term rewriting by dependency pairs. JAR 51(1), 27\u201356 (2013)","journal-title":"JAR"},{"key":"24_CR22","unstructured":"Hill, P.M., Payet, E., Spoto, F.: Path-length analysis of object-oriented programs. In: Proceeding of the 1st EAAI. Elsevier (2006)"},{"issue":"3","key":"24_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"GD Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. TCS 5(3), 223\u2013255 (1977)","journal-title":"TCS"},{"issue":"4","key":"24_CR24","first-page":"363","volume":"11","author":"JC Reynolds","year":"1998","unstructured":"Reynolds, J.C.: Definitional interpreters for higher-order programming languages. HOSC 11(4), 363\u2013397 (1998)","journal-title":"HOSC"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/978-3-319-08867-9_50","volume-title":"Computer Aided Verification","author":"M Sinn","year":"2014","unstructured":"Sinn, M., Zuleger, F., Veith, H.: A simple and scalable static analysis for bound analysis and amortized complexity analysis. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 745\u2013761. Springer, Heidelberg (2014)"},{"key":"24_CR26","unstructured":"TeReSe: Term Rewriting Systems, Cambridge Tracks in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)"},{"issue":"3","key":"24_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1347375.1347389","volume":"7","author":"R Wilhelm","year":"2008","unstructured":"Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P., Staschulat, J., Stenstrom, P.: The worst case execution time problem - overview of methods and survey of tools. TECS 7(3), 1\u201353 (2008)","journal-title":"TECS"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49674-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T21:14:29Z","timestamp":1584998069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49674-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496732","9783662496749"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49674-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}