Efficient dynamic dispatching with type slicing

@article{Gil2007EfficientDD,
  title={Efficient dynamic dispatching with type slicing},
  author={Joseph Gil and Yoav Zibin},
  journal={ACM Trans. Program. Lang. Syst.},
  year={2007},
  volume={30},
  pages={5}
}
A fundamental problem in the implementation of object-oriented languages is that of a frugal implementation of dynamic dispatching, that is, a small footprint data structure that supports quick response to runtime dispatching queries of the following format: which method should be executed in response to a certain message sent to a given object. Previous theoretical algorithms for this problem tend to be impractical due to their conceptual complexity and large hidden constants. In contrast… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-3 OF 3 CITATIONS

Engineering Theories with Z3

  • IWIL@LPAR
  • 2011
VIEW 1 EXCERPT
CITES METHODS

Smaller footprint for Java collections

  • OOPSLA Companion
  • 2011
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Empirical study of object-layout strategies and optimization techniques

J. GIL
  • Proceedings of the 14th European Conference on Object-Oriented Programming (ECOOP’00) E. Bertino, Ed. (Sophia Antipolis and Cannes, France). Lecture Notes in Computer Science, vol. 1850. Springer Verlag, New York, 394–421.
  • 2000
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Minimizing Row Displacement Dispatch Tables

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Selector Table Indexing & Sparse Arrays

  • OOPSLA
  • 1993
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL