{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:59Z","timestamp":1761610379329,"version":"build-2065373602"},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4288,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s1571-0661(05)80458-x","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T07:41:43Z","timestamp":1114587703000},"page":"142-157","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Language-Agnostic Mobile Code"],"prefix":"10.1016","volume":"59","author":[{"given":"Christian H.","family":"Stork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter S.","family":"Housel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek","family":"Haldar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niall","family":"Dalton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Franz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1996","series-title":"\u201cA Theory of Objects,\u201d Springer, New York","author":"Abadi","key":"10.1016\/S1571-0661(05)80458-X_BIB1"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB2","series-title":"A CM SIGPLAN Conference on Programming Language Design and Implementation","article-title":"SafeTSA: A type safe and referentially secure mobile-code representation","author":"Amme","year":"2001"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB3","series-title":"PLSA '94: International Conference on Programming Languages and Architectures","first-page":"105","article-title":"The advantages of machine-dependent global optimization","author":"Benitez","year":"1994"},{"year":"1975","series-title":"\u201cRecursive Programming Techniques,\u201d","author":"Burge","key":"10.1016\/S1571-0661(05)80458-X_BIB4"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB5","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/18.9782","article-title":"Source encoding using syntactic information source models","author":"Cameron","year":"1988","journal-title":"IEEE Transactions on Information Theory 34"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB6","first-page":"550","article-title":"Statistical models for term compression","author":"Cheney","year":"2000","journal-title":"Data Compression Conference"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB7","series-title":"Workshop on Compiler Support for System Software","article-title":"Compiler techniques for code compression","author":"Debray","year":"1999"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB8","series-title":"Data Compression Conference","first-page":"542","article-title":"A new compression scheme for syntactically structured messages (programs) and its applications to Java and the Internet","author":"Eck","year":"1998"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB9","series-title":"Proceedings of the ACM Sigplan '97 Conference on Programming Language Design and Implementation","first-page":"358","article-title":"Code compression","author":"Ernst","year":"1997"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB10","first-page":"148","article-title":"Bytecode compression via profiled grammar rewriting","volume":"36","author":"Evans","year":"2001"},{"year":"1994","series-title":"\u201cCode-Generation On-the-Fly: A Key to Portable Software,\u201d Ph.D. thesis, ETH Zurich","author":"Franz","key":"10.1016\/S1571-0661(05)80458-X_BIB11"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB12","series-title":"Proceedings of the ACM Conference on Programming Language Design and Implementation","article-title":"Automatic inference of models for statistical code compression","author":"Fraser","year":"1999"},{"year":"1995","series-title":"\u201cDesign Patterns: Elements of Reusable Object-Oriented Software,\u201d Addison-Wesley, Massachusetts","author":"Gamma","key":"10.1016\/S1571-0661(05)80458-X_BIB13"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB14","series-title":"Journal of Functional Programming 2","first-page":"323","article-title":"Higher-order functions for parsing","author":"Hutton","year":"1992"},{"year":"1999","series-title":"\u201cContinuous Program Optimization,\u201d Ph.D. thesis, University of California, Irvine","author":"Kistler","key":"10.1016\/S1571-0661(05)80458-X_BIB15"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB16","series-title":"ACM Transactions on Programming Languages and Systems","article-title":"Automated data-member layout of heap objects to improve memory-hierarchy performance","author":"Kistler","year":"2000"},{"year":"2001","series-title":"Type-preserving compilation of featherweight Java, 8th Foundations of Object-Oriented Languages Workshop (FOOL'8)","author":"League","key":"10.1016\/S1571-0661(05)80458-X_BIB17"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB18","series-title":"Proceedings of the ACM Conference on Programming Language Design and Implementation","article-title":"Split stream dictionary program compression","author":"Lucco","year":"2000"},{"year":"1990","series-title":"\u201cIntroduction to the Theory of Programming Languages,\u201d PHI Series in Computer Science","author":"Meyer","key":"10.1016\/S1571-0661(05)80458-X_BIB19"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB20","first-page":"528","article-title":"From System F to Typed Assembly Language","volume":"23","author":"Morrisett","year":"1999"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB21","series-title":"POPL: 28th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages","article-title":"Oracle-based checking of untrusted software","author":"Necula","year":"2001"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB22","series-title":"Proceedings of the 24th ACM Symposium on Principles of Programming Languages","article-title":"Proof-Carrying Code","author":"Necula","year":"1997"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB23","series-title":"ACM SIGPLAN Conference on Programming Language Design and Implementation","first-page":"247","article-title":"Compressing Java classfiles","author":"Pugh","year":"1999"},{"year":"1996","series-title":"Supporting dynamic languages on the Java virtual machine","author":"Shivers","key":"10.1016\/S1571-0661(05)80458-X_BIB24"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB25","series-title":"Workshop on Intermediate Representation Engineering (IRE 2001), to appear in Intl. Conf. on Systemics, Cybernetics and Informatics (SCI)","article-title":"Compressed abstract syntax trees for mobile code","author":"Stork","year":"2001"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB26","series-title":"Technical Report","first-page":"00","article-title":"Generic adaptive syntax-directed compression for mobile code","author":"Stork","year":"2001"},{"year":"2000","series-title":"\u201cJava 2 Platform Micro Edition (J2ME) Technology for Creating Mobile Devices: White Paper,\u201d","author":"Microsystems","key":"10.1016\/S1571-0661(05)80458-X_BIB27"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB28","series-title":"Proceedings of the Data Compression Conference","first-page":"442","article-title":"Context coding of parse trees","author":"Tarhio","year":"1995"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB29","series-title":"Proc. of Eigth Symposium on String Processing and Information Retrieval (SPIRE 2001)","article-title":"On compression of parse trees","author":"Tarhio","year":"2001"},{"year":"1996","series-title":"\u201cLanguage Prototyping: An Algebraic Specification Approach,\u201d World Scientific, Singapore","author":"van Deursen","key":"10.1016\/S1571-0661(05)80458-X_BIB30"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB31","first-page":"113","article-title":"How to replace failure by a list of successes. in:","volume":"201","author":"Wadler","year":"1985"},{"key":"10.1016\/S1571-0661(05)80458-X_BIB32","first-page":"520","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580458X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580458X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:07Z","timestamp":1761610027000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610580458X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S157106610580458X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80458-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2001,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards Language-Agnostic Mobile Code","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80458-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}