{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:51:10Z","timestamp":1771951870617,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4672,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1016\/s0304-3975(00)00051-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:23:35Z","timestamp":1027607015000},"page":"147-199","source":"Crossref","is-referenced-by-count":81,"title":["DyC: an expressive annotation-directed dynamic compiler for C"],"prefix":"10.1016","volume":"248","author":[{"given":"Brian","family":"Grant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Mock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthai","family":"Philipose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Craig","family":"Chambers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan J.","family":"Eggers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00051-7_BIB1","doi-asserted-by":"crossref","unstructured":"D.R. Engler, W.C. Hsieh, M.F. Kaashoek, \u2032C: A language for high-level, efficient, and machine-independent dynamic code generation, Conf. Record of POPL \u201996: 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, January 1996, pp. 131\u2013144.","DOI":"10.1145\/237721.237765"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB2","doi-asserted-by":"crossref","unstructured":"M. Poletto, D.R. Engler, M.F. Kaashoek, tcc: A system for fast, flexible, and high-level dynamic code generation, SIGPLAN Notices, Proc. ACM SIGPLAN \u201997 Conf. on Programming Language Design and Implementation, June 1997, pp. 109\u2013121.","DOI":"10.1145\/258916.258926"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB3","doi-asserted-by":"crossref","unstructured":"D.R. Engler, T.A. Proebsting, DCG: an efficient, retargetable dynamic code generator, Proc. 6th Internat. Conf. on Architectural Support for Programming Languages and Operating Systems, October 1994, pp. 263\u2013273.","DOI":"10.1145\/195473.195567"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB4","doi-asserted-by":"crossref","unstructured":"M. Leone, P. Lee, Optimizing ML with run-time code generation, SIGPLAN Notices, Proc. ACM SIGPLAN \u201996 Conf. on Programming Language Design and Implementation, May 1996, pp. 137\u2013148.","DOI":"10.1145\/249069.231407"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB5","doi-asserted-by":"crossref","unstructured":"C. Consel, F. No\u00ebl, A general approach for run-time specialization and its application to C, Conf. Record of POPL \u201996: 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, January 1996, pp. 145\u2013156.","DOI":"10.1145\/237721.237767"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB6","doi-asserted-by":"crossref","unstructured":"J. Auslander, M. Philipose, C. Chambers, S. Eggers, B. Bershad, Fast, effective dynamic compilation, SIGPLAN Notices, Proc. ACM SIGPLAN \u201996 Conf. on Programming Language Design and Implementation, May 1996, pp. 149\u2013159.","DOI":"10.1145\/249069.231409"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB7","series-title":"Smalltalk-80","author":"Goldberg","year":"1983"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB8","doi-asserted-by":"crossref","unstructured":"Lindholm and Yellin, 1997.","DOI":"10.1093\/oq\/13.3.130"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB9","unstructured":"E.G. Sirer, Measuring limits of fine-grain parallelism, Princeton University Senior Project, June 1993."},{"key":"10.1016\/S0304-3975(00)00051-7_BIB10","series-title":"Partial Evaluation and Automatic Program Generation","author":"Jones","year":"1993"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB11","series-title":"The C Programming Language","author":"Kernighan","year":"1988"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB12","doi-asserted-by":"crossref","unstructured":"R.P. Wilson, M.S. Lam, Efficient context-sensitive pointer analysis for C programs, SIGPLAN Notices, Proc. ACM SIGPLAN \u201995 Conf. on Programming Language Design and Implementation, June 1995, pp. 1\u201312.","DOI":"10.1145\/223428.207111"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB13","doi-asserted-by":"crossref","unstructured":"B. Steensgaard, Points-to analysis in almost linear time, Conf. Record of POPL \u201996: 23rd ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, January 1996, pp. 32\u201341.","DOI":"10.1145\/237721.237727"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB14","doi-asserted-by":"crossref","unstructured":"U. Meyer, Techniques for partial evaluation of imperative languages, Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation \u201991, Published as SIGPLAN Notices 26(9). June 1991, pp. 94\u2013105.","DOI":"10.1145\/115865.115876"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB15","doi-asserted-by":"crossref","unstructured":"R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, F.K. Zadeck, An efficient method of computing static single assignment form, Conf. Record of the 16th Ann. ACM Symp. on Principles of Programming Languages, January 1989, pp. 25\u201335.","DOI":"10.1145\/75277.75280"},{"issue":"3","key":"10.1016\/S0304-3975(00)00051-7_BIB16","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/24039.24041","article-title":"The program dependence graph and its use in optimization","volume":"9","author":"Ferrante","year":"1987","journal-title":"ACM trans. programming languages systems"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB17","unstructured":"Lowney et al., 1993."},{"key":"10.1016\/S0304-3975(00)00051-7_BIB18","doi-asserted-by":"crossref","unstructured":"Scott Thibault, Charles Consel, Gilles Muller, Safe and efficient active network programming, Technical Report Research Report 1170, IRISA, January 1998.","DOI":"10.1109\/RELDIS.1998.740484"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB19","doi-asserted-by":"crossref","unstructured":"A.M. Erosa, L.J. Hendren, Taming control flow: a structured approach to eliminating goto statements, Proc. 1994 IEEE Internat. Conf. on Computer Languages, May 1994, pp. 229\u2013240.","DOI":"10.1109\/ICCL.1994.288377"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB20","series-title":"Partial Evaluation. Dagstuhl Castle, Germany, February 1996, Lecture Notes in Computer Science, Vol. 1110","first-page":"54","article-title":"A uniform approach for compile-time and run-time specialization","author":"Consel","year":"1996"},{"issue":"10","key":"10.1016\/S0304-3975(00)00051-7_BIB21","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/263700.263749","article-title":"Declarative specialization of object-oriented programs","volume":"32","author":"Volanschi","year":"1997","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB22","unstructured":"M. Leone, P. Lee, Optimizing ML with run-time code generation, Technical Report CMU-CS-95-205, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, December 1995."},{"key":"10.1016\/S0304-3975(00)00051-7_BIB23","unstructured":"L.O. Andersen, Self-applicable C program specialization, Proc. Workshop on Partial Evaluation and Semantics-Based Program Manipulation \u201992, June 1992, pp. 54\u201361. Published as Yale University Technical Report YALEU\/DCS\/RR-909."},{"key":"10.1016\/S0304-3975(00)00051-7_BIB24","unstructured":"L.O. Andersen, Program analysis and specialization for the C programming language, Ph.D. Thesis, DIKU, University of Copenhagen, Denmark, 1994. Published as DIKU Research Report 94\/19."},{"key":"10.1016\/S0304-3975(00)00051-7_BIB25","unstructured":"L.O. Andersen, C program specialization, Technical Report 92\/14, DIKU, University of Copenhagen, Denmark, May 1992."},{"key":"10.1016\/S0304-3975(00)00051-7_BIB26","first-page":"145","article-title":"A tour of Schism: A partial evaluation system for higher-order applicative languages","author":"Consel","year":"1993","journal-title":"Proc. Symp. on Partial Evaluation and Semantics-Based Program Manipulation \u201993"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB27","doi-asserted-by":"crossref","unstructured":"D. Weise, R. Conybeare, E. Ruf, S. Seligman, Automatic online partial evaluation, in: J. Hughes (Ed.), Record of the 1991 Conf. on Functional Programming Languages and Computer Architecture, Cambridge, MA, 1991. Lecture Notes in Computer Science Vol. 523, Springer, Berlin, 1991, pp. 165\u2013191.","DOI":"10.1007\/3540543961_9"},{"key":"10.1016\/S0304-3975(00)00051-7_BIB28","unstructured":"D. Keppel, Runtime code generation, Ph.D. Thesis, University of Washington, 1996."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000517?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000517?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T07:42:24Z","timestamp":1578555744000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0304397500000517"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00051-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}