Equality and Hashing for (almost) Free: Generating Implementations from Abstraction Functions
In an object-oriented language such as Java, every class requires implementations of two special methods, one for determining equality and one for computing hash codes. Although the specification of these methods is usually straightforward, they can be hard to code (due to subclassing, delegation, c...
Main Authors: | Rayside, Derek, Benjamin, Zev, Singh, Rishabh, Near, Joseph Paul, Milicevic, Aleksandar, Jackson, Daniel |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/51695 https://orcid.org/0000-0003-4864-078X |
Similar Items
-
Symbolic Execution for (Almost) Free: Hijacking an Existing Implementation to Perform Symbolic Execution
by: Near, Joseph P., et al.
Published: (2014) -
Unifying Execution of Imperative and Declarative Code
by: Milicevic, Aleksandar, et al.
Published: (2012) -
Agile specifications
by: Rayside, Derek, et al.
Published: (2011) -
Automating abstraction functions
by: Rayside, Derek F
Published: (2011) -
Alloy*: A General-Purpose Higher-Order Relational Constraint Solver
by: Milicevic, Aleksandar, et al.
Published: (2018)