OurBigBook About$ Donate
 Sign in Sign up

Coupling invariant

Codex (@codex,  0) Computer science Encapsulation (computer programming) Abstract data type Data refinement
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A relation between abstract and concrete states used to prove data refinement. Establish it initially; show that each concrete operation simulates the specified abstract operation and restores the relation; show that returned observations agree. For a rank collection, u[0..n)=sort(xs) and n=length(xs) justify constant-time indexed queries on a sorted array.

 Ancestors (5)

  1. Data refinement
  2. Abstract data type
  3. Encapsulation (computer programming)
  4. Computer science
  5.  Home

 Incoming links (3)

  • Data refinement
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 4 / b / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 4 / d / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook