{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:25:12Z","timestamp":1737523512803,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433637"},{"type":"electronic","value":"9783540459279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45927-8_18","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T09:39:04Z","timestamp":1192786744000},"page":"243-261","source":"Crossref","is-referenced-by-count":11,"title":["Automatic Complexity Analysis"],"prefix":"10.1007","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","volume":"35","author":"A. Aiken","year":"1999","unstructured":"A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming (SCP), 35(2):79\u2013111, 1999.","journal-title":"Science of Computer Programming (SCP)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"D.A. Basin and H. Ganzinger. Complexity Analysis Based on Ordered Resolution. In 11th IEEE Symposium on Logic in Computer Science (LICS), 456\u2013465, 1996. Long version to appear in JACM.","DOI":"10.1109\/LICS.1996.561462"},{"key":"18_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BFb0053547","volume-title":"Mobile ambients","author":"L. Cardelli","year":"1998","unstructured":"L. Cardelli and A.D. Gordon. Mobile ambients. In Proceedings of FoSSaCS\u201998, volume 1378 of LNCS, 140\u2013155. Springer-Verlag, 1998."},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/3-540-18170-9_158","volume-title":"Computation Theory and Logic","author":"E. Dahlhaus","year":"1987","unstructured":"E. Dahlhaus. Skolem normal forms concerning the least fixpoint. In Computation Theory and Logic, 101\u2013106. LNCS 270, Springer Verlag, 1987."},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","first-page":"197","volume-title":"Automatic Verification Methods for Finite State Systems","author":"D. L. Dill","year":"1989","unstructured":"D. L. Dill. Timing assumptions and verification of finite state concurrent systems. In Automatic Verification Methods for Finite State Systems, 197\u2013212. LNCS 407, Springer Verlag, 1989."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0167-6423(99)00009-X","volume":"35","author":"C. Fecht","year":"1999","unstructured":"C. Fecht and H. Seidl. A faster solver for general systems of equations. Science of Computer Programming (SCP), 35(2\u20133):137\u2013162, 1999.","journal-title":"Science of Computer Programming (SCP)"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-45744-5_44","volume-title":"A new meta-complexity theorem for bottom-up logic programs","author":"H. Ganzinger","year":"2001","unstructured":"H. Ganzinger and D.A. McAllester. A new meta-complexity theorem for bottom-up logic programs. In First Int. Joint Conference on Automated Reasoning (IJCAR), 514\u2013528. LNCS 2083, Springer Verlag, 2001."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"G. Gottlob, E. Gr\u00e4del, and H. Veith. Datalog LITE: A deductive query language with linear time model checking. ACM Transactions on Computational Logic, 2001. To appear.","DOI":"10.1145\/504077.504079"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(77)90002-3","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"D. E. Knuth. On a generalization of Dijkstra\u2019s algorithm. Information Processing Letters (IPL), 6(1):1\u20135, 1977.","journal-title":"Information Processing Letters (IPL)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"P.G. Kolaitis. Implicit definability on finite structures and unambiguous computations (preliminary report). In 5th Annual IEEE Symposium on Logic in Computer Science (LICS), 168\u2013180, 1990.","DOI":"10.1109\/LICS.1990.113743"},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-48294-6_21","volume-title":"On the complexity analysis of static analyses","author":"D. McAllester","year":"1999","unstructured":"D. McAllester. On the complexity analysis of static analyses. In 6th Static Analysis Symposium (SAS), 312\u2013329. LNCS 1694, Springer Verlag, 1999."},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-45309-1_17","volume-title":"Control-flow analysis in cubic time","author":"F. Nielson","year":"2001","unstructured":"F. Nielson and H. Seidl. Control-flow analysis in cubic time. In European Symposium on Programming (ESOP), 252\u2013268. LNCS 2028, Springer Verlag, 2001."},{"key":"18_CR13","unstructured":"F. Nielson and H. Seidl. Succinct solvers. Technical Report 01-12, University of Trier, Germany, 2001."},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-46423-9_4","volume-title":"Compiler Construction (CC)","author":"R. Shaham","year":"2000","unstructured":"R. Shaham, K. Kordner, and S. Sagiv. Automatic removal of array memory leaks in Java. In Compiler Construction (CC), 50\u201366. LNCS 1781, Springer Verlag, 2000."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45927-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T19:13:46Z","timestamp":1737486826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45927-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433637","9783540459279"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45927-8_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}