{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:47Z","timestamp":1725664967314},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617396"},{"type":"electronic","value":"9783540706748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61739-6_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:18:49Z","timestamp":1330294729000},"page":"2-21","source":"Crossref","is-referenced-by-count":2,"title":["Semantics-directed program analysis: A tool-maker's perspective"],"prefix":"10.1007","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"M. Alt and F. Martin. Generation of Efficient Interprocedural Analyzers with PAG. In Proc. SAS '95, SLNCS 983, pages 33\u201350. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60360-3_31"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. L. Burn","year":"1986","unstructured":"G. L. Burn, C. Hankin, and S. Abramsky. Strictness Analysis for Higher-Order Functions. Science of Computer Programming, 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"2_CR3","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 POPL, pages 238\u2013252. ACM Press, 1977.","DOI":"10.1145\/512950.512973"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints Among Variables of a Program. In Proc. 5th POPL, pages 84\u201397. ACM Press, 1978.","DOI":"10.1145\/512760.512770"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"C. Flanagan and M. Felleisen. The Semantics of Future and Its Use in Program Optimization. In Proc. POPL '95, pages 209\u2013220. ACM Press, 1995.","DOI":"10.1145\/199448.199484"},{"issue":"3","key":"2_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/151640.151642","volume":"1","author":"C. W. Fraser","year":"1992","unstructured":"C. W. Fraser, D. R. Hanson, and T. A. Proebsting. Engineering a Simple, Efficient Code-Generator Generator. ACM Letters on Programming Languages and Systems, 1(3):213\u2013226, 1992.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"N. Heintze. Set-Based Analysis of ML Programs. In Proc. LFP'94, pages 306\u2013317, 1994.","DOI":"10.1145\/182409.182495"},{"key":"2_CR8","unstructured":"J. Hughes. Backward Analysis of Functional Programs. In Partial Evaluation and Mixed Computation, pages 187\u2013208. North-Holland, 1988."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"N. D. Jones and F. Nielson. Abstract Interpretation: a Semantics-Based Tool for Program Analysis. In Handbook of Logic in Computer Science volume 4. Oxford University Press, 1995.","DOI":"10.1093\/oso\/9780198537809.003.0005"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J. B. Kam","year":"1977","unstructured":"J. B. Kam and J. D. Ullman. Monotone Data Flow Analysis Frameworks. Acta Informatica, 7:305\u2013317, 1977.","journal-title":"Acta Informatica"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"A. Mycroft and F. Nielson. Strong Abstract Interpretation using Power-Domains. In Proc. ICALP '83, SLNCS 154, pages 536\u2013547. Springer-Verlag, 1983.","DOI":"10.1007\/BFb0036935"},{"key":"2_CR12","unstructured":"F. Nielson. Tensor Products Generalize the Relational Data Flow Analysis Method. In Proc. 4th Hungarian Computer Science Conference, pages 211\u2013225, 1985."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"F. Nielson. Abstract Interpretation of Denotational Definitions. In Proc. STACS '86, SLNCS 210, pages 1\u201320. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16078-7_61"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"F. Nielson. Expected Forms of Data Flow Analysis. In Proc. Programs as Data Objects, SLNCS 217, pages 172\u2013191. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16446-4_10"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"F. Nielson. Towards a Denotational Theory of Abstract Interpretation. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 219\u2013245. Ellis-Horwood, 1987.","DOI":"10.1145\/41625.41636"},{"key":"2_CR16","unstructured":"F. Nielson. A Formal Type System for Comparing Partial Evaluators. In D. Bj\u00d8rner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 349\u2013384. North-Holland, 1988."},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(88)90041-7","volume":"76","author":"F. Nielson","year":"1988","unstructured":"F. Nielson. Strictness Analysis and Denotational Abstract Interpretation. Information and Computation, 76:29\u201392, 1988.","journal-title":"Information and Computation"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(89)90091-1","volume":"69","author":"F. Nielson","year":"1989","unstructured":"F. Nielson. Two-Level Semantics and Abstract Interpretation. Theoretical Computer Science \u2014 Fundamental Studies, 69:117\u2013242, 1989.","journal-title":"Theoretical Computer Science \u2014 Fundamental Studies"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(86)90006-X","volume":"56","author":"F. Nielson","year":"1988","unstructured":"F. Nielson and H. R. Nielson. Two-Level Semantics and Code Generation. Theoretical Computer Science, 56(1):59\u2013133, 1988.","journal-title":"Theoretical Computer Science"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. R. Nielson. Two-Level Functional Languages. Cambridge Tracts in Theoretical Computer Science volume 34. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511526572"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"F. Nielson and H. R. Nielson. Multi-Level Lambda-Calculi: an Algebraic Description. In Proc. Dagstuhl Seminar on Partial Evaluation, SLNCS (to appear). Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61580-6_17"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"H. R. Nielson and F. Nielson. Pragmatic Aspects of Two-Level Denotational Meta-Languages. In Proc. ESOP '86, SLNCS 213. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16442-1_10"},{"key":"2_CR23","volume-title":"Technical Report DAIMI IR-114","author":"H. R. Nielson","year":"1992","unstructured":"H. R. Nielson, F. Nielson, A. Pilegaard, and T. Lange. The PSI System. Technical Report DAIMI IR-114, Department of Computer Science, Aarhus University, Denmark, 1992."},{"key":"2_CR24","unstructured":"L. Paulson. Compiler Generation from Denotational Semantics. In B. Lorho, editor, Methods and Tools for Compiler Construction, pages 219\u2013250. Cambridge University Press, 1984."},{"key":"2_CR25","volume-title":"Technical Report FN-19","author":"G. D. Plotkin","year":"1981","unstructured":"G. D. Plotkin. A Structural Approach to Operational Semantics. Technical Report FN-19, DAIMI, Aarhus University, Denmark, 1981 (reprinted 1991)."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"D. Schmidt. Natural-Semantics-Based Abstract Interpretation. In Proc. SAS '95, SLNCS 983, pages 1\u201318. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60360-3_28"},{"key":"2_CR27","unstructured":"J. E. Stoy. Denotational Semantics: the Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"J.-P. Talpin and P. Jouvelot. The Type and Effect Discipline. In Proc. LICS '92, pages 162\u2013173, 1992.","DOI":"10.1109\/LICS.1992.185530"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"S. Tjiang and J. Hennessy. Sharlit \u2014 a Tool for Building Optimizers. In Proc. PLDI '92. ACM Press, 1992.","DOI":"10.1145\/143095.143120"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"G. V. Venkatesh and C. N. Fischer. Spare: a Development Environment for Program Analysis Algorithms. IEEE Transactions on Software Engineering, 1992.","DOI":"10.1109\/32.129219"},{"key":"2_CR31","unstructured":"A. N. Whitehead and B. Russell. Principia Mathematica. Cambridge University Press, 1910 (reprinted 1950)."},{"key":"2_CR32","unstructured":"R. Wilhelm. Global Flow Analysis and Optimization in the MUG2 Compiler Generating System. In S. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 5. Prentice-Hall, 1981."},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"K. Yi and W. L. Harrison III. Automatic Generation and Management of Interprocedural Program Analyses. In Proc. POPL '93, pages 246\u2013259. ACM Press, 1993.","DOI":"10.1145\/158511.158642"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61739-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:44:12Z","timestamp":1713635052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61739-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617396","9783540706748"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-61739-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}