{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:46:02Z","timestamp":1725515162865},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691631"},{"type":"electronic","value":"9783540691662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69166-2_17","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T05:25:03Z","timestamp":1215926703000},"page":"255-269","source":"Crossref","is-referenced-by-count":6,"title":["Flow Analysis, Linearity, and PTIME"],"prefix":"10.1007","author":[{"given":"David","family":"Van Horn","sequence":"first","affiliation":[]},{"given":"Harry G.","family":"Mairson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-10843-2_10","volume-title":"Proceedings of the 8th Colloquium on Automata, Languages and Programming","author":"N.D. Jones","year":"1981","unstructured":"Jones, N.D.: Flow analysis of lambda expressions (preliminary version). In: Proceedings of the 8th Colloquium on Automata, Languages and Programming, London, UK, pp. 114\u2013128. Springer, Heidelberg (1981)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Sestoft, P.: Replacing function parameters by global variables. Master\u2019s thesis, DIKU, University of Copenhagen, Denmark, Master\u2019s thesis no.\u00a0254 (1988)","DOI":"10.1145\/99370.99374"},{"key":"17_CR3","unstructured":"Shivers, O.: Control-Flow Analysis of Higher-Order Languages, or Taming Lambda. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, Technical Report CMU-CS-91-145 (1991)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Midtgaard, J.: Control-flow analysis of functional programs. Technical Report BRICS RS-07-18, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark (2007)","DOI":"10.7146\/brics.v14i18.21936"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/53990.54007","volume-title":"PLDI 1988: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation","author":"O. Shivers","year":"1988","unstructured":"Shivers, O.: Control flow analysis in Scheme. In: PLDI 1988: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, pp. 164\u2013174. ACM, New York (1988)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1109\/LICS.1997.614960","volume-title":"LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science","author":"N. Heintze","year":"1997","unstructured":"Heintze, N., McAllester, D.: On the cubic bottleneck in subtyping and flow analysis. In: LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, p. 342. IEEE Computer Society, Los Alamitos (1997)"},{"key":"17_CR7","unstructured":"Henglein, F.: Simple closure analysis. DIKU Semantics Report D-193 (1992)"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/291891.291898","volume":"20","author":"J.M. Ashley","year":"1998","unstructured":"Ashley, J.M., Dybvig, R.K.: A practical and flexible flow analysis for higher-order languages. ACM Trans. Program. Lang. Syst.\u00a020(4), 845\u2013868 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1291151.1291166","volume-title":"Proceedings of the 2007 ACM SIGPLAN International Conference on Functional Programming","author":"D. Horn Van","year":"2007","unstructured":"Van Horn, D., Mairson, H.G.: Relating complexity and precision in control flow analysis. In: Proceedings of the 2007 ACM SIGPLAN International Conference on Functional Programming, pp. 85\u201396. ACM Press, New York (2007)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/258915.258939","volume-title":"PLDI 1997: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation","author":"N. Heintze","year":"1997","unstructured":"Heintze, N., McAllester, D.: Linear-time subtransitive control flow analysis. In: PLDI 1997: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, pp. 261\u2013272. ACM, New York (1997)"},{"key":"17_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511629150","volume-title":"Proceedings of the workshop on Advances in linear logic","author":"J.Y. Girard","year":"1995","unstructured":"Girard, J.Y.: Linear logic: its syntax and semantics. In: Proceedings of the workshop on Advances in linear logic. Cambridge University Press, Cambridge (1995)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/99370.99374","volume-title":"FPCA 1989: Proceedings of the fourth international conference on Functional programming languages and computer architecture","author":"P. Sestoft","year":"1989","unstructured":"Sestoft, P.: Replacing function parameters by global variables. In: FPCA 1989: Proceedings of the fourth international conference on Functional programming languages and computer architecture, pp. 39\u201353. ACM, New York (1989)"},{"key":"17_CR13","unstructured":"Mossin, C.: Flow Analysis of Typed Higher-Order Programs. PhD thesis, DIKU, University of Copenhagen (1997)"},{"key":"17_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, New York (1999)"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/990518.990519","volume":"7","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E.: The circuit value problem is log space complete for P. SIGACT News\u00a07(1), 18\u201320 (1975)","journal-title":"SIGACT News"},{"issue":"6","key":"17_CR16","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1017\/S0956796804005131","volume":"14","author":"H.G. Mairson","year":"2004","unstructured":"Mairson, H.G.: Linear lambda calculus and PTIME-completeness. Journal of Functional Programming\u00a014(6), 623\u2013633 (2004)","journal-title":"Journal of Functional Programming"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/199448.199536","volume-title":"Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"S. Jagannathan","year":"1995","unstructured":"Jagannathan, S., Weeks, S.: A unified treatment of flow analysis in higher-order languages. In: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 393\u2013407. ACM Press, New York (1995)"},{"issue":"3","key":"17_CR18","first-page":"214","volume":"5","author":"C. Mossin","year":"1998","unstructured":"Mossin, C.: Higher-order value flow graphs. Nordic J. of Computing\u00a05(3), 214\u2013234 (1998)","journal-title":"Nordic J. of Computing"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-36377-7_7","volume-title":"The essence of computation: complexity, analysis, transformation","author":"C. Hankin","year":"2002","unstructured":"Hankin, C., Nagarajan, R., Sampath, P.: Flow analysis: games and nets. In: The essence of computation: complexity, analysis, transformation, pp. 135\u2013156. Springer, New York (2002)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/BFb0032746","volume-title":"Static Analysis","author":"C. Mossin","year":"1997","unstructured":"Mossin, C.: Exact flow analysis. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 250\u2013264. Springer, Heidelberg (1997)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman, R.: The typed \u03bb-calculus is not elementary recursive. Theor. Comput. Sci.\u00a09, 73\u201381 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/99583.99602","volume-title":"POPL 1991: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"F. Henglein","year":"1991","unstructured":"Henglein, F., Mairson, H.G.: The complexity of type inference for higher-order lambda calculi. In: POPL 1991: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 119\u2013130. ACM, New York (1991)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal\u00a027 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69166-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T12:48:16Z","timestamp":1557665296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69166-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540691631","9783540691662"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69166-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}