Conference
Correctness of intrusive data structures using mixins
Abstract
A dynamic mixin is a code fragment that is meant to be dynamically bound to an object. Dynamic mixins support more flexible code composition than class inheritance and can be used to implement roles that objects acquire dynamically. We propose a theory, based on data refinement, for reasoning about the correctness of programs with mixins. The theory is suited for applications of mixins to intrusive data structures, where the data structure is …
Authors
Burton E; Sekerinski E
Pagination
pp. 53-58
Publisher
Association for Computing Machinery (ACM)
Publication Date
June 17, 2013
DOI
10.1145/2465449.2465466
Name of conference
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering