{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:29Z","timestamp":1725663569226},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572640"},{"type":"electronic","value":"9783540480273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57264-3_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:34:13Z","timestamp":1330241653000},"page":"45-59","source":"Crossref","is-referenced-by-count":4,"title":["Fast abstract interpretation using sequential algorithms"],"prefix":"10.1007","author":[{"given":"Alex","family":"Ferguson","sequence":"first","affiliation":[]},{"given":"John","family":"Hughes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"G. Baraki. A Note on Abstract Interpretation of Polymorphic Functions. In ACM Functional Programming and Computer Architecture, Boston, 1991.","DOI":"10.1007\/3540543961_18"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"G. Berry and P.-L. Curien. Sequential Algorithms on Concrete Data Structures. Theoretical Computer Science, 20:265\u2013321, 1982.","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"G. Burn, C. Hankin, and S. Abramsky. The Theory of Strictness Analysis of Higher Order Functions. In H. Ganzinger and N. D. Jones, editors, Proceedings of the Workshop on Programs as Data Objects, Lecture Notes in Computer Science, volume 217, pages 42\u201362. Springer-Verlag, October 1985.","DOI":"10.1007\/3-540-16446-4_3"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. 4th ACM Symp. on Principles of Programming Languages, Los Angeles, 1977.","DOI":"10.1145\/512950.512973"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"T.-R. Chuang and B. Goldberg. A Syntactic Approach to Fixed Point Computation on Finite Domains. In Lisp and Functional Programming. ACM, 1992.","DOI":"10.1145\/141471.141517"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"C. Clack and S. L. Peyton Jones. Strictness Analysis\u2014a Practical Approach. In Proceedings 1985 Conference on Functional Programming Languages and Computer Architecture, pages 35\u201349, Nancy, France, 1985.","DOI":"10.1007\/3-540-15975-4_28"},{"key":"4_CR7","unstructured":"P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science. Pitman, 1986."},{"key":"4_CR8","series-title":"Workshops in Computing","volume-title":"Functional Programming","author":"A. Ferguson","year":"1992","unstructured":"A. Ferguson and J. Hughes. Abstract Interpretation of Higher-Order Functions using Concrete Data Structures. In Functional Programming, Workshops in Computing, Glasgow, 1992. Springer-Verlag."},{"key":"4_CR9","volume-title":"Functional Programming","author":"J. Hughes","year":"1992","unstructured":"J. Hughes and A. Ferguson. A Loop-detecting Interpreter for Lazy, Higher-order Programs. In Functional Programming, Workshops in Computing, Glasgow, 1992. Springer-Verlag."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"S. Hunt and C. Hankin. Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1), January 1991.","DOI":"10.1017\/S0956796800000071"},{"key":"4_CR11","volume-title":"European Symposium on Programming","author":"C. Hankin","year":"1992","unstructured":"C. Hankin and S. Hunt. Approximate Fixed Points in Abstract Interpretation. In European Symposium on Programming, volume 582 of LNCS, Rennes, 1992. Springer-Verlag."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"S. Hunt. Frontiers and open sets in abstract interpretation. In D. MacQueen, editor, Functional Programming Languages and Computer Architecture. ACM Publications, 1989.","DOI":"10.1145\/99370.99371"},{"key":"4_CR13","volume-title":"PhD thesis","author":"S. Hunt","year":"1991","unstructured":"S. Hunt. Abstract Interpretation of Functional Languages: From Theory to Practice. PhD thesis, Imperial College, London, October 1991."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young. Higher-order Strictness Analysis in Untyped Lambdacalculus. In ACM Principles of Programming Languages, pages 97\u2013109, St. Petersburg, Florida, January 1986.","DOI":"10.1145\/512644.512653"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"J. Launchbury. Projection Factorisations in Partial Evaluation (PhD thesis), volume 1 of Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511569814"},{"key":"4_CR16","volume-title":"LNCS","author":"C. Martin","year":"1987","unstructured":"C. Martin and C. Hankin. Finding Fixed Points in Finite Lattices. In G. Kahn, editor, ACM Conf. on Functional Programming and Computer Architecture, LNCS, Portland, Oregon, 1987. Springer-Verlag."},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00263194","volume":"18","author":"F. Nielson","year":"1982","unstructured":"F. Nielson. A Denotational Framework for Data Flow Analysis. Acta Informatica, 18:265\u2013287, 1982.","journal-title":"Acta Informatica"},{"key":"4_CR18","volume-title":"PhD thesis","author":"P. Sestoft","year":"1991","unstructured":"P. Sestoft. Analysis and Efficient Implementation of Functional Programs. PhD thesis, DIKU, University of Copenhagen, Denmark, October 1991."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"J. Seward. Polymorphic Strictness Analysis using Frontiers. In ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation, pages 186\u2013193, Copenhagen, June 1993.","DOI":"10.1145\/154630.154649"},{"key":"4_CR20","unstructured":"Phil Wadler. Strictness Analysis on Non-Flat Domains (by Abstract Interpretation over Finite Domains. In S. Abramsky and Chris Hankin, editors, Abstract Interpretation of Declarative Languages, pages 266\u2013275. Ellis Horwood, 1987."},{"key":"4_CR21","unstructured":"J. Young and P. Hudak. Finding Fixpoints on Function Spaces. Research Report YALEU\/DCS\/RR-505, Dept. of Computer Science, Yale University, December 1986."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57264-3_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:10:25Z","timestamp":1605629425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57264-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572640","9783540480273"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-57264-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}