Empirical assessment of C++-like implementations for multiple inheritance

Authors:
Floréal Morandat;Roland Ducournau
Affiliations:
LIRMM - Université Montpellier, France;LIRMM - Université Montpellier, France
Venue:
Proceedings of the Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems
Year:
2010

Citing 10
Cited 0

Type-extension type test can be performed in constant time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Space efficient conservative garbage collection

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Inside the C++ object model

Inside the C++ object model
Perfect hashing

Theoretical Computer Science
Efficient dynamic dispatch without virtual function tables: the SmallEiffel compiler

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Efficient Polymorphic Calls

Efficient Polymorphic Calls
Quantifying and evaluating the space overhead for alternative C++ memory layouts

Software—Practice & Experience
Perfect hashing as an almost perfect subtype test

ACM Transactions on Programming Languages and Systems (TOPLAS)
Empirical assessment of object-oriented implementations with multiple inheritance and static typing

Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
Implementing statically typed object-oriented programming languages

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multiple inheritance and dynamic loading increase the overhead yielded by object-oriented mechanisms like late binding. This article provides an empirical assessment of the implementation technique that can be used in this context, namely C++-like subobjects and perfect hashing. Theses new results represent a first comparison of the implementation of C++, and show that perfect hashing is also promising in this context.