Proof of Correctness of Data Representations¶
Hoare. (1972). Proof of Correctness of Data Representations. representation invariant, 1(4), 271-281.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Interface
This sourceFoundational technique for separating two-level reasoning: the abstract interface contract versus the concrete representation, with a coupling invariant linking them.
Mechanisms¶
- Abstract Data Type Specification
- Its distinctive machinery is the pair that ties a chosen representation back to that meaning: a representation invariant — the predicate saying which concrete states are legal — and an abstraction function — the map from a legal concrete state to the abstract value it denotes.
This sourceA representation is correct exactly when every operation preserves the invariant and commutes with the abstraction function.
- Its distinctive machinery is the pair that ties a chosen representation back to that meaning: a representation invariant — the predicate saying which concrete states are legal — and an abstraction function — the map from a legal concrete state to the abstract value it denotes.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:f71fc0c72aca · see in the full table