%0 Journal Article %1 Stork2001142 %A Stork, Christian H. %A Housel, Peter S. %A Haldar, Vivek %A Dalton, Niall %A Franz, Michael %D 2001 %J Electronic Notes in Theoretical Computer Science %K AST Bytecode %N 1 %P 142 - 157 %R DOI: 10.1016/S1571-0661(05)80458-X %T Towards Language-Agnostic Mobile Code %U http://www.sciencedirect.com/science/article/B75H1-4G1PCXN-C/2/f291b92a202abc8499b6d7dc7bdcf51f %V 59 %X The Java Virtual Machine is primarily designed for transporting Java programs. As a consequence, when JVM bytecodes are used to transport programs in other languages, the result becomes less acceptable the more the source language diverges from Java. Microsoft's .NET transport format fares better in this respect because it has a more flexible type system and instruction set, but it is not extensible, and (for example) has no provision for supporting explicit programmer-specified parallelism. Both platforms have difficulty making transported programs run efficiently. This paper discusses first steps towards mobile code representations that are independent (in the sense that the representation can be appropriately parameterized) of the source language (e.g., Java), intermediate representation (e.g., bytecode), and target architecture (e.g., x86). We call this kind of parameterizable framework language-agnostic. We present two techniques which provide parts of the envisioned language-agnostic functionality. Compressed abstract syntax trees as a wire format provide for a very dense encoding of programs at a high level of abstraction. We show how to parameterize the compression algorithm in a modular fashion with knowledge beyond the purely syntactical level. This leads to the notion of well-formedness by construction. The second technique defines the semantics of programs by mapping from abstract syntax trees to a typed core calculus representation. Based on this representation it becomes possible to use portable definitions of security policies and to execute programs written in different source languages, even if a more efficient trusted native compiler is not available on the target platform.

@article{Stork2001142, abstract = {The Java Virtual Machine is primarily designed for transporting Java programs. As a consequence, when JVM bytecodes are used to transport programs in other languages, the result becomes less acceptable the more the source language diverges from Java. Microsoft's .NET transport format fares better in this respect because it has a more flexible type system and instruction set, but it is not extensible, and (for example) has no provision for supporting explicit programmer-specified parallelism. Both platforms have difficulty making transported programs run efficiently. This paper discusses first steps towards mobile code representations that are independent (in the sense that the representation can be appropriately parameterized) of the source language (e.g., Java), intermediate representation (e.g., bytecode), and target architecture (e.g., x86). We call this kind of parameterizable framework language-agnostic. We present two techniques which provide parts of the envisioned language-agnostic functionality. Compressed abstract syntax trees as a wire format provide for a very dense encoding of programs at a high level of abstraction. We show how to parameterize the compression algorithm in a modular fashion with knowledge beyond the purely syntactical level. This leads to the notion of well-formedness by construction. The second technique defines the semantics of programs by mapping from abstract syntax trees to a typed core calculus representation. Based on this representation it becomes possible to use portable definitions of security policies and to execute programs written in different source languages, even if a more efficient trusted native compiler is not available on the target platform.}, added-at = {2009-03-20T16:30:58.000+0100}, author = {Stork, Christian H. and Housel, Peter S. and Haldar, Vivek and Dalton, Niall and Franz, Michael}, biburl = {https://www.bibsonomy.org/bibtex/27e96e94731a159579737293941f3a32d/gron}, description = {ScienceDirect - Electronic Notes in Theoretical Computer Science : Towards Language-Agnostic Mobile Code}, doi = {DOI: 10.1016/S1571-0661(05)80458-X}, interhash = {db8d49696da06df3476c0b945f4532f1}, intrahash = {7e96e94731a159579737293941f3a32d}, issn = {1571-0661}, journal = {Electronic Notes in Theoretical Computer Science}, keywords = {AST Bytecode}, note = {BABEL'01, First International Workshop on Multi-Language Infrastructure and Interoperability (Satellite Event of PLI 2001)}, number = 1, pages = {142 - 157}, timestamp = {2009-03-20T16:30:58.000+0100}, title = {Towards Language-Agnostic Mobile Code}, url = {http://www.sciencedirect.com/science/article/B75H1-4G1PCXN-C/2/f291b92a202abc8499b6d7dc7bdcf51f}, volume = 59, year = 2001 }