One VM to rule them all

@inproceedings{Wrthinger2013OneVT,
  title={One VM to rule them all},
  author={Thomas W{\"u}rthinger and C. Wimmer and A. W{\"o}{\ss} and Lukas Stadler and Gilles Duboscq and Christian Humer and G. Richards and Doug Simon and M. Wolczko},
  booktitle={Onward!},
  year={2013}
}
  • Thomas Würthinger, C. Wimmer, +6 authors M. Wolczko
  • Published in Onward! 2013
  • Computer Science
  • Building high-performance virtual machines is a complex and expensive undertaking; many popular languages still have low-performance implementations. [...] Key Method The approach relies on abstract syntax tree (AST) interpretation where a node can rewrite itself to a more specialized or more general node, together with an optimizing compiler that exploits the structure of the interpreter. The compiler uses speculative assumptions and deoptimization in order to produce efficient machine code. Our initial…Expand Abstract
    ZipPy on truffle: a fast and simple implementation of python
    13
    Efficient Hosted Interpreter for Dynamic Languages
    4
    On-Stack Replacement à la Carte
    A fast abstract syntax tree interpreter for R
    31
    Designing an Adaptive VM That Combines Vectorized and JIT Execution on Heterogeneous Hardware
    3
    Micro virtual machines: A solid foundation for managed language implementation
    1
    Flexible on-stack replacement in LLVM
    11
    Sulong - execution of LLVM-based languages on the JVM: position paper
    5

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    M
    245186
    A dynamically configurable
    • 1998