We present an abstract machine that encodes both type safety and control safety in an efficient manner and that is suitable as a mobile-code format. At the code consumer, a single linear-complexity algorithm performs not only verification, but simultaneously also transforms the stack-based wire format into a register-based internal format. The latter is beneficial for interpretation and native code generation. Our dual-representation approach overcomes some of the disadvantages of existing mobile-code representations, such as the JVM and CLR wire formats.
Cookie Settings
eScholarship uses cookies to ensure you have the best experience on our website. You can manage which cookies you want us to use.
Our Privacy Statement includes more details on the cookies we use and how we protect your privacy.
