Abstract
We describe how contract violations in JavaTM hashCode methods can be repaired using novel combination of semantics-preserving and generative methods, the latter being achieved via Automatic Improvement Programming. The method described is universally applicable. When applied to the Hadoop platform, it was established that it produces hashCode functions that are at least as good as the original, broken method as well as those produced by a widely-used alternative method from the 'Apache Commons' library. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Kocsis, Z. A., Neumann, G., Swan, J., Epitropakis, M. G., Brownlee, A. E. I., Haraldsson, S. O., & Bowles, E. (2014). Repairing and optimizing hadoop hashCode implementations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8636 LNCS, pp. 259–264). Springer Verlag. https://doi.org/10.1007/978-3-319-09940-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
